//Link to eslint repo: https://github.com/eslint/eslint v4.0.0 //The code below is the output of running the browserify script included in the source code //Copyright JS Foundation and other contributors, https://js.foundation // // Permission is hereby granted, free of charge, to any person obtaining a copy // of this software and associated documentation files (the "Software"), to deal // in the Software without restriction, including without limitation the rights // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell // copies of the Software, and to permit persons to whom the Software is // furnished to do so, subject to the following conditions: // // The above copyright notice and this permission notice shall be included in // all copies or substantial portions of the Software. // // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN // THE SOFTWARE. (function(){ var require = (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o 2 ? arguments[2] : undefined , count = Math.min((end === undefined ? len : toIndex(end, len)) - from, len - to) , inc = 1; if(from < to && to < from + count){ inc = -1; from += count - 1; to += count - 1; } while(count-- > 0){ if(from in O)O[to] = O[from]; else delete O[to]; to += inc; from += inc; } return O; }; },{"105":105,"108":108,"109":109}],9:[function(_dereq_,module,exports){ // 22.1.3.6 Array.prototype.fill(value, start = 0, end = this.length) 'use strict'; var toObject = _dereq_(109) , toIndex = _dereq_(105) , toLength = _dereq_(108); module.exports = function fill(value /*, start = 0, end = @length */){ var O = toObject(this) , length = toLength(O.length) , aLen = arguments.length , index = toIndex(aLen > 1 ? arguments[1] : undefined, length) , end = aLen > 2 ? arguments[2] : undefined , endPos = end === undefined ? length : toIndex(end, length); while(endPos > index)O[index++] = value; return O; }; },{"105":105,"108":108,"109":109}],10:[function(_dereq_,module,exports){ var forOf = _dereq_(37); module.exports = function(iter, ITERATOR){ var result = []; forOf(iter, false, result.push, result, ITERATOR); return result; }; },{"37":37}],11:[function(_dereq_,module,exports){ // false -> Array#indexOf // true -> Array#includes var toIObject = _dereq_(107) , toLength = _dereq_(108) , toIndex = _dereq_(105); module.exports = function(IS_INCLUDES){ return function($this, el, fromIndex){ var O = toIObject($this) , length = toLength(O.length) , index = toIndex(fromIndex, length) , value; // Array#includes uses SameValueZero equality algorithm if(IS_INCLUDES && el != el)while(length > index){ value = O[index++]; if(value != value)return true; // Array#toIndex ignores holes, Array#includes - not } else for(;length > index; index++)if(IS_INCLUDES || index in O){ if(O[index] === el)return IS_INCLUDES || index || 0; } return !IS_INCLUDES && -1; }; }; },{"105":105,"107":107,"108":108}],12:[function(_dereq_,module,exports){ // 0 -> Array#forEach // 1 -> Array#map // 2 -> Array#filter // 3 -> Array#some // 4 -> Array#every // 5 -> Array#find // 6 -> Array#findIndex var ctx = _dereq_(25) , IObject = _dereq_(45) , toObject = _dereq_(109) , toLength = _dereq_(108) , asc = _dereq_(15); module.exports = function(TYPE, $create){ var IS_MAP = TYPE == 1 , IS_FILTER = TYPE == 2 , IS_SOME = TYPE == 3 , IS_EVERY = TYPE == 4 , IS_FIND_INDEX = TYPE == 6 , NO_HOLES = TYPE == 5 || IS_FIND_INDEX , create = $create || asc; return function($this, callbackfn, that){ var O = toObject($this) , self = IObject(O) , f = ctx(callbackfn, that, 3) , length = toLength(self.length) , index = 0 , result = IS_MAP ? create($this, length) : IS_FILTER ? create($this, 0) : undefined , val, res; for(;length > index; index++)if(NO_HOLES || index in self){ val = self[index]; res = f(val, index, O); if(TYPE){ if(IS_MAP)result[index] = res; // map else if(res)switch(TYPE){ case 3: return true; // some case 5: return val; // find case 6: return index; // findIndex case 2: result.push(val); // filter } else if(IS_EVERY)return false; // every } } return IS_FIND_INDEX ? -1 : IS_SOME || IS_EVERY ? IS_EVERY : result; }; }; },{"108":108,"109":109,"15":15,"25":25,"45":45}],13:[function(_dereq_,module,exports){ var aFunction = _dereq_(3) , toObject = _dereq_(109) , IObject = _dereq_(45) , toLength = _dereq_(108); module.exports = function(that, callbackfn, aLen, memo, isRight){ aFunction(callbackfn); var O = toObject(that) , self = IObject(O) , length = toLength(O.length) , index = isRight ? length - 1 : 0 , i = isRight ? -1 : 1; if(aLen < 2)for(;;){ if(index in self){ memo = self[index]; index += i; break; } index += i; if(isRight ? index < 0 : length <= index){ throw TypeError('Reduce of empty array with no initial value'); } } for(;isRight ? index >= 0 : length > index; index += i)if(index in self){ memo = callbackfn(memo, self[index], index, O); } return memo; }; },{"108":108,"109":109,"3":3,"45":45}],14:[function(_dereq_,module,exports){ var isObject = _dereq_(49) , isArray = _dereq_(47) , SPECIES = _dereq_(117)('species'); module.exports = function(original){ var C; if(isArray(original)){ C = original.constructor; // cross-realm fallback if(typeof C == 'function' && (C === Array || isArray(C.prototype)))C = undefined; if(isObject(C)){ C = C[SPECIES]; if(C === null)C = undefined; } } return C === undefined ? Array : C; }; },{"117":117,"47":47,"49":49}],15:[function(_dereq_,module,exports){ // 9.4.2.3 ArraySpeciesCreate(originalArray, length) var speciesConstructor = _dereq_(14); module.exports = function(original, length){ return new (speciesConstructor(original))(length); }; },{"14":14}],16:[function(_dereq_,module,exports){ 'use strict'; var aFunction = _dereq_(3) , isObject = _dereq_(49) , invoke = _dereq_(44) , arraySlice = [].slice , factories = {}; var construct = function(F, len, args){ if(!(len in factories)){ for(var n = [], i = 0; i < len; i++)n[i] = 'a[' + i + ']'; factories[len] = Function('F,a', 'return new F(' + n.join(',') + ')'); } return factories[len](F, args); }; module.exports = Function.bind || function bind(that /*, args... */){ var fn = aFunction(this) , partArgs = arraySlice.call(arguments, 1); var bound = function(/* args... */){ var args = partArgs.concat(arraySlice.call(arguments)); return this instanceof bound ? construct(fn, args.length, args) : invoke(fn, args, that); }; if(isObject(fn.prototype))bound.prototype = fn.prototype; return bound; }; },{"3":3,"44":44,"49":49}],17:[function(_dereq_,module,exports){ // getting tag from 19.1.3.6 Object.prototype.toString() var cof = _dereq_(18) , TAG = _dereq_(117)('toStringTag') // ES3 wrong here , ARG = cof(function(){ return arguments; }()) == 'Arguments'; // fallback for IE11 Script Access Denied error var tryGet = function(it, key){ try { return it[key]; } catch(e){ /* empty */ } }; module.exports = function(it){ var O, T, B; return it === undefined ? 'Undefined' : it === null ? 'Null' // @@toStringTag case : typeof (T = tryGet(O = Object(it), TAG)) == 'string' ? T // builtinTag case : ARG ? cof(O) // ES3 arguments fallback : (B = cof(O)) == 'Object' && typeof O.callee == 'function' ? 'Arguments' : B; }; },{"117":117,"18":18}],18:[function(_dereq_,module,exports){ var toString = {}.toString; module.exports = function(it){ return toString.call(it).slice(8, -1); }; },{}],19:[function(_dereq_,module,exports){ 'use strict'; var dP = _dereq_(67).f , create = _dereq_(66) , redefineAll = _dereq_(86) , ctx = _dereq_(25) , anInstance = _dereq_(6) , defined = _dereq_(27) , forOf = _dereq_(37) , $iterDefine = _dereq_(53) , step = _dereq_(55) , setSpecies = _dereq_(91) , DESCRIPTORS = _dereq_(28) , fastKey = _dereq_(62).fastKey , SIZE = DESCRIPTORS ? '_s' : 'size'; var getEntry = function(that, key){ // fast case var index = fastKey(key), entry; if(index !== 'F')return that._i[index]; // frozen object case for(entry = that._f; entry; entry = entry.n){ if(entry.k == key)return entry; } }; module.exports = { getConstructor: function(wrapper, NAME, IS_MAP, ADDER){ var C = wrapper(function(that, iterable){ anInstance(that, C, NAME, '_i'); that._i = create(null); // index that._f = undefined; // first entry that._l = undefined; // last entry that[SIZE] = 0; // size if(iterable != undefined)forOf(iterable, IS_MAP, that[ADDER], that); }); redefineAll(C.prototype, { // 23.1.3.1 Map.prototype.clear() // 23.2.3.2 Set.prototype.clear() clear: function clear(){ for(var that = this, data = that._i, entry = that._f; entry; entry = entry.n){ entry.r = true; if(entry.p)entry.p = entry.p.n = undefined; delete data[entry.i]; } that._f = that._l = undefined; that[SIZE] = 0; }, // 23.1.3.3 Map.prototype.delete(key) // 23.2.3.4 Set.prototype.delete(value) 'delete': function(key){ var that = this , entry = getEntry(that, key); if(entry){ var next = entry.n , prev = entry.p; delete that._i[entry.i]; entry.r = true; if(prev)prev.n = next; if(next)next.p = prev; if(that._f == entry)that._f = next; if(that._l == entry)that._l = prev; that[SIZE]--; } return !!entry; }, // 23.2.3.6 Set.prototype.forEach(callbackfn, thisArg = undefined) // 23.1.3.5 Map.prototype.forEach(callbackfn, thisArg = undefined) forEach: function forEach(callbackfn /*, that = undefined */){ anInstance(this, C, 'forEach'); var f = ctx(callbackfn, arguments.length > 1 ? arguments[1] : undefined, 3) , entry; while(entry = entry ? entry.n : this._f){ f(entry.v, entry.k, this); // revert to the last existing entry while(entry && entry.r)entry = entry.p; } }, // 23.1.3.7 Map.prototype.has(key) // 23.2.3.7 Set.prototype.has(value) has: function has(key){ return !!getEntry(this, key); } }); if(DESCRIPTORS)dP(C.prototype, 'size', { get: function(){ return defined(this[SIZE]); } }); return C; }, def: function(that, key, value){ var entry = getEntry(that, key) , prev, index; // change existing entry if(entry){ entry.v = value; // create new entry } else { that._l = entry = { i: index = fastKey(key, true), // <- index k: key, // <- key v: value, // <- value p: prev = that._l, // <- previous entry n: undefined, // <- next entry r: false // <- removed }; if(!that._f)that._f = entry; if(prev)prev.n = entry; that[SIZE]++; // add to index if(index !== 'F')that._i[index] = entry; } return that; }, getEntry: getEntry, setStrong: function(C, NAME, IS_MAP){ // add .keys, .values, .entries, [@@iterator] // 23.1.3.4, 23.1.3.8, 23.1.3.11, 23.1.3.12, 23.2.3.5, 23.2.3.8, 23.2.3.10, 23.2.3.11 $iterDefine(C, NAME, function(iterated, kind){ this._t = iterated; // target this._k = kind; // kind this._l = undefined; // previous }, function(){ var that = this , kind = that._k , entry = that._l; // revert to the last existing entry while(entry && entry.r)entry = entry.p; // get next entry if(!that._t || !(that._l = entry = entry ? entry.n : that._t._f)){ // or finish the iteration that._t = undefined; return step(1); } // return step by kind if(kind == 'keys' )return step(0, entry.k); if(kind == 'values')return step(0, entry.v); return step(0, [entry.k, entry.v]); }, IS_MAP ? 'entries' : 'values' , !IS_MAP, true); // add [@@species], 23.1.2.2, 23.2.2.2 setSpecies(NAME); } }; },{"25":25,"27":27,"28":28,"37":37,"53":53,"55":55,"6":6,"62":62,"66":66,"67":67,"86":86,"91":91}],20:[function(_dereq_,module,exports){ // https://github.com/DavidBruant/Map-Set.prototype.toJSON var classof = _dereq_(17) , from = _dereq_(10); module.exports = function(NAME){ return function toJSON(){ if(classof(this) != NAME)throw TypeError(NAME + "#toJSON isn't generic"); return from(this); }; }; },{"10":10,"17":17}],21:[function(_dereq_,module,exports){ 'use strict'; var redefineAll = _dereq_(86) , getWeak = _dereq_(62).getWeak , anObject = _dereq_(7) , isObject = _dereq_(49) , anInstance = _dereq_(6) , forOf = _dereq_(37) , createArrayMethod = _dereq_(12) , $has = _dereq_(39) , arrayFind = createArrayMethod(5) , arrayFindIndex = createArrayMethod(6) , id = 0; // fallback for uncaught frozen keys var uncaughtFrozenStore = function(that){ return that._l || (that._l = new UncaughtFrozenStore); }; var UncaughtFrozenStore = function(){ this.a = []; }; var findUncaughtFrozen = function(store, key){ return arrayFind(store.a, function(it){ return it[0] === key; }); }; UncaughtFrozenStore.prototype = { get: function(key){ var entry = findUncaughtFrozen(this, key); if(entry)return entry[1]; }, has: function(key){ return !!findUncaughtFrozen(this, key); }, set: function(key, value){ var entry = findUncaughtFrozen(this, key); if(entry)entry[1] = value; else this.a.push([key, value]); }, 'delete': function(key){ var index = arrayFindIndex(this.a, function(it){ return it[0] === key; }); if(~index)this.a.splice(index, 1); return !!~index; } }; module.exports = { getConstructor: function(wrapper, NAME, IS_MAP, ADDER){ var C = wrapper(function(that, iterable){ anInstance(that, C, NAME, '_i'); that._i = id++; // collection id that._l = undefined; // leak store for uncaught frozen objects if(iterable != undefined)forOf(iterable, IS_MAP, that[ADDER], that); }); redefineAll(C.prototype, { // 23.3.3.2 WeakMap.prototype.delete(key) // 23.4.3.3 WeakSet.prototype.delete(value) 'delete': function(key){ if(!isObject(key))return false; var data = getWeak(key); if(data === true)return uncaughtFrozenStore(this)['delete'](key); return data && $has(data, this._i) && delete data[this._i]; }, // 23.3.3.4 WeakMap.prototype.has(key) // 23.4.3.4 WeakSet.prototype.has(value) has: function has(key){ if(!isObject(key))return false; var data = getWeak(key); if(data === true)return uncaughtFrozenStore(this).has(key); return data && $has(data, this._i); } }); return C; }, def: function(that, key, value){ var data = getWeak(anObject(key), true); if(data === true)uncaughtFrozenStore(that).set(key, value); else data[that._i] = value; return that; }, ufstore: uncaughtFrozenStore }; },{"12":12,"37":37,"39":39,"49":49,"6":6,"62":62,"7":7,"86":86}],22:[function(_dereq_,module,exports){ 'use strict'; var global = _dereq_(38) , $export = _dereq_(32) , redefine = _dereq_(87) , redefineAll = _dereq_(86) , meta = _dereq_(62) , forOf = _dereq_(37) , anInstance = _dereq_(6) , isObject = _dereq_(49) , fails = _dereq_(34) , $iterDetect = _dereq_(54) , setToStringTag = _dereq_(92) , inheritIfRequired = _dereq_(43); module.exports = function(NAME, wrapper, methods, common, IS_MAP, IS_WEAK){ var Base = global[NAME] , C = Base , ADDER = IS_MAP ? 'set' : 'add' , proto = C && C.prototype , O = {}; var fixMethod = function(KEY){ var fn = proto[KEY]; redefine(proto, KEY, KEY == 'delete' ? function(a){ return IS_WEAK && !isObject(a) ? false : fn.call(this, a === 0 ? 0 : a); } : KEY == 'has' ? function has(a){ return IS_WEAK && !isObject(a) ? false : fn.call(this, a === 0 ? 0 : a); } : KEY == 'get' ? function get(a){ return IS_WEAK && !isObject(a) ? undefined : fn.call(this, a === 0 ? 0 : a); } : KEY == 'add' ? function add(a){ fn.call(this, a === 0 ? 0 : a); return this; } : function set(a, b){ fn.call(this, a === 0 ? 0 : a, b); return this; } ); }; if(typeof C != 'function' || !(IS_WEAK || proto.forEach && !fails(function(){ new C().entries().next(); }))){ // create collection constructor C = common.getConstructor(wrapper, NAME, IS_MAP, ADDER); redefineAll(C.prototype, methods); meta.NEED = true; } else { var instance = new C // early implementations not supports chaining , HASNT_CHAINING = instance[ADDER](IS_WEAK ? {} : -0, 1) != instance // V8 ~ Chromium 40- weak-collections throws on primitives, but should return false , THROWS_ON_PRIMITIVES = fails(function(){ instance.has(1); }) // most early implementations doesn't supports iterables, most modern - not close it correctly , ACCEPT_ITERABLES = $iterDetect(function(iter){ new C(iter); }) // eslint-disable-line no-new // for early implementations -0 and +0 not the same , BUGGY_ZERO = !IS_WEAK && fails(function(){ // V8 ~ Chromium 42- fails only with 5+ elements var $instance = new C() , index = 5; while(index--)$instance[ADDER](index, index); return !$instance.has(-0); }); if(!ACCEPT_ITERABLES){ C = wrapper(function(target, iterable){ anInstance(target, C, NAME); var that = inheritIfRequired(new Base, target, C); if(iterable != undefined)forOf(iterable, IS_MAP, that[ADDER], that); return that; }); C.prototype = proto; proto.constructor = C; } if(THROWS_ON_PRIMITIVES || BUGGY_ZERO){ fixMethod('delete'); fixMethod('has'); IS_MAP && fixMethod('get'); } if(BUGGY_ZERO || HASNT_CHAINING)fixMethod(ADDER); // weak collections should not contains .clear method if(IS_WEAK && proto.clear)delete proto.clear; } setToStringTag(C, NAME); O[NAME] = C; $export($export.G + $export.W + $export.F * (C != Base), O); if(!IS_WEAK)common.setStrong(C, NAME, IS_MAP); return C; }; },{"32":32,"34":34,"37":37,"38":38,"43":43,"49":49,"54":54,"6":6,"62":62,"86":86,"87":87,"92":92}],23:[function(_dereq_,module,exports){ var core = module.exports = {version: '2.4.0'}; if(typeof __e == 'number')__e = core; // eslint-disable-line no-undef },{}],24:[function(_dereq_,module,exports){ 'use strict'; var $defineProperty = _dereq_(67) , createDesc = _dereq_(85); module.exports = function(object, index, value){ if(index in object)$defineProperty.f(object, index, createDesc(0, value)); else object[index] = value; }; },{"67":67,"85":85}],25:[function(_dereq_,module,exports){ // optional / simple context binding var aFunction = _dereq_(3); module.exports = function(fn, that, length){ aFunction(fn); if(that === undefined)return fn; switch(length){ case 1: return function(a){ return fn.call(that, a); }; case 2: return function(a, b){ return fn.call(that, a, b); }; case 3: return function(a, b, c){ return fn.call(that, a, b, c); }; } return function(/* ...args */){ return fn.apply(that, arguments); }; }; },{"3":3}],26:[function(_dereq_,module,exports){ 'use strict'; var anObject = _dereq_(7) , toPrimitive = _dereq_(110) , NUMBER = 'number'; module.exports = function(hint){ if(hint !== 'string' && hint !== NUMBER && hint !== 'default')throw TypeError('Incorrect hint'); return toPrimitive(anObject(this), hint != NUMBER); }; },{"110":110,"7":7}],27:[function(_dereq_,module,exports){ // 7.2.1 RequireObjectCoercible(argument) module.exports = function(it){ if(it == undefined)throw TypeError("Can't call method on " + it); return it; }; },{}],28:[function(_dereq_,module,exports){ // Thank's IE8 for his funny defineProperty module.exports = !_dereq_(34)(function(){ return Object.defineProperty({}, 'a', {get: function(){ return 7; }}).a != 7; }); },{"34":34}],29:[function(_dereq_,module,exports){ var isObject = _dereq_(49) , document = _dereq_(38).document // in old IE typeof document.createElement is 'object' , is = isObject(document) && isObject(document.createElement); module.exports = function(it){ return is ? document.createElement(it) : {}; }; },{"38":38,"49":49}],30:[function(_dereq_,module,exports){ // IE 8- don't enum bug keys module.exports = ( 'constructor,hasOwnProperty,isPrototypeOf,propertyIsEnumerable,toLocaleString,toString,valueOf' ).split(','); },{}],31:[function(_dereq_,module,exports){ // all enumerable object keys, includes symbols var getKeys = _dereq_(76) , gOPS = _dereq_(73) , pIE = _dereq_(77); module.exports = function(it){ var result = getKeys(it) , getSymbols = gOPS.f; if(getSymbols){ var symbols = getSymbols(it) , isEnum = pIE.f , i = 0 , key; while(symbols.length > i)if(isEnum.call(it, key = symbols[i++]))result.push(key); } return result; }; },{"73":73,"76":76,"77":77}],32:[function(_dereq_,module,exports){ var global = _dereq_(38) , core = _dereq_(23) , hide = _dereq_(40) , redefine = _dereq_(87) , ctx = _dereq_(25) , PROTOTYPE = 'prototype'; var $export = function(type, name, source){ var IS_FORCED = type & $export.F , IS_GLOBAL = type & $export.G , IS_STATIC = type & $export.S , IS_PROTO = type & $export.P , IS_BIND = type & $export.B , target = IS_GLOBAL ? global : IS_STATIC ? global[name] || (global[name] = {}) : (global[name] || {})[PROTOTYPE] , exports = IS_GLOBAL ? core : core[name] || (core[name] = {}) , expProto = exports[PROTOTYPE] || (exports[PROTOTYPE] = {}) , key, own, out, exp; if(IS_GLOBAL)source = name; for(key in source){ // contains in native own = !IS_FORCED && target && target[key] !== undefined; // export native or passed out = (own ? target : source)[key]; // bind timers to global for call from export context exp = IS_BIND && own ? ctx(out, global) : IS_PROTO && typeof out == 'function' ? ctx(Function.call, out) : out; // extend global if(target)redefine(target, key, out, type & $export.U); // export if(exports[key] != out)hide(exports, key, exp); if(IS_PROTO && expProto[key] != out)expProto[key] = out; } }; global.core = core; // type bitmap $export.F = 1; // forced $export.G = 2; // global $export.S = 4; // static $export.P = 8; // proto $export.B = 16; // bind $export.W = 32; // wrap $export.U = 64; // safe $export.R = 128; // real proto method for `library` module.exports = $export; },{"23":23,"25":25,"38":38,"40":40,"87":87}],33:[function(_dereq_,module,exports){ var MATCH = _dereq_(117)('match'); module.exports = function(KEY){ var re = /./; try { '/./'[KEY](re); } catch(e){ try { re[MATCH] = false; return !'/./'[KEY](re); } catch(f){ /* empty */ } } return true; }; },{"117":117}],34:[function(_dereq_,module,exports){ module.exports = function(exec){ try { return !!exec(); } catch(e){ return true; } }; },{}],35:[function(_dereq_,module,exports){ 'use strict'; var hide = _dereq_(40) , redefine = _dereq_(87) , fails = _dereq_(34) , defined = _dereq_(27) , wks = _dereq_(117); module.exports = function(KEY, length, exec){ var SYMBOL = wks(KEY) , fns = exec(defined, SYMBOL, ''[KEY]) , strfn = fns[0] , rxfn = fns[1]; if(fails(function(){ var O = {}; O[SYMBOL] = function(){ return 7; }; return ''[KEY](O) != 7; })){ redefine(String.prototype, KEY, strfn); hide(RegExp.prototype, SYMBOL, length == 2 // 21.2.5.8 RegExp.prototype[@@replace](string, replaceValue) // 21.2.5.11 RegExp.prototype[@@split](string, limit) ? function(string, arg){ return rxfn.call(string, this, arg); } // 21.2.5.6 RegExp.prototype[@@match](string) // 21.2.5.9 RegExp.prototype[@@search](string) : function(string){ return rxfn.call(string, this); } ); } }; },{"117":117,"27":27,"34":34,"40":40,"87":87}],36:[function(_dereq_,module,exports){ 'use strict'; // 21.2.5.3 get RegExp.prototype.flags var anObject = _dereq_(7); module.exports = function(){ var that = anObject(this) , result = ''; if(that.global) result += 'g'; if(that.ignoreCase) result += 'i'; if(that.multiline) result += 'm'; if(that.unicode) result += 'u'; if(that.sticky) result += 'y'; return result; }; },{"7":7}],37:[function(_dereq_,module,exports){ var ctx = _dereq_(25) , call = _dereq_(51) , isArrayIter = _dereq_(46) , anObject = _dereq_(7) , toLength = _dereq_(108) , getIterFn = _dereq_(118) , BREAK = {} , RETURN = {}; var exports = module.exports = function(iterable, entries, fn, that, ITERATOR){ var iterFn = ITERATOR ? function(){ return iterable; } : getIterFn(iterable) , f = ctx(fn, that, entries ? 2 : 1) , index = 0 , length, step, iterator, result; if(typeof iterFn != 'function')throw TypeError(iterable + ' is not iterable!'); // fast case for arrays with default iterator if(isArrayIter(iterFn))for(length = toLength(iterable.length); length > index; index++){ result = entries ? f(anObject(step = iterable[index])[0], step[1]) : f(iterable[index]); if(result === BREAK || result === RETURN)return result; } else for(iterator = iterFn.call(iterable); !(step = iterator.next()).done; ){ result = call(iterator, f, step.value, entries); if(result === BREAK || result === RETURN)return result; } }; exports.BREAK = BREAK; exports.RETURN = RETURN; },{"108":108,"118":118,"25":25,"46":46,"51":51,"7":7}],38:[function(_dereq_,module,exports){ // https://github.com/zloirock/core-js/issues/86#issuecomment-115759028 var global = module.exports = typeof window != 'undefined' && window.Math == Math ? window : typeof self != 'undefined' && self.Math == Math ? self : Function('return this')(); if(typeof __g == 'number')__g = global; // eslint-disable-line no-undef },{}],39:[function(_dereq_,module,exports){ var hasOwnProperty = {}.hasOwnProperty; module.exports = function(it, key){ return hasOwnProperty.call(it, key); }; },{}],40:[function(_dereq_,module,exports){ var dP = _dereq_(67) , createDesc = _dereq_(85); module.exports = _dereq_(28) ? function(object, key, value){ return dP.f(object, key, createDesc(1, value)); } : function(object, key, value){ object[key] = value; return object; }; },{"28":28,"67":67,"85":85}],41:[function(_dereq_,module,exports){ module.exports = _dereq_(38).document && document.documentElement; },{"38":38}],42:[function(_dereq_,module,exports){ module.exports = !_dereq_(28) && !_dereq_(34)(function(){ return Object.defineProperty(_dereq_(29)('div'), 'a', {get: function(){ return 7; }}).a != 7; }); },{"28":28,"29":29,"34":34}],43:[function(_dereq_,module,exports){ var isObject = _dereq_(49) , setPrototypeOf = _dereq_(90).set; module.exports = function(that, target, C){ var P, S = target.constructor; if(S !== C && typeof S == 'function' && (P = S.prototype) !== C.prototype && isObject(P) && setPrototypeOf){ setPrototypeOf(that, P); } return that; }; },{"49":49,"90":90}],44:[function(_dereq_,module,exports){ // fast apply, http://jsperf.lnkit.com/fast-apply/5 module.exports = function(fn, args, that){ var un = that === undefined; switch(args.length){ case 0: return un ? fn() : fn.call(that); case 1: return un ? fn(args[0]) : fn.call(that, args[0]); case 2: return un ? fn(args[0], args[1]) : fn.call(that, args[0], args[1]); case 3: return un ? fn(args[0], args[1], args[2]) : fn.call(that, args[0], args[1], args[2]); case 4: return un ? fn(args[0], args[1], args[2], args[3]) : fn.call(that, args[0], args[1], args[2], args[3]); } return fn.apply(that, args); }; },{}],45:[function(_dereq_,module,exports){ // fallback for non-array-like ES3 and non-enumerable old V8 strings var cof = _dereq_(18); module.exports = Object('z').propertyIsEnumerable(0) ? Object : function(it){ return cof(it) == 'String' ? it.split('') : Object(it); }; },{"18":18}],46:[function(_dereq_,module,exports){ // check on default Array iterator var Iterators = _dereq_(56) , ITERATOR = _dereq_(117)('iterator') , ArrayProto = Array.prototype; module.exports = function(it){ return it !== undefined && (Iterators.Array === it || ArrayProto[ITERATOR] === it); }; },{"117":117,"56":56}],47:[function(_dereq_,module,exports){ // 7.2.2 IsArray(argument) var cof = _dereq_(18); module.exports = Array.isArray || function isArray(arg){ return cof(arg) == 'Array'; }; },{"18":18}],48:[function(_dereq_,module,exports){ // 20.1.2.3 Number.isInteger(number) var isObject = _dereq_(49) , floor = Math.floor; module.exports = function isInteger(it){ return !isObject(it) && isFinite(it) && floor(it) === it; }; },{"49":49}],49:[function(_dereq_,module,exports){ module.exports = function(it){ return typeof it === 'object' ? it !== null : typeof it === 'function'; }; },{}],50:[function(_dereq_,module,exports){ // 7.2.8 IsRegExp(argument) var isObject = _dereq_(49) , cof = _dereq_(18) , MATCH = _dereq_(117)('match'); module.exports = function(it){ var isRegExp; return isObject(it) && ((isRegExp = it[MATCH]) !== undefined ? !!isRegExp : cof(it) == 'RegExp'); }; },{"117":117,"18":18,"49":49}],51:[function(_dereq_,module,exports){ // call something on iterator step with safe closing on error var anObject = _dereq_(7); module.exports = function(iterator, fn, value, entries){ try { return entries ? fn(anObject(value)[0], value[1]) : fn(value); // 7.4.6 IteratorClose(iterator, completion) } catch(e){ var ret = iterator['return']; if(ret !== undefined)anObject(ret.call(iterator)); throw e; } }; },{"7":7}],52:[function(_dereq_,module,exports){ 'use strict'; var create = _dereq_(66) , descriptor = _dereq_(85) , setToStringTag = _dereq_(92) , IteratorPrototype = {}; // 25.1.2.1.1 %IteratorPrototype%[@@iterator]() _dereq_(40)(IteratorPrototype, _dereq_(117)('iterator'), function(){ return this; }); module.exports = function(Constructor, NAME, next){ Constructor.prototype = create(IteratorPrototype, {next: descriptor(1, next)}); setToStringTag(Constructor, NAME + ' Iterator'); }; },{"117":117,"40":40,"66":66,"85":85,"92":92}],53:[function(_dereq_,module,exports){ 'use strict'; var LIBRARY = _dereq_(58) , $export = _dereq_(32) , redefine = _dereq_(87) , hide = _dereq_(40) , has = _dereq_(39) , Iterators = _dereq_(56) , $iterCreate = _dereq_(52) , setToStringTag = _dereq_(92) , getPrototypeOf = _dereq_(74) , ITERATOR = _dereq_(117)('iterator') , BUGGY = !([].keys && 'next' in [].keys()) // Safari has buggy iterators w/o `next` , FF_ITERATOR = '@@iterator' , KEYS = 'keys' , VALUES = 'values'; var returnThis = function(){ return this; }; module.exports = function(Base, NAME, Constructor, next, DEFAULT, IS_SET, FORCED){ $iterCreate(Constructor, NAME, next); var getMethod = function(kind){ if(!BUGGY && kind in proto)return proto[kind]; switch(kind){ case KEYS: return function keys(){ return new Constructor(this, kind); }; case VALUES: return function values(){ return new Constructor(this, kind); }; } return function entries(){ return new Constructor(this, kind); }; }; var TAG = NAME + ' Iterator' , DEF_VALUES = DEFAULT == VALUES , VALUES_BUG = false , proto = Base.prototype , $native = proto[ITERATOR] || proto[FF_ITERATOR] || DEFAULT && proto[DEFAULT] , $default = $native || getMethod(DEFAULT) , $entries = DEFAULT ? !DEF_VALUES ? $default : getMethod('entries') : undefined , $anyNative = NAME == 'Array' ? proto.entries || $native : $native , methods, key, IteratorPrototype; // Fix native if($anyNative){ IteratorPrototype = getPrototypeOf($anyNative.call(new Base)); if(IteratorPrototype !== Object.prototype){ // Set @@toStringTag to native iterators setToStringTag(IteratorPrototype, TAG, true); // fix for some old engines if(!LIBRARY && !has(IteratorPrototype, ITERATOR))hide(IteratorPrototype, ITERATOR, returnThis); } } // fix Array#{values, @@iterator}.name in V8 / FF if(DEF_VALUES && $native && $native.name !== VALUES){ VALUES_BUG = true; $default = function values(){ return $native.call(this); }; } // Define iterator if((!LIBRARY || FORCED) && (BUGGY || VALUES_BUG || !proto[ITERATOR])){ hide(proto, ITERATOR, $default); } // Plug for library Iterators[NAME] = $default; Iterators[TAG] = returnThis; if(DEFAULT){ methods = { values: DEF_VALUES ? $default : getMethod(VALUES), keys: IS_SET ? $default : getMethod(KEYS), entries: $entries }; if(FORCED)for(key in methods){ if(!(key in proto))redefine(proto, key, methods[key]); } else $export($export.P + $export.F * (BUGGY || VALUES_BUG), NAME, methods); } return methods; }; },{"117":117,"32":32,"39":39,"40":40,"52":52,"56":56,"58":58,"74":74,"87":87,"92":92}],54:[function(_dereq_,module,exports){ var ITERATOR = _dereq_(117)('iterator') , SAFE_CLOSING = false; try { var riter = [7][ITERATOR](); riter['return'] = function(){ SAFE_CLOSING = true; }; Array.from(riter, function(){ throw 2; }); } catch(e){ /* empty */ } module.exports = function(exec, skipClosing){ if(!skipClosing && !SAFE_CLOSING)return false; var safe = false; try { var arr = [7] , iter = arr[ITERATOR](); iter.next = function(){ return {done: safe = true}; }; arr[ITERATOR] = function(){ return iter; }; exec(arr); } catch(e){ /* empty */ } return safe; }; },{"117":117}],55:[function(_dereq_,module,exports){ module.exports = function(done, value){ return {value: value, done: !!done}; }; },{}],56:[function(_dereq_,module,exports){ module.exports = {}; },{}],57:[function(_dereq_,module,exports){ var getKeys = _dereq_(76) , toIObject = _dereq_(107); module.exports = function(object, el){ var O = toIObject(object) , keys = getKeys(O) , length = keys.length , index = 0 , key; while(length > index)if(O[key = keys[index++]] === el)return key; }; },{"107":107,"76":76}],58:[function(_dereq_,module,exports){ module.exports = false; },{}],59:[function(_dereq_,module,exports){ // 20.2.2.14 Math.expm1(x) var $expm1 = Math.expm1; module.exports = (!$expm1 // Old FF bug || $expm1(10) > 22025.465794806719 || $expm1(10) < 22025.4657948067165168 // Tor Browser bug || $expm1(-2e-17) != -2e-17 ) ? function expm1(x){ return (x = +x) == 0 ? x : x > -1e-6 && x < 1e-6 ? x + x * x / 2 : Math.exp(x) - 1; } : $expm1; },{}],60:[function(_dereq_,module,exports){ // 20.2.2.20 Math.log1p(x) module.exports = Math.log1p || function log1p(x){ return (x = +x) > -1e-8 && x < 1e-8 ? x - x * x / 2 : Math.log(1 + x); }; },{}],61:[function(_dereq_,module,exports){ // 20.2.2.28 Math.sign(x) module.exports = Math.sign || function sign(x){ return (x = +x) == 0 || x != x ? x : x < 0 ? -1 : 1; }; },{}],62:[function(_dereq_,module,exports){ var META = _dereq_(114)('meta') , isObject = _dereq_(49) , has = _dereq_(39) , setDesc = _dereq_(67).f , id = 0; var isExtensible = Object.isExtensible || function(){ return true; }; var FREEZE = !_dereq_(34)(function(){ return isExtensible(Object.preventExtensions({})); }); var setMeta = function(it){ setDesc(it, META, {value: { i: 'O' + ++id, // object ID w: {} // weak collections IDs }}); }; var fastKey = function(it, create){ // return primitive with prefix if(!isObject(it))return typeof it == 'symbol' ? it : (typeof it == 'string' ? 'S' : 'P') + it; if(!has(it, META)){ // can't set metadata to uncaught frozen object if(!isExtensible(it))return 'F'; // not necessary to add metadata if(!create)return 'E'; // add missing metadata setMeta(it); // return object ID } return it[META].i; }; var getWeak = function(it, create){ if(!has(it, META)){ // can't set metadata to uncaught frozen object if(!isExtensible(it))return true; // not necessary to add metadata if(!create)return false; // add missing metadata setMeta(it); // return hash weak collections IDs } return it[META].w; }; // add metadata on freeze-family methods calling var onFreeze = function(it){ if(FREEZE && meta.NEED && isExtensible(it) && !has(it, META))setMeta(it); return it; }; var meta = module.exports = { KEY: META, NEED: false, fastKey: fastKey, getWeak: getWeak, onFreeze: onFreeze }; },{"114":114,"34":34,"39":39,"49":49,"67":67}],63:[function(_dereq_,module,exports){ var Map = _dereq_(149) , $export = _dereq_(32) , shared = _dereq_(94)('metadata') , store = shared.store || (shared.store = new (_dereq_(255))); var getOrCreateMetadataMap = function(target, targetKey, create){ var targetMetadata = store.get(target); if(!targetMetadata){ if(!create)return undefined; store.set(target, targetMetadata = new Map); } var keyMetadata = targetMetadata.get(targetKey); if(!keyMetadata){ if(!create)return undefined; targetMetadata.set(targetKey, keyMetadata = new Map); } return keyMetadata; }; var ordinaryHasOwnMetadata = function(MetadataKey, O, P){ var metadataMap = getOrCreateMetadataMap(O, P, false); return metadataMap === undefined ? false : metadataMap.has(MetadataKey); }; var ordinaryGetOwnMetadata = function(MetadataKey, O, P){ var metadataMap = getOrCreateMetadataMap(O, P, false); return metadataMap === undefined ? undefined : metadataMap.get(MetadataKey); }; var ordinaryDefineOwnMetadata = function(MetadataKey, MetadataValue, O, P){ getOrCreateMetadataMap(O, P, true).set(MetadataKey, MetadataValue); }; var ordinaryOwnMetadataKeys = function(target, targetKey){ var metadataMap = getOrCreateMetadataMap(target, targetKey, false) , keys = []; if(metadataMap)metadataMap.forEach(function(_, key){ keys.push(key); }); return keys; }; var toMetaKey = function(it){ return it === undefined || typeof it == 'symbol' ? it : String(it); }; var exp = function(O){ $export($export.S, 'Reflect', O); }; module.exports = { store: store, map: getOrCreateMetadataMap, has: ordinaryHasOwnMetadata, get: ordinaryGetOwnMetadata, set: ordinaryDefineOwnMetadata, keys: ordinaryOwnMetadataKeys, key: toMetaKey, exp: exp }; },{"149":149,"255":255,"32":32,"94":94}],64:[function(_dereq_,module,exports){ var global = _dereq_(38) , macrotask = _dereq_(104).set , Observer = global.MutationObserver || global.WebKitMutationObserver , process = global.process , Promise = global.Promise , isNode = _dereq_(18)(process) == 'process'; module.exports = function(){ var head, last, notify; var flush = function(){ var parent, fn; if(isNode && (parent = process.domain))parent.exit(); while(head){ fn = head.fn; head = head.next; try { fn(); } catch(e){ if(head)notify(); else last = undefined; throw e; } } last = undefined; if(parent)parent.enter(); }; // Node.js if(isNode){ notify = function(){ process.nextTick(flush); }; // browsers with MutationObserver } else if(Observer){ var toggle = true , node = document.createTextNode(''); new Observer(flush).observe(node, {characterData: true}); // eslint-disable-line no-new notify = function(){ node.data = toggle = !toggle; }; // environments with maybe non-completely correct, but existent Promise } else if(Promise && Promise.resolve){ var promise = Promise.resolve(); notify = function(){ promise.then(flush); }; // for other environments - macrotask based on: // - setImmediate // - MessageChannel // - window.postMessag // - onreadystatechange // - setTimeout } else { notify = function(){ // strange IE + webpack dev server bug - use .call(global) macrotask.call(global, flush); }; } return function(fn){ var task = {fn: fn, next: undefined}; if(last)last.next = task; if(!head){ head = task; notify(); } last = task; }; }; },{"104":104,"18":18,"38":38}],65:[function(_dereq_,module,exports){ 'use strict'; // 19.1.2.1 Object.assign(target, source, ...) var getKeys = _dereq_(76) , gOPS = _dereq_(73) , pIE = _dereq_(77) , toObject = _dereq_(109) , IObject = _dereq_(45) , $assign = Object.assign; // should work with symbols and should have deterministic property order (V8 bug) module.exports = !$assign || _dereq_(34)(function(){ var A = {} , B = {} , S = Symbol() , K = 'abcdefghijklmnopqrst'; A[S] = 7; K.split('').forEach(function(k){ B[k] = k; }); return $assign({}, A)[S] != 7 || Object.keys($assign({}, B)).join('') != K; }) ? function assign(target, source){ // eslint-disable-line no-unused-vars var T = toObject(target) , aLen = arguments.length , index = 1 , getSymbols = gOPS.f , isEnum = pIE.f; while(aLen > index){ var S = IObject(arguments[index++]) , keys = getSymbols ? getKeys(S).concat(getSymbols(S)) : getKeys(S) , length = keys.length , j = 0 , key; while(length > j)if(isEnum.call(S, key = keys[j++]))T[key] = S[key]; } return T; } : $assign; },{"109":109,"34":34,"45":45,"73":73,"76":76,"77":77}],66:[function(_dereq_,module,exports){ // 19.1.2.2 / 15.2.3.5 Object.create(O [, Properties]) var anObject = _dereq_(7) , dPs = _dereq_(68) , enumBugKeys = _dereq_(30) , IE_PROTO = _dereq_(93)('IE_PROTO') , Empty = function(){ /* empty */ } , PROTOTYPE = 'prototype'; // Create object with fake `null` prototype: use iframe Object with cleared prototype var createDict = function(){ // Thrash, waste and sodomy: IE GC bug var iframe = _dereq_(29)('iframe') , i = enumBugKeys.length , lt = '<' , gt = '>' , iframeDocument; iframe.style.display = 'none'; _dereq_(41).appendChild(iframe); iframe.src = 'javascript:'; // eslint-disable-line no-script-url // createDict = iframe.contentWindow.Object; // html.removeChild(iframe); iframeDocument = iframe.contentWindow.document; iframeDocument.open(); iframeDocument.write(lt + 'script' + gt + 'document.F=Object' + lt + '/script' + gt); iframeDocument.close(); createDict = iframeDocument.F; while(i--)delete createDict[PROTOTYPE][enumBugKeys[i]]; return createDict(); }; module.exports = Object.create || function create(O, Properties){ var result; if(O !== null){ Empty[PROTOTYPE] = anObject(O); result = new Empty; Empty[PROTOTYPE] = null; // add "__proto__" for Object.getPrototypeOf polyfill result[IE_PROTO] = O; } else result = createDict(); return Properties === undefined ? result : dPs(result, Properties); }; },{"29":29,"30":30,"41":41,"68":68,"7":7,"93":93}],67:[function(_dereq_,module,exports){ var anObject = _dereq_(7) , IE8_DOM_DEFINE = _dereq_(42) , toPrimitive = _dereq_(110) , dP = Object.defineProperty; exports.f = _dereq_(28) ? Object.defineProperty : function defineProperty(O, P, Attributes){ anObject(O); P = toPrimitive(P, true); anObject(Attributes); if(IE8_DOM_DEFINE)try { return dP(O, P, Attributes); } catch(e){ /* empty */ } if('get' in Attributes || 'set' in Attributes)throw TypeError('Accessors not supported!'); if('value' in Attributes)O[P] = Attributes.value; return O; }; },{"110":110,"28":28,"42":42,"7":7}],68:[function(_dereq_,module,exports){ var dP = _dereq_(67) , anObject = _dereq_(7) , getKeys = _dereq_(76); module.exports = _dereq_(28) ? Object.defineProperties : function defineProperties(O, Properties){ anObject(O); var keys = getKeys(Properties) , length = keys.length , i = 0 , P; while(length > i)dP.f(O, P = keys[i++], Properties[P]); return O; }; },{"28":28,"67":67,"7":7,"76":76}],69:[function(_dereq_,module,exports){ // Forced replacement prototype accessors methods module.exports = _dereq_(58)|| !_dereq_(34)(function(){ var K = Math.random(); // In FF throws only define methods __defineSetter__.call(null, K, function(){ /* empty */}); delete _dereq_(38)[K]; }); },{"34":34,"38":38,"58":58}],70:[function(_dereq_,module,exports){ var pIE = _dereq_(77) , createDesc = _dereq_(85) , toIObject = _dereq_(107) , toPrimitive = _dereq_(110) , has = _dereq_(39) , IE8_DOM_DEFINE = _dereq_(42) , gOPD = Object.getOwnPropertyDescriptor; exports.f = _dereq_(28) ? gOPD : function getOwnPropertyDescriptor(O, P){ O = toIObject(O); P = toPrimitive(P, true); if(IE8_DOM_DEFINE)try { return gOPD(O, P); } catch(e){ /* empty */ } if(has(O, P))return createDesc(!pIE.f.call(O, P), O[P]); }; },{"107":107,"110":110,"28":28,"39":39,"42":42,"77":77,"85":85}],71:[function(_dereq_,module,exports){ // fallback for IE11 buggy Object.getOwnPropertyNames with iframe and window var toIObject = _dereq_(107) , gOPN = _dereq_(72).f , toString = {}.toString; var windowNames = typeof window == 'object' && window && Object.getOwnPropertyNames ? Object.getOwnPropertyNames(window) : []; var getWindowNames = function(it){ try { return gOPN(it); } catch(e){ return windowNames.slice(); } }; module.exports.f = function getOwnPropertyNames(it){ return windowNames && toString.call(it) == '[object Window]' ? getWindowNames(it) : gOPN(toIObject(it)); }; },{"107":107,"72":72}],72:[function(_dereq_,module,exports){ // 19.1.2.7 / 15.2.3.4 Object.getOwnPropertyNames(O) var $keys = _dereq_(75) , hiddenKeys = _dereq_(30).concat('length', 'prototype'); exports.f = Object.getOwnPropertyNames || function getOwnPropertyNames(O){ return $keys(O, hiddenKeys); }; },{"30":30,"75":75}],73:[function(_dereq_,module,exports){ exports.f = Object.getOwnPropertySymbols; },{}],74:[function(_dereq_,module,exports){ // 19.1.2.9 / 15.2.3.2 Object.getPrototypeOf(O) var has = _dereq_(39) , toObject = _dereq_(109) , IE_PROTO = _dereq_(93)('IE_PROTO') , ObjectProto = Object.prototype; module.exports = Object.getPrototypeOf || function(O){ O = toObject(O); if(has(O, IE_PROTO))return O[IE_PROTO]; if(typeof O.constructor == 'function' && O instanceof O.constructor){ return O.constructor.prototype; } return O instanceof Object ? ObjectProto : null; }; },{"109":109,"39":39,"93":93}],75:[function(_dereq_,module,exports){ var has = _dereq_(39) , toIObject = _dereq_(107) , arrayIndexOf = _dereq_(11)(false) , IE_PROTO = _dereq_(93)('IE_PROTO'); module.exports = function(object, names){ var O = toIObject(object) , i = 0 , result = [] , key; for(key in O)if(key != IE_PROTO)has(O, key) && result.push(key); // Don't enum bug & hidden keys while(names.length > i)if(has(O, key = names[i++])){ ~arrayIndexOf(result, key) || result.push(key); } return result; }; },{"107":107,"11":11,"39":39,"93":93}],76:[function(_dereq_,module,exports){ // 19.1.2.14 / 15.2.3.14 Object.keys(O) var $keys = _dereq_(75) , enumBugKeys = _dereq_(30); module.exports = Object.keys || function keys(O){ return $keys(O, enumBugKeys); }; },{"30":30,"75":75}],77:[function(_dereq_,module,exports){ exports.f = {}.propertyIsEnumerable; },{}],78:[function(_dereq_,module,exports){ // most Object methods by ES6 should accept primitives var $export = _dereq_(32) , core = _dereq_(23) , fails = _dereq_(34); module.exports = function(KEY, exec){ var fn = (core.Object || {})[KEY] || Object[KEY] , exp = {}; exp[KEY] = exec(fn); $export($export.S + $export.F * fails(function(){ fn(1); }), 'Object', exp); }; },{"23":23,"32":32,"34":34}],79:[function(_dereq_,module,exports){ var getKeys = _dereq_(76) , toIObject = _dereq_(107) , isEnum = _dereq_(77).f; module.exports = function(isEntries){ return function(it){ var O = toIObject(it) , keys = getKeys(O) , length = keys.length , i = 0 , result = [] , key; while(length > i)if(isEnum.call(O, key = keys[i++])){ result.push(isEntries ? [key, O[key]] : O[key]); } return result; }; }; },{"107":107,"76":76,"77":77}],80:[function(_dereq_,module,exports){ // all object keys, includes non-enumerable and symbols var gOPN = _dereq_(72) , gOPS = _dereq_(73) , anObject = _dereq_(7) , Reflect = _dereq_(38).Reflect; module.exports = Reflect && Reflect.ownKeys || function ownKeys(it){ var keys = gOPN.f(anObject(it)) , getSymbols = gOPS.f; return getSymbols ? keys.concat(getSymbols(it)) : keys; }; },{"38":38,"7":7,"72":72,"73":73}],81:[function(_dereq_,module,exports){ var $parseFloat = _dereq_(38).parseFloat , $trim = _dereq_(102).trim; module.exports = 1 / $parseFloat(_dereq_(103) + '-0') !== -Infinity ? function parseFloat(str){ var string = $trim(String(str), 3) , result = $parseFloat(string); return result === 0 && string.charAt(0) == '-' ? -0 : result; } : $parseFloat; },{"102":102,"103":103,"38":38}],82:[function(_dereq_,module,exports){ var $parseInt = _dereq_(38).parseInt , $trim = _dereq_(102).trim , ws = _dereq_(103) , hex = /^[\-+]?0[xX]/; module.exports = $parseInt(ws + '08') !== 8 || $parseInt(ws + '0x16') !== 22 ? function parseInt(str, radix){ var string = $trim(String(str), 3); return $parseInt(string, (radix >>> 0) || (hex.test(string) ? 16 : 10)); } : $parseInt; },{"102":102,"103":103,"38":38}],83:[function(_dereq_,module,exports){ 'use strict'; var path = _dereq_(84) , invoke = _dereq_(44) , aFunction = _dereq_(3); module.exports = function(/* ...pargs */){ var fn = aFunction(this) , length = arguments.length , pargs = Array(length) , i = 0 , _ = path._ , holder = false; while(length > i)if((pargs[i] = arguments[i++]) === _)holder = true; return function(/* ...args */){ var that = this , aLen = arguments.length , j = 0, k = 0, args; if(!holder && !aLen)return invoke(fn, pargs, that); args = pargs.slice(); if(holder)for(;length > j; j++)if(args[j] === _)args[j] = arguments[k++]; while(aLen > k)args.push(arguments[k++]); return invoke(fn, args, that); }; }; },{"3":3,"44":44,"84":84}],84:[function(_dereq_,module,exports){ module.exports = _dereq_(38); },{"38":38}],85:[function(_dereq_,module,exports){ module.exports = function(bitmap, value){ return { enumerable : !(bitmap & 1), configurable: !(bitmap & 2), writable : !(bitmap & 4), value : value }; }; },{}],86:[function(_dereq_,module,exports){ var redefine = _dereq_(87); module.exports = function(target, src, safe){ for(var key in src)redefine(target, key, src[key], safe); return target; }; },{"87":87}],87:[function(_dereq_,module,exports){ var global = _dereq_(38) , hide = _dereq_(40) , has = _dereq_(39) , SRC = _dereq_(114)('src') , TO_STRING = 'toString' , $toString = Function[TO_STRING] , TPL = ('' + $toString).split(TO_STRING); _dereq_(23).inspectSource = function(it){ return $toString.call(it); }; (module.exports = function(O, key, val, safe){ var isFunction = typeof val == 'function'; if(isFunction)has(val, 'name') || hide(val, 'name', key); if(O[key] === val)return; if(isFunction)has(val, SRC) || hide(val, SRC, O[key] ? '' + O[key] : TPL.join(String(key))); if(O === global){ O[key] = val; } else { if(!safe){ delete O[key]; hide(O, key, val); } else { if(O[key])O[key] = val; else hide(O, key, val); } } // add fake Function#toString for correct work wrapped methods / constructors with methods like LoDash isNative })(Function.prototype, TO_STRING, function toString(){ return typeof this == 'function' && this[SRC] || $toString.call(this); }); },{"114":114,"23":23,"38":38,"39":39,"40":40}],88:[function(_dereq_,module,exports){ module.exports = function(regExp, replace){ var replacer = replace === Object(replace) ? function(part){ return replace[part]; } : replace; return function(it){ return String(it).replace(regExp, replacer); }; }; },{}],89:[function(_dereq_,module,exports){ // 7.2.9 SameValue(x, y) module.exports = Object.is || function is(x, y){ return x === y ? x !== 0 || 1 / x === 1 / y : x != x && y != y; }; },{}],90:[function(_dereq_,module,exports){ // Works with __proto__ only. Old v8 can't work with null proto objects. /* eslint-disable no-proto */ var isObject = _dereq_(49) , anObject = _dereq_(7); var check = function(O, proto){ anObject(O); if(!isObject(proto) && proto !== null)throw TypeError(proto + ": can't set as prototype!"); }; module.exports = { set: Object.setPrototypeOf || ('__proto__' in {} ? // eslint-disable-line function(test, buggy, set){ try { set = _dereq_(25)(Function.call, _dereq_(70).f(Object.prototype, '__proto__').set, 2); set(test, []); buggy = !(test instanceof Array); } catch(e){ buggy = true; } return function setPrototypeOf(O, proto){ check(O, proto); if(buggy)O.__proto__ = proto; else set(O, proto); return O; }; }({}, false) : undefined), check: check }; },{"25":25,"49":49,"7":7,"70":70}],91:[function(_dereq_,module,exports){ 'use strict'; var global = _dereq_(38) , dP = _dereq_(67) , DESCRIPTORS = _dereq_(28) , SPECIES = _dereq_(117)('species'); module.exports = function(KEY){ var C = global[KEY]; if(DESCRIPTORS && C && !C[SPECIES])dP.f(C, SPECIES, { configurable: true, get: function(){ return this; } }); }; },{"117":117,"28":28,"38":38,"67":67}],92:[function(_dereq_,module,exports){ var def = _dereq_(67).f , has = _dereq_(39) , TAG = _dereq_(117)('toStringTag'); module.exports = function(it, tag, stat){ if(it && !has(it = stat ? it : it.prototype, TAG))def(it, TAG, {configurable: true, value: tag}); }; },{"117":117,"39":39,"67":67}],93:[function(_dereq_,module,exports){ var shared = _dereq_(94)('keys') , uid = _dereq_(114); module.exports = function(key){ return shared[key] || (shared[key] = uid(key)); }; },{"114":114,"94":94}],94:[function(_dereq_,module,exports){ var global = _dereq_(38) , SHARED = '__core-js_shared__' , store = global[SHARED] || (global[SHARED] = {}); module.exports = function(key){ return store[key] || (store[key] = {}); }; },{"38":38}],95:[function(_dereq_,module,exports){ // 7.3.20 SpeciesConstructor(O, defaultConstructor) var anObject = _dereq_(7) , aFunction = _dereq_(3) , SPECIES = _dereq_(117)('species'); module.exports = function(O, D){ var C = anObject(O).constructor, S; return C === undefined || (S = anObject(C)[SPECIES]) == undefined ? D : aFunction(S); }; },{"117":117,"3":3,"7":7}],96:[function(_dereq_,module,exports){ var fails = _dereq_(34); module.exports = function(method, arg){ return !!method && fails(function(){ arg ? method.call(null, function(){}, 1) : method.call(null); }); }; },{"34":34}],97:[function(_dereq_,module,exports){ var toInteger = _dereq_(106) , defined = _dereq_(27); // true -> String#at // false -> String#codePointAt module.exports = function(TO_STRING){ return function(that, pos){ var s = String(defined(that)) , i = toInteger(pos) , l = s.length , a, b; if(i < 0 || i >= l)return TO_STRING ? '' : undefined; a = s.charCodeAt(i); return a < 0xd800 || a > 0xdbff || i + 1 === l || (b = s.charCodeAt(i + 1)) < 0xdc00 || b > 0xdfff ? TO_STRING ? s.charAt(i) : a : TO_STRING ? s.slice(i, i + 2) : (a - 0xd800 << 10) + (b - 0xdc00) + 0x10000; }; }; },{"106":106,"27":27}],98:[function(_dereq_,module,exports){ // helper for String#{startsWith, endsWith, includes} var isRegExp = _dereq_(50) , defined = _dereq_(27); module.exports = function(that, searchString, NAME){ if(isRegExp(searchString))throw TypeError('String#' + NAME + " doesn't accept regex!"); return String(defined(that)); }; },{"27":27,"50":50}],99:[function(_dereq_,module,exports){ var $export = _dereq_(32) , fails = _dereq_(34) , defined = _dereq_(27) , quot = /"/g; // B.2.3.2.1 CreateHTML(string, tag, attribute, value) var createHTML = function(string, tag, attribute, value) { var S = String(defined(string)) , p1 = '<' + tag; if(attribute !== '')p1 += ' ' + attribute + '="' + String(value).replace(quot, '"') + '"'; return p1 + '>' + S + ''; }; module.exports = function(NAME, exec){ var O = {}; O[NAME] = exec(createHTML); $export($export.P + $export.F * fails(function(){ var test = ''[NAME]('"'); return test !== test.toLowerCase() || test.split('"').length > 3; }), 'String', O); }; },{"27":27,"32":32,"34":34}],100:[function(_dereq_,module,exports){ // https://github.com/tc39/proposal-string-pad-start-end var toLength = _dereq_(108) , repeat = _dereq_(101) , defined = _dereq_(27); module.exports = function(that, maxLength, fillString, left){ var S = String(defined(that)) , stringLength = S.length , fillStr = fillString === undefined ? ' ' : String(fillString) , intMaxLength = toLength(maxLength); if(intMaxLength <= stringLength || fillStr == '')return S; var fillLen = intMaxLength - stringLength , stringFiller = repeat.call(fillStr, Math.ceil(fillLen / fillStr.length)); if(stringFiller.length > fillLen)stringFiller = stringFiller.slice(0, fillLen); return left ? stringFiller + S : S + stringFiller; }; },{"101":101,"108":108,"27":27}],101:[function(_dereq_,module,exports){ 'use strict'; var toInteger = _dereq_(106) , defined = _dereq_(27); module.exports = function repeat(count){ var str = String(defined(this)) , res = '' , n = toInteger(count); if(n < 0 || n == Infinity)throw RangeError("Count can't be negative"); for(;n > 0; (n >>>= 1) && (str += str))if(n & 1)res += str; return res; }; },{"106":106,"27":27}],102:[function(_dereq_,module,exports){ var $export = _dereq_(32) , defined = _dereq_(27) , fails = _dereq_(34) , spaces = _dereq_(103) , space = '[' + spaces + ']' , non = '\u200b\u0085' , ltrim = RegExp('^' + space + space + '*') , rtrim = RegExp(space + space + '*$'); var exporter = function(KEY, exec, ALIAS){ var exp = {}; var FORCE = fails(function(){ return !!spaces[KEY]() || non[KEY]() != non; }); var fn = exp[KEY] = FORCE ? exec(trim) : spaces[KEY]; if(ALIAS)exp[ALIAS] = fn; $export($export.P + $export.F * FORCE, 'String', exp); }; // 1 -> String#trimLeft // 2 -> String#trimRight // 3 -> String#trim var trim = exporter.trim = function(string, TYPE){ string = String(defined(string)); if(TYPE & 1)string = string.replace(ltrim, ''); if(TYPE & 2)string = string.replace(rtrim, ''); return string; }; module.exports = exporter; },{"103":103,"27":27,"32":32,"34":34}],103:[function(_dereq_,module,exports){ module.exports = '\x09\x0A\x0B\x0C\x0D\x20\xA0\u1680\u180E\u2000\u2001\u2002\u2003' + '\u2004\u2005\u2006\u2007\u2008\u2009\u200A\u202F\u205F\u3000\u2028\u2029\uFEFF'; },{}],104:[function(_dereq_,module,exports){ var ctx = _dereq_(25) , invoke = _dereq_(44) , html = _dereq_(41) , cel = _dereq_(29) , global = _dereq_(38) , process = global.process , setTask = global.setImmediate , clearTask = global.clearImmediate , MessageChannel = global.MessageChannel , counter = 0 , queue = {} , ONREADYSTATECHANGE = 'onreadystatechange' , defer, channel, port; var run = function(){ var id = +this; if(queue.hasOwnProperty(id)){ var fn = queue[id]; delete queue[id]; fn(); } }; var listener = function(event){ run.call(event.data); }; // Node.js 0.9+ & IE10+ has setImmediate, otherwise: if(!setTask || !clearTask){ setTask = function setImmediate(fn){ var args = [], i = 1; while(arguments.length > i)args.push(arguments[i++]); queue[++counter] = function(){ invoke(typeof fn == 'function' ? fn : Function(fn), args); }; defer(counter); return counter; }; clearTask = function clearImmediate(id){ delete queue[id]; }; // Node.js 0.8- if(_dereq_(18)(process) == 'process'){ defer = function(id){ process.nextTick(ctx(run, id, 1)); }; // Browsers with MessageChannel, includes WebWorkers } else if(MessageChannel){ channel = new MessageChannel; port = channel.port2; channel.port1.onmessage = listener; defer = ctx(port.postMessage, port, 1); // Browsers with postMessage, skip WebWorkers // IE8 has postMessage, but it's sync & typeof its postMessage is 'object' } else if(global.addEventListener && typeof postMessage == 'function' && !global.importScripts){ defer = function(id){ global.postMessage(id + '', '*'); }; global.addEventListener('message', listener, false); // IE8- } else if(ONREADYSTATECHANGE in cel('script')){ defer = function(id){ html.appendChild(cel('script'))[ONREADYSTATECHANGE] = function(){ html.removeChild(this); run.call(id); }; }; // Rest old browsers } else { defer = function(id){ setTimeout(ctx(run, id, 1), 0); }; } } module.exports = { set: setTask, clear: clearTask }; },{"18":18,"25":25,"29":29,"38":38,"41":41,"44":44}],105:[function(_dereq_,module,exports){ var toInteger = _dereq_(106) , max = Math.max , min = Math.min; module.exports = function(index, length){ index = toInteger(index); return index < 0 ? max(index + length, 0) : min(index, length); }; },{"106":106}],106:[function(_dereq_,module,exports){ // 7.1.4 ToInteger var ceil = Math.ceil , floor = Math.floor; module.exports = function(it){ return isNaN(it = +it) ? 0 : (it > 0 ? floor : ceil)(it); }; },{}],107:[function(_dereq_,module,exports){ // to indexed object, toObject with fallback for non-array-like ES3 strings var IObject = _dereq_(45) , defined = _dereq_(27); module.exports = function(it){ return IObject(defined(it)); }; },{"27":27,"45":45}],108:[function(_dereq_,module,exports){ // 7.1.15 ToLength var toInteger = _dereq_(106) , min = Math.min; module.exports = function(it){ return it > 0 ? min(toInteger(it), 0x1fffffffffffff) : 0; // pow(2, 53) - 1 == 9007199254740991 }; },{"106":106}],109:[function(_dereq_,module,exports){ // 7.1.13 ToObject(argument) var defined = _dereq_(27); module.exports = function(it){ return Object(defined(it)); }; },{"27":27}],110:[function(_dereq_,module,exports){ // 7.1.1 ToPrimitive(input [, PreferredType]) var isObject = _dereq_(49); // instead of the ES6 spec version, we didn't implement @@toPrimitive case // and the second argument - flag - preferred type is a string module.exports = function(it, S){ if(!isObject(it))return it; var fn, val; if(S && typeof (fn = it.toString) == 'function' && !isObject(val = fn.call(it)))return val; if(typeof (fn = it.valueOf) == 'function' && !isObject(val = fn.call(it)))return val; if(!S && typeof (fn = it.toString) == 'function' && !isObject(val = fn.call(it)))return val; throw TypeError("Can't convert object to primitive value"); }; },{"49":49}],111:[function(_dereq_,module,exports){ 'use strict'; if(_dereq_(28)){ var LIBRARY = _dereq_(58) , global = _dereq_(38) , fails = _dereq_(34) , $export = _dereq_(32) , $typed = _dereq_(113) , $buffer = _dereq_(112) , ctx = _dereq_(25) , anInstance = _dereq_(6) , propertyDesc = _dereq_(85) , hide = _dereq_(40) , redefineAll = _dereq_(86) , toInteger = _dereq_(106) , toLength = _dereq_(108) , toIndex = _dereq_(105) , toPrimitive = _dereq_(110) , has = _dereq_(39) , same = _dereq_(89) , classof = _dereq_(17) , isObject = _dereq_(49) , toObject = _dereq_(109) , isArrayIter = _dereq_(46) , create = _dereq_(66) , getPrototypeOf = _dereq_(74) , gOPN = _dereq_(72).f , getIterFn = _dereq_(118) , uid = _dereq_(114) , wks = _dereq_(117) , createArrayMethod = _dereq_(12) , createArrayIncludes = _dereq_(11) , speciesConstructor = _dereq_(95) , ArrayIterators = _dereq_(130) , Iterators = _dereq_(56) , $iterDetect = _dereq_(54) , setSpecies = _dereq_(91) , arrayFill = _dereq_(9) , arrayCopyWithin = _dereq_(8) , $DP = _dereq_(67) , $GOPD = _dereq_(70) , dP = $DP.f , gOPD = $GOPD.f , RangeError = global.RangeError , TypeError = global.TypeError , Uint8Array = global.Uint8Array , ARRAY_BUFFER = 'ArrayBuffer' , SHARED_BUFFER = 'Shared' + ARRAY_BUFFER , BYTES_PER_ELEMENT = 'BYTES_PER_ELEMENT' , PROTOTYPE = 'prototype' , ArrayProto = Array[PROTOTYPE] , $ArrayBuffer = $buffer.ArrayBuffer , $DataView = $buffer.DataView , arrayForEach = createArrayMethod(0) , arrayFilter = createArrayMethod(2) , arraySome = createArrayMethod(3) , arrayEvery = createArrayMethod(4) , arrayFind = createArrayMethod(5) , arrayFindIndex = createArrayMethod(6) , arrayIncludes = createArrayIncludes(true) , arrayIndexOf = createArrayIncludes(false) , arrayValues = ArrayIterators.values , arrayKeys = ArrayIterators.keys , arrayEntries = ArrayIterators.entries , arrayLastIndexOf = ArrayProto.lastIndexOf , arrayReduce = ArrayProto.reduce , arrayReduceRight = ArrayProto.reduceRight , arrayJoin = ArrayProto.join , arraySort = ArrayProto.sort , arraySlice = ArrayProto.slice , arrayToString = ArrayProto.toString , arrayToLocaleString = ArrayProto.toLocaleString , ITERATOR = wks('iterator') , TAG = wks('toStringTag') , TYPED_CONSTRUCTOR = uid('typed_constructor') , DEF_CONSTRUCTOR = uid('def_constructor') , ALL_CONSTRUCTORS = $typed.CONSTR , TYPED_ARRAY = $typed.TYPED , VIEW = $typed.VIEW , WRONG_LENGTH = 'Wrong length!'; var $map = createArrayMethod(1, function(O, length){ return allocate(speciesConstructor(O, O[DEF_CONSTRUCTOR]), length); }); var LITTLE_ENDIAN = fails(function(){ return new Uint8Array(new Uint16Array([1]).buffer)[0] === 1; }); var FORCED_SET = !!Uint8Array && !!Uint8Array[PROTOTYPE].set && fails(function(){ new Uint8Array(1).set({}); }); var strictToLength = function(it, SAME){ if(it === undefined)throw TypeError(WRONG_LENGTH); var number = +it , length = toLength(it); if(SAME && !same(number, length))throw RangeError(WRONG_LENGTH); return length; }; var toOffset = function(it, BYTES){ var offset = toInteger(it); if(offset < 0 || offset % BYTES)throw RangeError('Wrong offset!'); return offset; }; var validate = function(it){ if(isObject(it) && TYPED_ARRAY in it)return it; throw TypeError(it + ' is not a typed array!'); }; var allocate = function(C, length){ if(!(isObject(C) && TYPED_CONSTRUCTOR in C)){ throw TypeError('It is not a typed array constructor!'); } return new C(length); }; var speciesFromList = function(O, list){ return fromList(speciesConstructor(O, O[DEF_CONSTRUCTOR]), list); }; var fromList = function(C, list){ var index = 0 , length = list.length , result = allocate(C, length); while(length > index)result[index] = list[index++]; return result; }; var addGetter = function(it, key, internal){ dP(it, key, {get: function(){ return this._d[internal]; }}); }; var $from = function from(source /*, mapfn, thisArg */){ var O = toObject(source) , aLen = arguments.length , mapfn = aLen > 1 ? arguments[1] : undefined , mapping = mapfn !== undefined , iterFn = getIterFn(O) , i, length, values, result, step, iterator; if(iterFn != undefined && !isArrayIter(iterFn)){ for(iterator = iterFn.call(O), values = [], i = 0; !(step = iterator.next()).done; i++){ values.push(step.value); } O = values; } if(mapping && aLen > 2)mapfn = ctx(mapfn, arguments[2], 2); for(i = 0, length = toLength(O.length), result = allocate(this, length); length > i; i++){ result[i] = mapping ? mapfn(O[i], i) : O[i]; } return result; }; var $of = function of(/*...items*/){ var index = 0 , length = arguments.length , result = allocate(this, length); while(length > index)result[index] = arguments[index++]; return result; }; // iOS Safari 6.x fails here var TO_LOCALE_BUG = !!Uint8Array && fails(function(){ arrayToLocaleString.call(new Uint8Array(1)); }); var $toLocaleString = function toLocaleString(){ return arrayToLocaleString.apply(TO_LOCALE_BUG ? arraySlice.call(validate(this)) : validate(this), arguments); }; var proto = { copyWithin: function copyWithin(target, start /*, end */){ return arrayCopyWithin.call(validate(this), target, start, arguments.length > 2 ? arguments[2] : undefined); }, every: function every(callbackfn /*, thisArg */){ return arrayEvery(validate(this), callbackfn, arguments.length > 1 ? arguments[1] : undefined); }, fill: function fill(value /*, start, end */){ // eslint-disable-line no-unused-vars return arrayFill.apply(validate(this), arguments); }, filter: function filter(callbackfn /*, thisArg */){ return speciesFromList(this, arrayFilter(validate(this), callbackfn, arguments.length > 1 ? arguments[1] : undefined)); }, find: function find(predicate /*, thisArg */){ return arrayFind(validate(this), predicate, arguments.length > 1 ? arguments[1] : undefined); }, findIndex: function findIndex(predicate /*, thisArg */){ return arrayFindIndex(validate(this), predicate, arguments.length > 1 ? arguments[1] : undefined); }, forEach: function forEach(callbackfn /*, thisArg */){ arrayForEach(validate(this), callbackfn, arguments.length > 1 ? arguments[1] : undefined); }, indexOf: function indexOf(searchElement /*, fromIndex */){ return arrayIndexOf(validate(this), searchElement, arguments.length > 1 ? arguments[1] : undefined); }, includes: function includes(searchElement /*, fromIndex */){ return arrayIncludes(validate(this), searchElement, arguments.length > 1 ? arguments[1] : undefined); }, join: function join(separator){ // eslint-disable-line no-unused-vars return arrayJoin.apply(validate(this), arguments); }, lastIndexOf: function lastIndexOf(searchElement /*, fromIndex */){ // eslint-disable-line no-unused-vars return arrayLastIndexOf.apply(validate(this), arguments); }, map: function map(mapfn /*, thisArg */){ return $map(validate(this), mapfn, arguments.length > 1 ? arguments[1] : undefined); }, reduce: function reduce(callbackfn /*, initialValue */){ // eslint-disable-line no-unused-vars return arrayReduce.apply(validate(this), arguments); }, reduceRight: function reduceRight(callbackfn /*, initialValue */){ // eslint-disable-line no-unused-vars return arrayReduceRight.apply(validate(this), arguments); }, reverse: function reverse(){ var that = this , length = validate(that).length , middle = Math.floor(length / 2) , index = 0 , value; while(index < middle){ value = that[index]; that[index++] = that[--length]; that[length] = value; } return that; }, some: function some(callbackfn /*, thisArg */){ return arraySome(validate(this), callbackfn, arguments.length > 1 ? arguments[1] : undefined); }, sort: function sort(comparefn){ return arraySort.call(validate(this), comparefn); }, subarray: function subarray(begin, end){ var O = validate(this) , length = O.length , $begin = toIndex(begin, length); return new (speciesConstructor(O, O[DEF_CONSTRUCTOR]))( O.buffer, O.byteOffset + $begin * O.BYTES_PER_ELEMENT, toLength((end === undefined ? length : toIndex(end, length)) - $begin) ); } }; var $slice = function slice(start, end){ return speciesFromList(this, arraySlice.call(validate(this), start, end)); }; var $set = function set(arrayLike /*, offset */){ validate(this); var offset = toOffset(arguments[1], 1) , length = this.length , src = toObject(arrayLike) , len = toLength(src.length) , index = 0; if(len + offset > length)throw RangeError(WRONG_LENGTH); while(index < len)this[offset + index] = src[index++]; }; var $iterators = { entries: function entries(){ return arrayEntries.call(validate(this)); }, keys: function keys(){ return arrayKeys.call(validate(this)); }, values: function values(){ return arrayValues.call(validate(this)); } }; var isTAIndex = function(target, key){ return isObject(target) && target[TYPED_ARRAY] && typeof key != 'symbol' && key in target && String(+key) == String(key); }; var $getDesc = function getOwnPropertyDescriptor(target, key){ return isTAIndex(target, key = toPrimitive(key, true)) ? propertyDesc(2, target[key]) : gOPD(target, key); }; var $setDesc = function defineProperty(target, key, desc){ if(isTAIndex(target, key = toPrimitive(key, true)) && isObject(desc) && has(desc, 'value') && !has(desc, 'get') && !has(desc, 'set') // TODO: add validation descriptor w/o calling accessors && !desc.configurable && (!has(desc, 'writable') || desc.writable) && (!has(desc, 'enumerable') || desc.enumerable) ){ target[key] = desc.value; return target; } else return dP(target, key, desc); }; if(!ALL_CONSTRUCTORS){ $GOPD.f = $getDesc; $DP.f = $setDesc; } $export($export.S + $export.F * !ALL_CONSTRUCTORS, 'Object', { getOwnPropertyDescriptor: $getDesc, defineProperty: $setDesc }); if(fails(function(){ arrayToString.call({}); })){ arrayToString = arrayToLocaleString = function toString(){ return arrayJoin.call(this); } } var $TypedArrayPrototype$ = redefineAll({}, proto); redefineAll($TypedArrayPrototype$, $iterators); hide($TypedArrayPrototype$, ITERATOR, $iterators.values); redefineAll($TypedArrayPrototype$, { slice: $slice, set: $set, constructor: function(){ /* noop */ }, toString: arrayToString, toLocaleString: $toLocaleString }); addGetter($TypedArrayPrototype$, 'buffer', 'b'); addGetter($TypedArrayPrototype$, 'byteOffset', 'o'); addGetter($TypedArrayPrototype$, 'byteLength', 'l'); addGetter($TypedArrayPrototype$, 'length', 'e'); dP($TypedArrayPrototype$, TAG, { get: function(){ return this[TYPED_ARRAY]; } }); module.exports = function(KEY, BYTES, wrapper, CLAMPED){ CLAMPED = !!CLAMPED; var NAME = KEY + (CLAMPED ? 'Clamped' : '') + 'Array' , ISNT_UINT8 = NAME != 'Uint8Array' , GETTER = 'get' + KEY , SETTER = 'set' + KEY , TypedArray = global[NAME] , Base = TypedArray || {} , TAC = TypedArray && getPrototypeOf(TypedArray) , FORCED = !TypedArray || !$typed.ABV , O = {} , TypedArrayPrototype = TypedArray && TypedArray[PROTOTYPE]; var getter = function(that, index){ var data = that._d; return data.v[GETTER](index * BYTES + data.o, LITTLE_ENDIAN); }; var setter = function(that, index, value){ var data = that._d; if(CLAMPED)value = (value = Math.round(value)) < 0 ? 0 : value > 0xff ? 0xff : value & 0xff; data.v[SETTER](index * BYTES + data.o, value, LITTLE_ENDIAN); }; var addElement = function(that, index){ dP(that, index, { get: function(){ return getter(this, index); }, set: function(value){ return setter(this, index, value); }, enumerable: true }); }; if(FORCED){ TypedArray = wrapper(function(that, data, $offset, $length){ anInstance(that, TypedArray, NAME, '_d'); var index = 0 , offset = 0 , buffer, byteLength, length, klass; if(!isObject(data)){ length = strictToLength(data, true) byteLength = length * BYTES; buffer = new $ArrayBuffer(byteLength); } else if(data instanceof $ArrayBuffer || (klass = classof(data)) == ARRAY_BUFFER || klass == SHARED_BUFFER){ buffer = data; offset = toOffset($offset, BYTES); var $len = data.byteLength; if($length === undefined){ if($len % BYTES)throw RangeError(WRONG_LENGTH); byteLength = $len - offset; if(byteLength < 0)throw RangeError(WRONG_LENGTH); } else { byteLength = toLength($length) * BYTES; if(byteLength + offset > $len)throw RangeError(WRONG_LENGTH); } length = byteLength / BYTES; } else if(TYPED_ARRAY in data){ return fromList(TypedArray, data); } else { return $from.call(TypedArray, data); } hide(that, '_d', { b: buffer, o: offset, l: byteLength, e: length, v: new $DataView(buffer) }); while(index < length)addElement(that, index++); }); TypedArrayPrototype = TypedArray[PROTOTYPE] = create($TypedArrayPrototype$); hide(TypedArrayPrototype, 'constructor', TypedArray); } else if(!$iterDetect(function(iter){ // V8 works with iterators, but fails in many other cases // https://code.google.com/p/v8/issues/detail?id=4552 new TypedArray(null); // eslint-disable-line no-new new TypedArray(iter); // eslint-disable-line no-new }, true)){ TypedArray = wrapper(function(that, data, $offset, $length){ anInstance(that, TypedArray, NAME); var klass; // `ws` module bug, temporarily remove validation length for Uint8Array // https://github.com/websockets/ws/pull/645 if(!isObject(data))return new Base(strictToLength(data, ISNT_UINT8)); if(data instanceof $ArrayBuffer || (klass = classof(data)) == ARRAY_BUFFER || klass == SHARED_BUFFER){ return $length !== undefined ? new Base(data, toOffset($offset, BYTES), $length) : $offset !== undefined ? new Base(data, toOffset($offset, BYTES)) : new Base(data); } if(TYPED_ARRAY in data)return fromList(TypedArray, data); return $from.call(TypedArray, data); }); arrayForEach(TAC !== Function.prototype ? gOPN(Base).concat(gOPN(TAC)) : gOPN(Base), function(key){ if(!(key in TypedArray))hide(TypedArray, key, Base[key]); }); TypedArray[PROTOTYPE] = TypedArrayPrototype; if(!LIBRARY)TypedArrayPrototype.constructor = TypedArray; } var $nativeIterator = TypedArrayPrototype[ITERATOR] , CORRECT_ITER_NAME = !!$nativeIterator && ($nativeIterator.name == 'values' || $nativeIterator.name == undefined) , $iterator = $iterators.values; hide(TypedArray, TYPED_CONSTRUCTOR, true); hide(TypedArrayPrototype, TYPED_ARRAY, NAME); hide(TypedArrayPrototype, VIEW, true); hide(TypedArrayPrototype, DEF_CONSTRUCTOR, TypedArray); if(CLAMPED ? new TypedArray(1)[TAG] != NAME : !(TAG in TypedArrayPrototype)){ dP(TypedArrayPrototype, TAG, { get: function(){ return NAME; } }); } O[NAME] = TypedArray; $export($export.G + $export.W + $export.F * (TypedArray != Base), O); $export($export.S, NAME, { BYTES_PER_ELEMENT: BYTES, from: $from, of: $of }); if(!(BYTES_PER_ELEMENT in TypedArrayPrototype))hide(TypedArrayPrototype, BYTES_PER_ELEMENT, BYTES); $export($export.P, NAME, proto); setSpecies(NAME); $export($export.P + $export.F * FORCED_SET, NAME, {set: $set}); $export($export.P + $export.F * !CORRECT_ITER_NAME, NAME, $iterators); $export($export.P + $export.F * (TypedArrayPrototype.toString != arrayToString), NAME, {toString: arrayToString}); $export($export.P + $export.F * fails(function(){ new TypedArray(1).slice(); }), NAME, {slice: $slice}); $export($export.P + $export.F * (fails(function(){ return [1, 2].toLocaleString() != new TypedArray([1, 2]).toLocaleString() }) || !fails(function(){ TypedArrayPrototype.toLocaleString.call([1, 2]); })), NAME, {toLocaleString: $toLocaleString}); Iterators[NAME] = CORRECT_ITER_NAME ? $nativeIterator : $iterator; if(!LIBRARY && !CORRECT_ITER_NAME)hide(TypedArrayPrototype, ITERATOR, $iterator); }; } else module.exports = function(){ /* empty */ }; },{"105":105,"106":106,"108":108,"109":109,"11":11,"110":110,"112":112,"113":113,"114":114,"117":117,"118":118,"12":12,"130":130,"17":17,"25":25,"28":28,"32":32,"34":34,"38":38,"39":39,"40":40,"46":46,"49":49,"54":54,"56":56,"58":58,"6":6,"66":66,"67":67,"70":70,"72":72,"74":74,"8":8,"85":85,"86":86,"89":89,"9":9,"91":91,"95":95}],112:[function(_dereq_,module,exports){ 'use strict'; var global = _dereq_(38) , DESCRIPTORS = _dereq_(28) , LIBRARY = _dereq_(58) , $typed = _dereq_(113) , hide = _dereq_(40) , redefineAll = _dereq_(86) , fails = _dereq_(34) , anInstance = _dereq_(6) , toInteger = _dereq_(106) , toLength = _dereq_(108) , gOPN = _dereq_(72).f , dP = _dereq_(67).f , arrayFill = _dereq_(9) , setToStringTag = _dereq_(92) , ARRAY_BUFFER = 'ArrayBuffer' , DATA_VIEW = 'DataView' , PROTOTYPE = 'prototype' , WRONG_LENGTH = 'Wrong length!' , WRONG_INDEX = 'Wrong index!' , $ArrayBuffer = global[ARRAY_BUFFER] , $DataView = global[DATA_VIEW] , Math = global.Math , RangeError = global.RangeError , Infinity = global.Infinity , BaseBuffer = $ArrayBuffer , abs = Math.abs , pow = Math.pow , floor = Math.floor , log = Math.log , LN2 = Math.LN2 , BUFFER = 'buffer' , BYTE_LENGTH = 'byteLength' , BYTE_OFFSET = 'byteOffset' , $BUFFER = DESCRIPTORS ? '_b' : BUFFER , $LENGTH = DESCRIPTORS ? '_l' : BYTE_LENGTH , $OFFSET = DESCRIPTORS ? '_o' : BYTE_OFFSET; // IEEE754 conversions based on https://github.com/feross/ieee754 var packIEEE754 = function(value, mLen, nBytes){ var buffer = Array(nBytes) , eLen = nBytes * 8 - mLen - 1 , eMax = (1 << eLen) - 1 , eBias = eMax >> 1 , rt = mLen === 23 ? pow(2, -24) - pow(2, -77) : 0 , i = 0 , s = value < 0 || value === 0 && 1 / value < 0 ? 1 : 0 , e, m, c; value = abs(value) if(value != value || value === Infinity){ m = value != value ? 1 : 0; e = eMax; } else { e = floor(log(value) / LN2); if(value * (c = pow(2, -e)) < 1){ e--; c *= 2; } if(e + eBias >= 1){ value += rt / c; } else { value += rt * pow(2, 1 - eBias); } if(value * c >= 2){ e++; c /= 2; } if(e + eBias >= eMax){ m = 0; e = eMax; } else if(e + eBias >= 1){ m = (value * c - 1) * pow(2, mLen); e = e + eBias; } else { m = value * pow(2, eBias - 1) * pow(2, mLen); e = 0; } } for(; mLen >= 8; buffer[i++] = m & 255, m /= 256, mLen -= 8); e = e << mLen | m; eLen += mLen; for(; eLen > 0; buffer[i++] = e & 255, e /= 256, eLen -= 8); buffer[--i] |= s * 128; return buffer; }; var unpackIEEE754 = function(buffer, mLen, nBytes){ var eLen = nBytes * 8 - mLen - 1 , eMax = (1 << eLen) - 1 , eBias = eMax >> 1 , nBits = eLen - 7 , i = nBytes - 1 , s = buffer[i--] , e = s & 127 , m; s >>= 7; for(; nBits > 0; e = e * 256 + buffer[i], i--, nBits -= 8); m = e & (1 << -nBits) - 1; e >>= -nBits; nBits += mLen; for(; nBits > 0; m = m * 256 + buffer[i], i--, nBits -= 8); if(e === 0){ e = 1 - eBias; } else if(e === eMax){ return m ? NaN : s ? -Infinity : Infinity; } else { m = m + pow(2, mLen); e = e - eBias; } return (s ? -1 : 1) * m * pow(2, e - mLen); }; var unpackI32 = function(bytes){ return bytes[3] << 24 | bytes[2] << 16 | bytes[1] << 8 | bytes[0]; }; var packI8 = function(it){ return [it & 0xff]; }; var packI16 = function(it){ return [it & 0xff, it >> 8 & 0xff]; }; var packI32 = function(it){ return [it & 0xff, it >> 8 & 0xff, it >> 16 & 0xff, it >> 24 & 0xff]; }; var packF64 = function(it){ return packIEEE754(it, 52, 8); }; var packF32 = function(it){ return packIEEE754(it, 23, 4); }; var addGetter = function(C, key, internal){ dP(C[PROTOTYPE], key, {get: function(){ return this[internal]; }}); }; var get = function(view, bytes, index, isLittleEndian){ var numIndex = +index , intIndex = toInteger(numIndex); if(numIndex != intIndex || intIndex < 0 || intIndex + bytes > view[$LENGTH])throw RangeError(WRONG_INDEX); var store = view[$BUFFER]._b , start = intIndex + view[$OFFSET] , pack = store.slice(start, start + bytes); return isLittleEndian ? pack : pack.reverse(); }; var set = function(view, bytes, index, conversion, value, isLittleEndian){ var numIndex = +index , intIndex = toInteger(numIndex); if(numIndex != intIndex || intIndex < 0 || intIndex + bytes > view[$LENGTH])throw RangeError(WRONG_INDEX); var store = view[$BUFFER]._b , start = intIndex + view[$OFFSET] , pack = conversion(+value); for(var i = 0; i < bytes; i++)store[start + i] = pack[isLittleEndian ? i : bytes - i - 1]; }; var validateArrayBufferArguments = function(that, length){ anInstance(that, $ArrayBuffer, ARRAY_BUFFER); var numberLength = +length , byteLength = toLength(numberLength); if(numberLength != byteLength)throw RangeError(WRONG_LENGTH); return byteLength; }; if(!$typed.ABV){ $ArrayBuffer = function ArrayBuffer(length){ var byteLength = validateArrayBufferArguments(this, length); this._b = arrayFill.call(Array(byteLength), 0); this[$LENGTH] = byteLength; }; $DataView = function DataView(buffer, byteOffset, byteLength){ anInstance(this, $DataView, DATA_VIEW); anInstance(buffer, $ArrayBuffer, DATA_VIEW); var bufferLength = buffer[$LENGTH] , offset = toInteger(byteOffset); if(offset < 0 || offset > bufferLength)throw RangeError('Wrong offset!'); byteLength = byteLength === undefined ? bufferLength - offset : toLength(byteLength); if(offset + byteLength > bufferLength)throw RangeError(WRONG_LENGTH); this[$BUFFER] = buffer; this[$OFFSET] = offset; this[$LENGTH] = byteLength; }; if(DESCRIPTORS){ addGetter($ArrayBuffer, BYTE_LENGTH, '_l'); addGetter($DataView, BUFFER, '_b'); addGetter($DataView, BYTE_LENGTH, '_l'); addGetter($DataView, BYTE_OFFSET, '_o'); } redefineAll($DataView[PROTOTYPE], { getInt8: function getInt8(byteOffset){ return get(this, 1, byteOffset)[0] << 24 >> 24; }, getUint8: function getUint8(byteOffset){ return get(this, 1, byteOffset)[0]; }, getInt16: function getInt16(byteOffset /*, littleEndian */){ var bytes = get(this, 2, byteOffset, arguments[1]); return (bytes[1] << 8 | bytes[0]) << 16 >> 16; }, getUint16: function getUint16(byteOffset /*, littleEndian */){ var bytes = get(this, 2, byteOffset, arguments[1]); return bytes[1] << 8 | bytes[0]; }, getInt32: function getInt32(byteOffset /*, littleEndian */){ return unpackI32(get(this, 4, byteOffset, arguments[1])); }, getUint32: function getUint32(byteOffset /*, littleEndian */){ return unpackI32(get(this, 4, byteOffset, arguments[1])) >>> 0; }, getFloat32: function getFloat32(byteOffset /*, littleEndian */){ return unpackIEEE754(get(this, 4, byteOffset, arguments[1]), 23, 4); }, getFloat64: function getFloat64(byteOffset /*, littleEndian */){ return unpackIEEE754(get(this, 8, byteOffset, arguments[1]), 52, 8); }, setInt8: function setInt8(byteOffset, value){ set(this, 1, byteOffset, packI8, value); }, setUint8: function setUint8(byteOffset, value){ set(this, 1, byteOffset, packI8, value); }, setInt16: function setInt16(byteOffset, value /*, littleEndian */){ set(this, 2, byteOffset, packI16, value, arguments[2]); }, setUint16: function setUint16(byteOffset, value /*, littleEndian */){ set(this, 2, byteOffset, packI16, value, arguments[2]); }, setInt32: function setInt32(byteOffset, value /*, littleEndian */){ set(this, 4, byteOffset, packI32, value, arguments[2]); }, setUint32: function setUint32(byteOffset, value /*, littleEndian */){ set(this, 4, byteOffset, packI32, value, arguments[2]); }, setFloat32: function setFloat32(byteOffset, value /*, littleEndian */){ set(this, 4, byteOffset, packF32, value, arguments[2]); }, setFloat64: function setFloat64(byteOffset, value /*, littleEndian */){ set(this, 8, byteOffset, packF64, value, arguments[2]); } }); } else { if(!fails(function(){ new $ArrayBuffer; // eslint-disable-line no-new }) || !fails(function(){ new $ArrayBuffer(.5); // eslint-disable-line no-new })){ $ArrayBuffer = function ArrayBuffer(length){ return new BaseBuffer(validateArrayBufferArguments(this, length)); }; var ArrayBufferProto = $ArrayBuffer[PROTOTYPE] = BaseBuffer[PROTOTYPE]; for(var keys = gOPN(BaseBuffer), j = 0, key; keys.length > j; ){ if(!((key = keys[j++]) in $ArrayBuffer))hide($ArrayBuffer, key, BaseBuffer[key]); }; if(!LIBRARY)ArrayBufferProto.constructor = $ArrayBuffer; } // iOS Safari 7.x bug var view = new $DataView(new $ArrayBuffer(2)) , $setInt8 = $DataView[PROTOTYPE].setInt8; view.setInt8(0, 2147483648); view.setInt8(1, 2147483649); if(view.getInt8(0) || !view.getInt8(1))redefineAll($DataView[PROTOTYPE], { setInt8: function setInt8(byteOffset, value){ $setInt8.call(this, byteOffset, value << 24 >> 24); }, setUint8: function setUint8(byteOffset, value){ $setInt8.call(this, byteOffset, value << 24 >> 24); } }, true); } setToStringTag($ArrayBuffer, ARRAY_BUFFER); setToStringTag($DataView, DATA_VIEW); hide($DataView[PROTOTYPE], $typed.VIEW, true); exports[ARRAY_BUFFER] = $ArrayBuffer; exports[DATA_VIEW] = $DataView; },{"106":106,"108":108,"113":113,"28":28,"34":34,"38":38,"40":40,"58":58,"6":6,"67":67,"72":72,"86":86,"9":9,"92":92}],113:[function(_dereq_,module,exports){ var global = _dereq_(38) , hide = _dereq_(40) , uid = _dereq_(114) , TYPED = uid('typed_array') , VIEW = uid('view') , ABV = !!(global.ArrayBuffer && global.DataView) , CONSTR = ABV , i = 0, l = 9, Typed; var TypedArrayConstructors = ( 'Int8Array,Uint8Array,Uint8ClampedArray,Int16Array,Uint16Array,Int32Array,Uint32Array,Float32Array,Float64Array' ).split(','); while(i < l){ if(Typed = global[TypedArrayConstructors[i++]]){ hide(Typed.prototype, TYPED, true); hide(Typed.prototype, VIEW, true); } else CONSTR = false; } module.exports = { ABV: ABV, CONSTR: CONSTR, TYPED: TYPED, VIEW: VIEW }; },{"114":114,"38":38,"40":40}],114:[function(_dereq_,module,exports){ var id = 0 , px = Math.random(); module.exports = function(key){ return 'Symbol('.concat(key === undefined ? '' : key, ')_', (++id + px).toString(36)); }; },{}],115:[function(_dereq_,module,exports){ var global = _dereq_(38) , core = _dereq_(23) , LIBRARY = _dereq_(58) , wksExt = _dereq_(116) , defineProperty = _dereq_(67).f; module.exports = function(name){ var $Symbol = core.Symbol || (core.Symbol = LIBRARY ? {} : global.Symbol || {}); if(name.charAt(0) != '_' && !(name in $Symbol))defineProperty($Symbol, name, {value: wksExt.f(name)}); }; },{"116":116,"23":23,"38":38,"58":58,"67":67}],116:[function(_dereq_,module,exports){ exports.f = _dereq_(117); },{"117":117}],117:[function(_dereq_,module,exports){ var store = _dereq_(94)('wks') , uid = _dereq_(114) , Symbol = _dereq_(38).Symbol , USE_SYMBOL = typeof Symbol == 'function'; var $exports = module.exports = function(name){ return store[name] || (store[name] = USE_SYMBOL && Symbol[name] || (USE_SYMBOL ? Symbol : uid)('Symbol.' + name)); }; $exports.store = store; },{"114":114,"38":38,"94":94}],118:[function(_dereq_,module,exports){ var classof = _dereq_(17) , ITERATOR = _dereq_(117)('iterator') , Iterators = _dereq_(56); module.exports = _dereq_(23).getIteratorMethod = function(it){ if(it != undefined)return it[ITERATOR] || it['@@iterator'] || Iterators[classof(it)]; }; },{"117":117,"17":17,"23":23,"56":56}],119:[function(_dereq_,module,exports){ // https://github.com/benjamingr/RexExp.escape var $export = _dereq_(32) , $re = _dereq_(88)(/[\\^$*+?.()|[\]{}]/g, '\\$&'); $export($export.S, 'RegExp', {escape: function escape(it){ return $re(it); }}); },{"32":32,"88":88}],120:[function(_dereq_,module,exports){ // 22.1.3.3 Array.prototype.copyWithin(target, start, end = this.length) var $export = _dereq_(32); $export($export.P, 'Array', {copyWithin: _dereq_(8)}); _dereq_(5)('copyWithin'); },{"32":32,"5":5,"8":8}],121:[function(_dereq_,module,exports){ 'use strict'; var $export = _dereq_(32) , $every = _dereq_(12)(4); $export($export.P + $export.F * !_dereq_(96)([].every, true), 'Array', { // 22.1.3.5 / 15.4.4.16 Array.prototype.every(callbackfn [, thisArg]) every: function every(callbackfn /* , thisArg */){ return $every(this, callbackfn, arguments[1]); } }); },{"12":12,"32":32,"96":96}],122:[function(_dereq_,module,exports){ // 22.1.3.6 Array.prototype.fill(value, start = 0, end = this.length) var $export = _dereq_(32); $export($export.P, 'Array', {fill: _dereq_(9)}); _dereq_(5)('fill'); },{"32":32,"5":5,"9":9}],123:[function(_dereq_,module,exports){ 'use strict'; var $export = _dereq_(32) , $filter = _dereq_(12)(2); $export($export.P + $export.F * !_dereq_(96)([].filter, true), 'Array', { // 22.1.3.7 / 15.4.4.20 Array.prototype.filter(callbackfn [, thisArg]) filter: function filter(callbackfn /* , thisArg */){ return $filter(this, callbackfn, arguments[1]); } }); },{"12":12,"32":32,"96":96}],124:[function(_dereq_,module,exports){ 'use strict'; // 22.1.3.9 Array.prototype.findIndex(predicate, thisArg = undefined) var $export = _dereq_(32) , $find = _dereq_(12)(6) , KEY = 'findIndex' , forced = true; // Shouldn't skip holes if(KEY in [])Array(1)[KEY](function(){ forced = false; }); $export($export.P + $export.F * forced, 'Array', { findIndex: function findIndex(callbackfn/*, that = undefined */){ return $find(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined); } }); _dereq_(5)(KEY); },{"12":12,"32":32,"5":5}],125:[function(_dereq_,module,exports){ 'use strict'; // 22.1.3.8 Array.prototype.find(predicate, thisArg = undefined) var $export = _dereq_(32) , $find = _dereq_(12)(5) , KEY = 'find' , forced = true; // Shouldn't skip holes if(KEY in [])Array(1)[KEY](function(){ forced = false; }); $export($export.P + $export.F * forced, 'Array', { find: function find(callbackfn/*, that = undefined */){ return $find(this, callbackfn, arguments.length > 1 ? arguments[1] : undefined); } }); _dereq_(5)(KEY); },{"12":12,"32":32,"5":5}],126:[function(_dereq_,module,exports){ 'use strict'; var $export = _dereq_(32) , $forEach = _dereq_(12)(0) , STRICT = _dereq_(96)([].forEach, true); $export($export.P + $export.F * !STRICT, 'Array', { // 22.1.3.10 / 15.4.4.18 Array.prototype.forEach(callbackfn [, thisArg]) forEach: function forEach(callbackfn /* , thisArg */){ return $forEach(this, callbackfn, arguments[1]); } }); },{"12":12,"32":32,"96":96}],127:[function(_dereq_,module,exports){ 'use strict'; var ctx = _dereq_(25) , $export = _dereq_(32) , toObject = _dereq_(109) , call = _dereq_(51) , isArrayIter = _dereq_(46) , toLength = _dereq_(108) , createProperty = _dereq_(24) , getIterFn = _dereq_(118); $export($export.S + $export.F * !_dereq_(54)(function(iter){ Array.from(iter); }), 'Array', { // 22.1.2.1 Array.from(arrayLike, mapfn = undefined, thisArg = undefined) from: function from(arrayLike/*, mapfn = undefined, thisArg = undefined*/){ var O = toObject(arrayLike) , C = typeof this == 'function' ? this : Array , aLen = arguments.length , mapfn = aLen > 1 ? arguments[1] : undefined , mapping = mapfn !== undefined , index = 0 , iterFn = getIterFn(O) , length, result, step, iterator; if(mapping)mapfn = ctx(mapfn, aLen > 2 ? arguments[2] : undefined, 2); // if object isn't iterable or it's array with default iterator - use simple case if(iterFn != undefined && !(C == Array && isArrayIter(iterFn))){ for(iterator = iterFn.call(O), result = new C; !(step = iterator.next()).done; index++){ createProperty(result, index, mapping ? call(iterator, mapfn, [step.value, index], true) : step.value); } } else { length = toLength(O.length); for(result = new C(length); length > index; index++){ createProperty(result, index, mapping ? mapfn(O[index], index) : O[index]); } } result.length = index; return result; } }); },{"108":108,"109":109,"118":118,"24":24,"25":25,"32":32,"46":46,"51":51,"54":54}],128:[function(_dereq_,module,exports){ 'use strict'; var $export = _dereq_(32) , $indexOf = _dereq_(11)(false) , $native = [].indexOf , NEGATIVE_ZERO = !!$native && 1 / [1].indexOf(1, -0) < 0; $export($export.P + $export.F * (NEGATIVE_ZERO || !_dereq_(96)($native)), 'Array', { // 22.1.3.11 / 15.4.4.14 Array.prototype.indexOf(searchElement [, fromIndex]) indexOf: function indexOf(searchElement /*, fromIndex = 0 */){ return NEGATIVE_ZERO // convert -0 to +0 ? $native.apply(this, arguments) || 0 : $indexOf(this, searchElement, arguments[1]); } }); },{"11":11,"32":32,"96":96}],129:[function(_dereq_,module,exports){ // 22.1.2.2 / 15.4.3.2 Array.isArray(arg) var $export = _dereq_(32); $export($export.S, 'Array', {isArray: _dereq_(47)}); },{"32":32,"47":47}],130:[function(_dereq_,module,exports){ 'use strict'; var addToUnscopables = _dereq_(5) , step = _dereq_(55) , Iterators = _dereq_(56) , toIObject = _dereq_(107); // 22.1.3.4 Array.prototype.entries() // 22.1.3.13 Array.prototype.keys() // 22.1.3.29 Array.prototype.values() // 22.1.3.30 Array.prototype[@@iterator]() module.exports = _dereq_(53)(Array, 'Array', function(iterated, kind){ this._t = toIObject(iterated); // target this._i = 0; // next index this._k = kind; // kind // 22.1.5.2.1 %ArrayIteratorPrototype%.next() }, function(){ var O = this._t , kind = this._k , index = this._i++; if(!O || index >= O.length){ this._t = undefined; return step(1); } if(kind == 'keys' )return step(0, index); if(kind == 'values')return step(0, O[index]); return step(0, [index, O[index]]); }, 'values'); // argumentsList[@@iterator] is %ArrayProto_values% (9.4.4.6, 9.4.4.7) Iterators.Arguments = Iterators.Array; addToUnscopables('keys'); addToUnscopables('values'); addToUnscopables('entries'); },{"107":107,"5":5,"53":53,"55":55,"56":56}],131:[function(_dereq_,module,exports){ 'use strict'; // 22.1.3.13 Array.prototype.join(separator) var $export = _dereq_(32) , toIObject = _dereq_(107) , arrayJoin = [].join; // fallback for not array-like strings $export($export.P + $export.F * (_dereq_(45) != Object || !_dereq_(96)(arrayJoin)), 'Array', { join: function join(separator){ return arrayJoin.call(toIObject(this), separator === undefined ? ',' : separator); } }); },{"107":107,"32":32,"45":45,"96":96}],132:[function(_dereq_,module,exports){ 'use strict'; var $export = _dereq_(32) , toIObject = _dereq_(107) , toInteger = _dereq_(106) , toLength = _dereq_(108) , $native = [].lastIndexOf , NEGATIVE_ZERO = !!$native && 1 / [1].lastIndexOf(1, -0) < 0; $export($export.P + $export.F * (NEGATIVE_ZERO || !_dereq_(96)($native)), 'Array', { // 22.1.3.14 / 15.4.4.15 Array.prototype.lastIndexOf(searchElement [, fromIndex]) lastIndexOf: function lastIndexOf(searchElement /*, fromIndex = @[*-1] */){ // convert -0 to +0 if(NEGATIVE_ZERO)return $native.apply(this, arguments) || 0; var O = toIObject(this) , length = toLength(O.length) , index = length - 1; if(arguments.length > 1)index = Math.min(index, toInteger(arguments[1])); if(index < 0)index = length + index; for(;index >= 0; index--)if(index in O)if(O[index] === searchElement)return index || 0; return -1; } }); },{"106":106,"107":107,"108":108,"32":32,"96":96}],133:[function(_dereq_,module,exports){ 'use strict'; var $export = _dereq_(32) , $map = _dereq_(12)(1); $export($export.P + $export.F * !_dereq_(96)([].map, true), 'Array', { // 22.1.3.15 / 15.4.4.19 Array.prototype.map(callbackfn [, thisArg]) map: function map(callbackfn /* , thisArg */){ return $map(this, callbackfn, arguments[1]); } }); },{"12":12,"32":32,"96":96}],134:[function(_dereq_,module,exports){ 'use strict'; var $export = _dereq_(32) , createProperty = _dereq_(24); // WebKit Array.of isn't generic $export($export.S + $export.F * _dereq_(34)(function(){ function F(){} return !(Array.of.call(F) instanceof F); }), 'Array', { // 22.1.2.3 Array.of( ...items) of: function of(/* ...args */){ var index = 0 , aLen = arguments.length , result = new (typeof this == 'function' ? this : Array)(aLen); while(aLen > index)createProperty(result, index, arguments[index++]); result.length = aLen; return result; } }); },{"24":24,"32":32,"34":34}],135:[function(_dereq_,module,exports){ 'use strict'; var $export = _dereq_(32) , $reduce = _dereq_(13); $export($export.P + $export.F * !_dereq_(96)([].reduceRight, true), 'Array', { // 22.1.3.19 / 15.4.4.22 Array.prototype.reduceRight(callbackfn [, initialValue]) reduceRight: function reduceRight(callbackfn /* , initialValue */){ return $reduce(this, callbackfn, arguments.length, arguments[1], true); } }); },{"13":13,"32":32,"96":96}],136:[function(_dereq_,module,exports){ 'use strict'; var $export = _dereq_(32) , $reduce = _dereq_(13); $export($export.P + $export.F * !_dereq_(96)([].reduce, true), 'Array', { // 22.1.3.18 / 15.4.4.21 Array.prototype.reduce(callbackfn [, initialValue]) reduce: function reduce(callbackfn /* , initialValue */){ return $reduce(this, callbackfn, arguments.length, arguments[1], false); } }); },{"13":13,"32":32,"96":96}],137:[function(_dereq_,module,exports){ 'use strict'; var $export = _dereq_(32) , html = _dereq_(41) , cof = _dereq_(18) , toIndex = _dereq_(105) , toLength = _dereq_(108) , arraySlice = [].slice; // fallback for not array-like ES3 strings and DOM objects $export($export.P + $export.F * _dereq_(34)(function(){ if(html)arraySlice.call(html); }), 'Array', { slice: function slice(begin, end){ var len = toLength(this.length) , klass = cof(this); end = end === undefined ? len : end; if(klass == 'Array')return arraySlice.call(this, begin, end); var start = toIndex(begin, len) , upTo = toIndex(end, len) , size = toLength(upTo - start) , cloned = Array(size) , i = 0; for(; i < size; i++)cloned[i] = klass == 'String' ? this.charAt(start + i) : this[start + i]; return cloned; } }); },{"105":105,"108":108,"18":18,"32":32,"34":34,"41":41}],138:[function(_dereq_,module,exports){ 'use strict'; var $export = _dereq_(32) , $some = _dereq_(12)(3); $export($export.P + $export.F * !_dereq_(96)([].some, true), 'Array', { // 22.1.3.23 / 15.4.4.17 Array.prototype.some(callbackfn [, thisArg]) some: function some(callbackfn /* , thisArg */){ return $some(this, callbackfn, arguments[1]); } }); },{"12":12,"32":32,"96":96}],139:[function(_dereq_,module,exports){ 'use strict'; var $export = _dereq_(32) , aFunction = _dereq_(3) , toObject = _dereq_(109) , fails = _dereq_(34) , $sort = [].sort , test = [1, 2, 3]; $export($export.P + $export.F * (fails(function(){ // IE8- test.sort(undefined); }) || !fails(function(){ // V8 bug test.sort(null); // Old WebKit }) || !_dereq_(96)($sort)), 'Array', { // 22.1.3.25 Array.prototype.sort(comparefn) sort: function sort(comparefn){ return comparefn === undefined ? $sort.call(toObject(this)) : $sort.call(toObject(this), aFunction(comparefn)); } }); },{"109":109,"3":3,"32":32,"34":34,"96":96}],140:[function(_dereq_,module,exports){ _dereq_(91)('Array'); },{"91":91}],141:[function(_dereq_,module,exports){ // 20.3.3.1 / 15.9.4.4 Date.now() var $export = _dereq_(32); $export($export.S, 'Date', {now: function(){ return new Date().getTime(); }}); },{"32":32}],142:[function(_dereq_,module,exports){ 'use strict'; // 20.3.4.36 / 15.9.5.43 Date.prototype.toISOString() var $export = _dereq_(32) , fails = _dereq_(34) , getTime = Date.prototype.getTime; var lz = function(num){ return num > 9 ? num : '0' + num; }; // PhantomJS / old WebKit has a broken implementations $export($export.P + $export.F * (fails(function(){ return new Date(-5e13 - 1).toISOString() != '0385-07-25T07:06:39.999Z'; }) || !fails(function(){ new Date(NaN).toISOString(); })), 'Date', { toISOString: function toISOString(){ if(!isFinite(getTime.call(this)))throw RangeError('Invalid time value'); var d = this , y = d.getUTCFullYear() , m = d.getUTCMilliseconds() , s = y < 0 ? '-' : y > 9999 ? '+' : ''; return s + ('00000' + Math.abs(y)).slice(s ? -6 : -4) + '-' + lz(d.getUTCMonth() + 1) + '-' + lz(d.getUTCDate()) + 'T' + lz(d.getUTCHours()) + ':' + lz(d.getUTCMinutes()) + ':' + lz(d.getUTCSeconds()) + '.' + (m > 99 ? m : '0' + lz(m)) + 'Z'; } }); },{"32":32,"34":34}],143:[function(_dereq_,module,exports){ 'use strict'; var $export = _dereq_(32) , toObject = _dereq_(109) , toPrimitive = _dereq_(110); $export($export.P + $export.F * _dereq_(34)(function(){ return new Date(NaN).toJSON() !== null || Date.prototype.toJSON.call({toISOString: function(){ return 1; }}) !== 1; }), 'Date', { toJSON: function toJSON(key){ var O = toObject(this) , pv = toPrimitive(O); return typeof pv == 'number' && !isFinite(pv) ? null : O.toISOString(); } }); },{"109":109,"110":110,"32":32,"34":34}],144:[function(_dereq_,module,exports){ var TO_PRIMITIVE = _dereq_(117)('toPrimitive') , proto = Date.prototype; if(!(TO_PRIMITIVE in proto))_dereq_(40)(proto, TO_PRIMITIVE, _dereq_(26)); },{"117":117,"26":26,"40":40}],145:[function(_dereq_,module,exports){ var DateProto = Date.prototype , INVALID_DATE = 'Invalid Date' , TO_STRING = 'toString' , $toString = DateProto[TO_STRING] , getTime = DateProto.getTime; if(new Date(NaN) + '' != INVALID_DATE){ _dereq_(87)(DateProto, TO_STRING, function toString(){ var value = getTime.call(this); return value === value ? $toString.call(this) : INVALID_DATE; }); } },{"87":87}],146:[function(_dereq_,module,exports){ // 19.2.3.2 / 15.3.4.5 Function.prototype.bind(thisArg, args...) var $export = _dereq_(32); $export($export.P, 'Function', {bind: _dereq_(16)}); },{"16":16,"32":32}],147:[function(_dereq_,module,exports){ 'use strict'; var isObject = _dereq_(49) , getPrototypeOf = _dereq_(74) , HAS_INSTANCE = _dereq_(117)('hasInstance') , FunctionProto = Function.prototype; // 19.2.3.6 Function.prototype[@@hasInstance](V) if(!(HAS_INSTANCE in FunctionProto))_dereq_(67).f(FunctionProto, HAS_INSTANCE, {value: function(O){ if(typeof this != 'function' || !isObject(O))return false; if(!isObject(this.prototype))return O instanceof this; // for environment w/o native `@@hasInstance` logic enough `instanceof`, but add this: while(O = getPrototypeOf(O))if(this.prototype === O)return true; return false; }}); },{"117":117,"49":49,"67":67,"74":74}],148:[function(_dereq_,module,exports){ var dP = _dereq_(67).f , createDesc = _dereq_(85) , has = _dereq_(39) , FProto = Function.prototype , nameRE = /^\s*function ([^ (]*)/ , NAME = 'name'; var isExtensible = Object.isExtensible || function(){ return true; }; // 19.2.4.2 name NAME in FProto || _dereq_(28) && dP(FProto, NAME, { configurable: true, get: function(){ try { var that = this , name = ('' + that).match(nameRE)[1]; has(that, NAME) || !isExtensible(that) || dP(that, NAME, createDesc(5, name)); return name; } catch(e){ return ''; } } }); },{"28":28,"39":39,"67":67,"85":85}],149:[function(_dereq_,module,exports){ 'use strict'; var strong = _dereq_(19); // 23.1 Map Objects module.exports = _dereq_(22)('Map', function(get){ return function Map(){ return get(this, arguments.length > 0 ? arguments[0] : undefined); }; }, { // 23.1.3.6 Map.prototype.get(key) get: function get(key){ var entry = strong.getEntry(this, key); return entry && entry.v; }, // 23.1.3.9 Map.prototype.set(key, value) set: function set(key, value){ return strong.def(this, key === 0 ? 0 : key, value); } }, strong, true); },{"19":19,"22":22}],150:[function(_dereq_,module,exports){ // 20.2.2.3 Math.acosh(x) var $export = _dereq_(32) , log1p = _dereq_(60) , sqrt = Math.sqrt , $acosh = Math.acosh; $export($export.S + $export.F * !($acosh // V8 bug: https://code.google.com/p/v8/issues/detail?id=3509 && Math.floor($acosh(Number.MAX_VALUE)) == 710 // Tor Browser bug: Math.acosh(Infinity) -> NaN && $acosh(Infinity) == Infinity ), 'Math', { acosh: function acosh(x){ return (x = +x) < 1 ? NaN : x > 94906265.62425156 ? Math.log(x) + Math.LN2 : log1p(x - 1 + sqrt(x - 1) * sqrt(x + 1)); } }); },{"32":32,"60":60}],151:[function(_dereq_,module,exports){ // 20.2.2.5 Math.asinh(x) var $export = _dereq_(32) , $asinh = Math.asinh; function asinh(x){ return !isFinite(x = +x) || x == 0 ? x : x < 0 ? -asinh(-x) : Math.log(x + Math.sqrt(x * x + 1)); } // Tor Browser bug: Math.asinh(0) -> -0 $export($export.S + $export.F * !($asinh && 1 / $asinh(0) > 0), 'Math', {asinh: asinh}); },{"32":32}],152:[function(_dereq_,module,exports){ // 20.2.2.7 Math.atanh(x) var $export = _dereq_(32) , $atanh = Math.atanh; // Tor Browser bug: Math.atanh(-0) -> 0 $export($export.S + $export.F * !($atanh && 1 / $atanh(-0) < 0), 'Math', { atanh: function atanh(x){ return (x = +x) == 0 ? x : Math.log((1 + x) / (1 - x)) / 2; } }); },{"32":32}],153:[function(_dereq_,module,exports){ // 20.2.2.9 Math.cbrt(x) var $export = _dereq_(32) , sign = _dereq_(61); $export($export.S, 'Math', { cbrt: function cbrt(x){ return sign(x = +x) * Math.pow(Math.abs(x), 1 / 3); } }); },{"32":32,"61":61}],154:[function(_dereq_,module,exports){ // 20.2.2.11 Math.clz32(x) var $export = _dereq_(32); $export($export.S, 'Math', { clz32: function clz32(x){ return (x >>>= 0) ? 31 - Math.floor(Math.log(x + 0.5) * Math.LOG2E) : 32; } }); },{"32":32}],155:[function(_dereq_,module,exports){ // 20.2.2.12 Math.cosh(x) var $export = _dereq_(32) , exp = Math.exp; $export($export.S, 'Math', { cosh: function cosh(x){ return (exp(x = +x) + exp(-x)) / 2; } }); },{"32":32}],156:[function(_dereq_,module,exports){ // 20.2.2.14 Math.expm1(x) var $export = _dereq_(32) , $expm1 = _dereq_(59); $export($export.S + $export.F * ($expm1 != Math.expm1), 'Math', {expm1: $expm1}); },{"32":32,"59":59}],157:[function(_dereq_,module,exports){ // 20.2.2.16 Math.fround(x) var $export = _dereq_(32) , sign = _dereq_(61) , pow = Math.pow , EPSILON = pow(2, -52) , EPSILON32 = pow(2, -23) , MAX32 = pow(2, 127) * (2 - EPSILON32) , MIN32 = pow(2, -126); var roundTiesToEven = function(n){ return n + 1 / EPSILON - 1 / EPSILON; }; $export($export.S, 'Math', { fround: function fround(x){ var $abs = Math.abs(x) , $sign = sign(x) , a, result; if($abs < MIN32)return $sign * roundTiesToEven($abs / MIN32 / EPSILON32) * MIN32 * EPSILON32; a = (1 + EPSILON32 / EPSILON) * $abs; result = a - (a - $abs); if(result > MAX32 || result != result)return $sign * Infinity; return $sign * result; } }); },{"32":32,"61":61}],158:[function(_dereq_,module,exports){ // 20.2.2.17 Math.hypot([value1[, value2[, … ]]]) var $export = _dereq_(32) , abs = Math.abs; $export($export.S, 'Math', { hypot: function hypot(value1, value2){ // eslint-disable-line no-unused-vars var sum = 0 , i = 0 , aLen = arguments.length , larg = 0 , arg, div; while(i < aLen){ arg = abs(arguments[i++]); if(larg < arg){ div = larg / arg; sum = sum * div * div + 1; larg = arg; } else if(arg > 0){ div = arg / larg; sum += div * div; } else sum += arg; } return larg === Infinity ? Infinity : larg * Math.sqrt(sum); } }); },{"32":32}],159:[function(_dereq_,module,exports){ // 20.2.2.18 Math.imul(x, y) var $export = _dereq_(32) , $imul = Math.imul; // some WebKit versions fails with big numbers, some has wrong arity $export($export.S + $export.F * _dereq_(34)(function(){ return $imul(0xffffffff, 5) != -5 || $imul.length != 2; }), 'Math', { imul: function imul(x, y){ var UINT16 = 0xffff , xn = +x , yn = +y , xl = UINT16 & xn , yl = UINT16 & yn; return 0 | xl * yl + ((UINT16 & xn >>> 16) * yl + xl * (UINT16 & yn >>> 16) << 16 >>> 0); } }); },{"32":32,"34":34}],160:[function(_dereq_,module,exports){ // 20.2.2.21 Math.log10(x) var $export = _dereq_(32); $export($export.S, 'Math', { log10: function log10(x){ return Math.log(x) / Math.LN10; } }); },{"32":32}],161:[function(_dereq_,module,exports){ // 20.2.2.20 Math.log1p(x) var $export = _dereq_(32); $export($export.S, 'Math', {log1p: _dereq_(60)}); },{"32":32,"60":60}],162:[function(_dereq_,module,exports){ // 20.2.2.22 Math.log2(x) var $export = _dereq_(32); $export($export.S, 'Math', { log2: function log2(x){ return Math.log(x) / Math.LN2; } }); },{"32":32}],163:[function(_dereq_,module,exports){ // 20.2.2.28 Math.sign(x) var $export = _dereq_(32); $export($export.S, 'Math', {sign: _dereq_(61)}); },{"32":32,"61":61}],164:[function(_dereq_,module,exports){ // 20.2.2.30 Math.sinh(x) var $export = _dereq_(32) , expm1 = _dereq_(59) , exp = Math.exp; // V8 near Chromium 38 has a problem with very small numbers $export($export.S + $export.F * _dereq_(34)(function(){ return !Math.sinh(-2e-17) != -2e-17; }), 'Math', { sinh: function sinh(x){ return Math.abs(x = +x) < 1 ? (expm1(x) - expm1(-x)) / 2 : (exp(x - 1) - exp(-x - 1)) * (Math.E / 2); } }); },{"32":32,"34":34,"59":59}],165:[function(_dereq_,module,exports){ // 20.2.2.33 Math.tanh(x) var $export = _dereq_(32) , expm1 = _dereq_(59) , exp = Math.exp; $export($export.S, 'Math', { tanh: function tanh(x){ var a = expm1(x = +x) , b = expm1(-x); return a == Infinity ? 1 : b == Infinity ? -1 : (a - b) / (exp(x) + exp(-x)); } }); },{"32":32,"59":59}],166:[function(_dereq_,module,exports){ // 20.2.2.34 Math.trunc(x) var $export = _dereq_(32); $export($export.S, 'Math', { trunc: function trunc(it){ return (it > 0 ? Math.floor : Math.ceil)(it); } }); },{"32":32}],167:[function(_dereq_,module,exports){ 'use strict'; var global = _dereq_(38) , has = _dereq_(39) , cof = _dereq_(18) , inheritIfRequired = _dereq_(43) , toPrimitive = _dereq_(110) , fails = _dereq_(34) , gOPN = _dereq_(72).f , gOPD = _dereq_(70).f , dP = _dereq_(67).f , $trim = _dereq_(102).trim , NUMBER = 'Number' , $Number = global[NUMBER] , Base = $Number , proto = $Number.prototype // Opera ~12 has broken Object#toString , BROKEN_COF = cof(_dereq_(66)(proto)) == NUMBER , TRIM = 'trim' in String.prototype; // 7.1.3 ToNumber(argument) var toNumber = function(argument){ var it = toPrimitive(argument, false); if(typeof it == 'string' && it.length > 2){ it = TRIM ? it.trim() : $trim(it, 3); var first = it.charCodeAt(0) , third, radix, maxCode; if(first === 43 || first === 45){ third = it.charCodeAt(2); if(third === 88 || third === 120)return NaN; // Number('+0x1') should be NaN, old V8 fix } else if(first === 48){ switch(it.charCodeAt(1)){ case 66 : case 98 : radix = 2; maxCode = 49; break; // fast equal /^0b[01]+$/i case 79 : case 111 : radix = 8; maxCode = 55; break; // fast equal /^0o[0-7]+$/i default : return +it; } for(var digits = it.slice(2), i = 0, l = digits.length, code; i < l; i++){ code = digits.charCodeAt(i); // parseInt parses a string to a first unavailable symbol // but ToNumber should return NaN if a string contains unavailable symbols if(code < 48 || code > maxCode)return NaN; } return parseInt(digits, radix); } } return +it; }; if(!$Number(' 0o1') || !$Number('0b1') || $Number('+0x1')){ $Number = function Number(value){ var it = arguments.length < 1 ? 0 : value , that = this; return that instanceof $Number // check on 1..constructor(foo) case && (BROKEN_COF ? fails(function(){ proto.valueOf.call(that); }) : cof(that) != NUMBER) ? inheritIfRequired(new Base(toNumber(it)), that, $Number) : toNumber(it); }; for(var keys = _dereq_(28) ? gOPN(Base) : ( // ES3: 'MAX_VALUE,MIN_VALUE,NaN,NEGATIVE_INFINITY,POSITIVE_INFINITY,' + // ES6 (in case, if modules with ES6 Number statics required before): 'EPSILON,isFinite,isInteger,isNaN,isSafeInteger,MAX_SAFE_INTEGER,' + 'MIN_SAFE_INTEGER,parseFloat,parseInt,isInteger' ).split(','), j = 0, key; keys.length > j; j++){ if(has(Base, key = keys[j]) && !has($Number, key)){ dP($Number, key, gOPD(Base, key)); } } $Number.prototype = proto; proto.constructor = $Number; _dereq_(87)(global, NUMBER, $Number); } },{"102":102,"110":110,"18":18,"28":28,"34":34,"38":38,"39":39,"43":43,"66":66,"67":67,"70":70,"72":72,"87":87}],168:[function(_dereq_,module,exports){ // 20.1.2.1 Number.EPSILON var $export = _dereq_(32); $export($export.S, 'Number', {EPSILON: Math.pow(2, -52)}); },{"32":32}],169:[function(_dereq_,module,exports){ // 20.1.2.2 Number.isFinite(number) var $export = _dereq_(32) , _isFinite = _dereq_(38).isFinite; $export($export.S, 'Number', { isFinite: function isFinite(it){ return typeof it == 'number' && _isFinite(it); } }); },{"32":32,"38":38}],170:[function(_dereq_,module,exports){ // 20.1.2.3 Number.isInteger(number) var $export = _dereq_(32); $export($export.S, 'Number', {isInteger: _dereq_(48)}); },{"32":32,"48":48}],171:[function(_dereq_,module,exports){ // 20.1.2.4 Number.isNaN(number) var $export = _dereq_(32); $export($export.S, 'Number', { isNaN: function isNaN(number){ return number != number; } }); },{"32":32}],172:[function(_dereq_,module,exports){ // 20.1.2.5 Number.isSafeInteger(number) var $export = _dereq_(32) , isInteger = _dereq_(48) , abs = Math.abs; $export($export.S, 'Number', { isSafeInteger: function isSafeInteger(number){ return isInteger(number) && abs(number) <= 0x1fffffffffffff; } }); },{"32":32,"48":48}],173:[function(_dereq_,module,exports){ // 20.1.2.6 Number.MAX_SAFE_INTEGER var $export = _dereq_(32); $export($export.S, 'Number', {MAX_SAFE_INTEGER: 0x1fffffffffffff}); },{"32":32}],174:[function(_dereq_,module,exports){ // 20.1.2.10 Number.MIN_SAFE_INTEGER var $export = _dereq_(32); $export($export.S, 'Number', {MIN_SAFE_INTEGER: -0x1fffffffffffff}); },{"32":32}],175:[function(_dereq_,module,exports){ var $export = _dereq_(32) , $parseFloat = _dereq_(81); // 20.1.2.12 Number.parseFloat(string) $export($export.S + $export.F * (Number.parseFloat != $parseFloat), 'Number', {parseFloat: $parseFloat}); },{"32":32,"81":81}],176:[function(_dereq_,module,exports){ var $export = _dereq_(32) , $parseInt = _dereq_(82); // 20.1.2.13 Number.parseInt(string, radix) $export($export.S + $export.F * (Number.parseInt != $parseInt), 'Number', {parseInt: $parseInt}); },{"32":32,"82":82}],177:[function(_dereq_,module,exports){ 'use strict'; var $export = _dereq_(32) , toInteger = _dereq_(106) , aNumberValue = _dereq_(4) , repeat = _dereq_(101) , $toFixed = 1..toFixed , floor = Math.floor , data = [0, 0, 0, 0, 0, 0] , ERROR = 'Number.toFixed: incorrect invocation!' , ZERO = '0'; var multiply = function(n, c){ var i = -1 , c2 = c; while(++i < 6){ c2 += n * data[i]; data[i] = c2 % 1e7; c2 = floor(c2 / 1e7); } }; var divide = function(n){ var i = 6 , c = 0; while(--i >= 0){ c += data[i]; data[i] = floor(c / n); c = (c % n) * 1e7; } }; var numToString = function(){ var i = 6 , s = ''; while(--i >= 0){ if(s !== '' || i === 0 || data[i] !== 0){ var t = String(data[i]); s = s === '' ? t : s + repeat.call(ZERO, 7 - t.length) + t; } } return s; }; var pow = function(x, n, acc){ return n === 0 ? acc : n % 2 === 1 ? pow(x, n - 1, acc * x) : pow(x * x, n / 2, acc); }; var log = function(x){ var n = 0 , x2 = x; while(x2 >= 4096){ n += 12; x2 /= 4096; } while(x2 >= 2){ n += 1; x2 /= 2; } return n; }; $export($export.P + $export.F * (!!$toFixed && ( 0.00008.toFixed(3) !== '0.000' || 0.9.toFixed(0) !== '1' || 1.255.toFixed(2) !== '1.25' || 1000000000000000128..toFixed(0) !== '1000000000000000128' ) || !_dereq_(34)(function(){ // V8 ~ Android 4.3- $toFixed.call({}); })), 'Number', { toFixed: function toFixed(fractionDigits){ var x = aNumberValue(this, ERROR) , f = toInteger(fractionDigits) , s = '' , m = ZERO , e, z, j, k; if(f < 0 || f > 20)throw RangeError(ERROR); if(x != x)return 'NaN'; if(x <= -1e21 || x >= 1e21)return String(x); if(x < 0){ s = '-'; x = -x; } if(x > 1e-21){ e = log(x * pow(2, 69, 1)) - 69; z = e < 0 ? x * pow(2, -e, 1) : x / pow(2, e, 1); z *= 0x10000000000000; e = 52 - e; if(e > 0){ multiply(0, z); j = f; while(j >= 7){ multiply(1e7, 0); j -= 7; } multiply(pow(10, j, 1), 0); j = e - 1; while(j >= 23){ divide(1 << 23); j -= 23; } divide(1 << j); multiply(1, 1); divide(2); m = numToString(); } else { multiply(0, z); multiply(1 << -e, 0); m = numToString() + repeat.call(ZERO, f); } } if(f > 0){ k = m.length; m = s + (k <= f ? '0.' + repeat.call(ZERO, f - k) + m : m.slice(0, k - f) + '.' + m.slice(k - f)); } else { m = s + m; } return m; } }); },{"101":101,"106":106,"32":32,"34":34,"4":4}],178:[function(_dereq_,module,exports){ 'use strict'; var $export = _dereq_(32) , $fails = _dereq_(34) , aNumberValue = _dereq_(4) , $toPrecision = 1..toPrecision; $export($export.P + $export.F * ($fails(function(){ // IE7- return $toPrecision.call(1, undefined) !== '1'; }) || !$fails(function(){ // V8 ~ Android 4.3- $toPrecision.call({}); })), 'Number', { toPrecision: function toPrecision(precision){ var that = aNumberValue(this, 'Number#toPrecision: incorrect invocation!'); return precision === undefined ? $toPrecision.call(that) : $toPrecision.call(that, precision); } }); },{"32":32,"34":34,"4":4}],179:[function(_dereq_,module,exports){ // 19.1.3.1 Object.assign(target, source) var $export = _dereq_(32); $export($export.S + $export.F, 'Object', {assign: _dereq_(65)}); },{"32":32,"65":65}],180:[function(_dereq_,module,exports){ var $export = _dereq_(32) // 19.1.2.2 / 15.2.3.5 Object.create(O [, Properties]) $export($export.S, 'Object', {create: _dereq_(66)}); },{"32":32,"66":66}],181:[function(_dereq_,module,exports){ var $export = _dereq_(32); // 19.1.2.3 / 15.2.3.7 Object.defineProperties(O, Properties) $export($export.S + $export.F * !_dereq_(28), 'Object', {defineProperties: _dereq_(68)}); },{"28":28,"32":32,"68":68}],182:[function(_dereq_,module,exports){ var $export = _dereq_(32); // 19.1.2.4 / 15.2.3.6 Object.defineProperty(O, P, Attributes) $export($export.S + $export.F * !_dereq_(28), 'Object', {defineProperty: _dereq_(67).f}); },{"28":28,"32":32,"67":67}],183:[function(_dereq_,module,exports){ // 19.1.2.5 Object.freeze(O) var isObject = _dereq_(49) , meta = _dereq_(62).onFreeze; _dereq_(78)('freeze', function($freeze){ return function freeze(it){ return $freeze && isObject(it) ? $freeze(meta(it)) : it; }; }); },{"49":49,"62":62,"78":78}],184:[function(_dereq_,module,exports){ // 19.1.2.6 Object.getOwnPropertyDescriptor(O, P) var toIObject = _dereq_(107) , $getOwnPropertyDescriptor = _dereq_(70).f; _dereq_(78)('getOwnPropertyDescriptor', function(){ return function getOwnPropertyDescriptor(it, key){ return $getOwnPropertyDescriptor(toIObject(it), key); }; }); },{"107":107,"70":70,"78":78}],185:[function(_dereq_,module,exports){ // 19.1.2.7 Object.getOwnPropertyNames(O) _dereq_(78)('getOwnPropertyNames', function(){ return _dereq_(71).f; }); },{"71":71,"78":78}],186:[function(_dereq_,module,exports){ // 19.1.2.9 Object.getPrototypeOf(O) var toObject = _dereq_(109) , $getPrototypeOf = _dereq_(74); _dereq_(78)('getPrototypeOf', function(){ return function getPrototypeOf(it){ return $getPrototypeOf(toObject(it)); }; }); },{"109":109,"74":74,"78":78}],187:[function(_dereq_,module,exports){ // 19.1.2.11 Object.isExtensible(O) var isObject = _dereq_(49); _dereq_(78)('isExtensible', function($isExtensible){ return function isExtensible(it){ return isObject(it) ? $isExtensible ? $isExtensible(it) : true : false; }; }); },{"49":49,"78":78}],188:[function(_dereq_,module,exports){ // 19.1.2.12 Object.isFrozen(O) var isObject = _dereq_(49); _dereq_(78)('isFrozen', function($isFrozen){ return function isFrozen(it){ return isObject(it) ? $isFrozen ? $isFrozen(it) : false : true; }; }); },{"49":49,"78":78}],189:[function(_dereq_,module,exports){ // 19.1.2.13 Object.isSealed(O) var isObject = _dereq_(49); _dereq_(78)('isSealed', function($isSealed){ return function isSealed(it){ return isObject(it) ? $isSealed ? $isSealed(it) : false : true; }; }); },{"49":49,"78":78}],190:[function(_dereq_,module,exports){ // 19.1.3.10 Object.is(value1, value2) var $export = _dereq_(32); $export($export.S, 'Object', {is: _dereq_(89)}); },{"32":32,"89":89}],191:[function(_dereq_,module,exports){ // 19.1.2.14 Object.keys(O) var toObject = _dereq_(109) , $keys = _dereq_(76); _dereq_(78)('keys', function(){ return function keys(it){ return $keys(toObject(it)); }; }); },{"109":109,"76":76,"78":78}],192:[function(_dereq_,module,exports){ // 19.1.2.15 Object.preventExtensions(O) var isObject = _dereq_(49) , meta = _dereq_(62).onFreeze; _dereq_(78)('preventExtensions', function($preventExtensions){ return function preventExtensions(it){ return $preventExtensions && isObject(it) ? $preventExtensions(meta(it)) : it; }; }); },{"49":49,"62":62,"78":78}],193:[function(_dereq_,module,exports){ // 19.1.2.17 Object.seal(O) var isObject = _dereq_(49) , meta = _dereq_(62).onFreeze; _dereq_(78)('seal', function($seal){ return function seal(it){ return $seal && isObject(it) ? $seal(meta(it)) : it; }; }); },{"49":49,"62":62,"78":78}],194:[function(_dereq_,module,exports){ // 19.1.3.19 Object.setPrototypeOf(O, proto) var $export = _dereq_(32); $export($export.S, 'Object', {setPrototypeOf: _dereq_(90).set}); },{"32":32,"90":90}],195:[function(_dereq_,module,exports){ 'use strict'; // 19.1.3.6 Object.prototype.toString() var classof = _dereq_(17) , test = {}; test[_dereq_(117)('toStringTag')] = 'z'; if(test + '' != '[object z]'){ _dereq_(87)(Object.prototype, 'toString', function toString(){ return '[object ' + classof(this) + ']'; }, true); } },{"117":117,"17":17,"87":87}],196:[function(_dereq_,module,exports){ var $export = _dereq_(32) , $parseFloat = _dereq_(81); // 18.2.4 parseFloat(string) $export($export.G + $export.F * (parseFloat != $parseFloat), {parseFloat: $parseFloat}); },{"32":32,"81":81}],197:[function(_dereq_,module,exports){ var $export = _dereq_(32) , $parseInt = _dereq_(82); // 18.2.5 parseInt(string, radix) $export($export.G + $export.F * (parseInt != $parseInt), {parseInt: $parseInt}); },{"32":32,"82":82}],198:[function(_dereq_,module,exports){ 'use strict'; var LIBRARY = _dereq_(58) , global = _dereq_(38) , ctx = _dereq_(25) , classof = _dereq_(17) , $export = _dereq_(32) , isObject = _dereq_(49) , aFunction = _dereq_(3) , anInstance = _dereq_(6) , forOf = _dereq_(37) , speciesConstructor = _dereq_(95) , task = _dereq_(104).set , microtask = _dereq_(64)() , PROMISE = 'Promise' , TypeError = global.TypeError , process = global.process , $Promise = global[PROMISE] , process = global.process , isNode = classof(process) == 'process' , empty = function(){ /* empty */ } , Internal, GenericPromiseCapability, Wrapper; var USE_NATIVE = !!function(){ try { // correct subclassing with @@species support var promise = $Promise.resolve(1) , FakePromise = (promise.constructor = {})[_dereq_(117)('species')] = function(exec){ exec(empty, empty); }; // unhandled rejections tracking support, NodeJS Promise without it fails @@species test return (isNode || typeof PromiseRejectionEvent == 'function') && promise.then(empty) instanceof FakePromise; } catch(e){ /* empty */ } }(); // helpers var sameConstructor = function(a, b){ // with library wrapper special case return a === b || a === $Promise && b === Wrapper; }; var isThenable = function(it){ var then; return isObject(it) && typeof (then = it.then) == 'function' ? then : false; }; var newPromiseCapability = function(C){ return sameConstructor($Promise, C) ? new PromiseCapability(C) : new GenericPromiseCapability(C); }; var PromiseCapability = GenericPromiseCapability = function(C){ var resolve, reject; this.promise = new C(function($$resolve, $$reject){ if(resolve !== undefined || reject !== undefined)throw TypeError('Bad Promise constructor'); resolve = $$resolve; reject = $$reject; }); this.resolve = aFunction(resolve); this.reject = aFunction(reject); }; var perform = function(exec){ try { exec(); } catch(e){ return {error: e}; } }; var notify = function(promise, isReject){ if(promise._n)return; promise._n = true; var chain = promise._c; microtask(function(){ var value = promise._v , ok = promise._s == 1 , i = 0; var run = function(reaction){ var handler = ok ? reaction.ok : reaction.fail , resolve = reaction.resolve , reject = reaction.reject , domain = reaction.domain , result, then; try { if(handler){ if(!ok){ if(promise._h == 2)onHandleUnhandled(promise); promise._h = 1; } if(handler === true)result = value; else { if(domain)domain.enter(); result = handler(value); if(domain)domain.exit(); } if(result === reaction.promise){ reject(TypeError('Promise-chain cycle')); } else if(then = isThenable(result)){ then.call(result, resolve, reject); } else resolve(result); } else reject(value); } catch(e){ reject(e); } }; while(chain.length > i)run(chain[i++]); // variable length - can't use forEach promise._c = []; promise._n = false; if(isReject && !promise._h)onUnhandled(promise); }); }; var onUnhandled = function(promise){ task.call(global, function(){ var value = promise._v , abrupt, handler, console; if(isUnhandled(promise)){ abrupt = perform(function(){ if(isNode){ process.emit('unhandledRejection', value, promise); } else if(handler = global.onunhandledrejection){ handler({promise: promise, reason: value}); } else if((console = global.console) && console.error){ console.error('Unhandled promise rejection', value); } }); // Browsers should not trigger `rejectionHandled` event if it was handled here, NodeJS - should promise._h = isNode || isUnhandled(promise) ? 2 : 1; } promise._a = undefined; if(abrupt)throw abrupt.error; }); }; var isUnhandled = function(promise){ if(promise._h == 1)return false; var chain = promise._a || promise._c , i = 0 , reaction; while(chain.length > i){ reaction = chain[i++]; if(reaction.fail || !isUnhandled(reaction.promise))return false; } return true; }; var onHandleUnhandled = function(promise){ task.call(global, function(){ var handler; if(isNode){ process.emit('rejectionHandled', promise); } else if(handler = global.onrejectionhandled){ handler({promise: promise, reason: promise._v}); } }); }; var $reject = function(value){ var promise = this; if(promise._d)return; promise._d = true; promise = promise._w || promise; // unwrap promise._v = value; promise._s = 2; if(!promise._a)promise._a = promise._c.slice(); notify(promise, true); }; var $resolve = function(value){ var promise = this , then; if(promise._d)return; promise._d = true; promise = promise._w || promise; // unwrap try { if(promise === value)throw TypeError("Promise can't be resolved itself"); if(then = isThenable(value)){ microtask(function(){ var wrapper = {_w: promise, _d: false}; // wrap try { then.call(value, ctx($resolve, wrapper, 1), ctx($reject, wrapper, 1)); } catch(e){ $reject.call(wrapper, e); } }); } else { promise._v = value; promise._s = 1; notify(promise, false); } } catch(e){ $reject.call({_w: promise, _d: false}, e); // wrap } }; // constructor polyfill if(!USE_NATIVE){ // 25.4.3.1 Promise(executor) $Promise = function Promise(executor){ anInstance(this, $Promise, PROMISE, '_h'); aFunction(executor); Internal.call(this); try { executor(ctx($resolve, this, 1), ctx($reject, this, 1)); } catch(err){ $reject.call(this, err); } }; Internal = function Promise(executor){ this._c = []; // <- awaiting reactions this._a = undefined; // <- checked in isUnhandled reactions this._s = 0; // <- state this._d = false; // <- done this._v = undefined; // <- value this._h = 0; // <- rejection state, 0 - default, 1 - handled, 2 - unhandled this._n = false; // <- notify }; Internal.prototype = _dereq_(86)($Promise.prototype, { // 25.4.5.3 Promise.prototype.then(onFulfilled, onRejected) then: function then(onFulfilled, onRejected){ var reaction = newPromiseCapability(speciesConstructor(this, $Promise)); reaction.ok = typeof onFulfilled == 'function' ? onFulfilled : true; reaction.fail = typeof onRejected == 'function' && onRejected; reaction.domain = isNode ? process.domain : undefined; this._c.push(reaction); if(this._a)this._a.push(reaction); if(this._s)notify(this, false); return reaction.promise; }, // 25.4.5.1 Promise.prototype.catch(onRejected) 'catch': function(onRejected){ return this.then(undefined, onRejected); } }); PromiseCapability = function(){ var promise = new Internal; this.promise = promise; this.resolve = ctx($resolve, promise, 1); this.reject = ctx($reject, promise, 1); }; } $export($export.G + $export.W + $export.F * !USE_NATIVE, {Promise: $Promise}); _dereq_(92)($Promise, PROMISE); _dereq_(91)(PROMISE); Wrapper = _dereq_(23)[PROMISE]; // statics $export($export.S + $export.F * !USE_NATIVE, PROMISE, { // 25.4.4.5 Promise.reject(r) reject: function reject(r){ var capability = newPromiseCapability(this) , $$reject = capability.reject; $$reject(r); return capability.promise; } }); $export($export.S + $export.F * (LIBRARY || !USE_NATIVE), PROMISE, { // 25.4.4.6 Promise.resolve(x) resolve: function resolve(x){ // instanceof instead of internal slot check because we should fix it without replacement native Promise core if(x instanceof $Promise && sameConstructor(x.constructor, this))return x; var capability = newPromiseCapability(this) , $$resolve = capability.resolve; $$resolve(x); return capability.promise; } }); $export($export.S + $export.F * !(USE_NATIVE && _dereq_(54)(function(iter){ $Promise.all(iter)['catch'](empty); })), PROMISE, { // 25.4.4.1 Promise.all(iterable) all: function all(iterable){ var C = this , capability = newPromiseCapability(C) , resolve = capability.resolve , reject = capability.reject; var abrupt = perform(function(){ var values = [] , index = 0 , remaining = 1; forOf(iterable, false, function(promise){ var $index = index++ , alreadyCalled = false; values.push(undefined); remaining++; C.resolve(promise).then(function(value){ if(alreadyCalled)return; alreadyCalled = true; values[$index] = value; --remaining || resolve(values); }, reject); }); --remaining || resolve(values); }); if(abrupt)reject(abrupt.error); return capability.promise; }, // 25.4.4.4 Promise.race(iterable) race: function race(iterable){ var C = this , capability = newPromiseCapability(C) , reject = capability.reject; var abrupt = perform(function(){ forOf(iterable, false, function(promise){ C.resolve(promise).then(capability.resolve, reject); }); }); if(abrupt)reject(abrupt.error); return capability.promise; } }); },{"104":104,"117":117,"17":17,"23":23,"25":25,"3":3,"32":32,"37":37,"38":38,"49":49,"54":54,"58":58,"6":6,"64":64,"86":86,"91":91,"92":92,"95":95}],199:[function(_dereq_,module,exports){ // 26.1.1 Reflect.apply(target, thisArgument, argumentsList) var $export = _dereq_(32) , aFunction = _dereq_(3) , anObject = _dereq_(7) , rApply = (_dereq_(38).Reflect || {}).apply , fApply = Function.apply; // MS Edge argumentsList argument is optional $export($export.S + $export.F * !_dereq_(34)(function(){ rApply(function(){}); }), 'Reflect', { apply: function apply(target, thisArgument, argumentsList){ var T = aFunction(target) , L = anObject(argumentsList); return rApply ? rApply(T, thisArgument, L) : fApply.call(T, thisArgument, L); } }); },{"3":3,"32":32,"34":34,"38":38,"7":7}],200:[function(_dereq_,module,exports){ // 26.1.2 Reflect.construct(target, argumentsList [, newTarget]) var $export = _dereq_(32) , create = _dereq_(66) , aFunction = _dereq_(3) , anObject = _dereq_(7) , isObject = _dereq_(49) , fails = _dereq_(34) , bind = _dereq_(16) , rConstruct = (_dereq_(38).Reflect || {}).construct; // MS Edge supports only 2 arguments and argumentsList argument is optional // FF Nightly sets third argument as `new.target`, but does not create `this` from it var NEW_TARGET_BUG = fails(function(){ function F(){} return !(rConstruct(function(){}, [], F) instanceof F); }); var ARGS_BUG = !fails(function(){ rConstruct(function(){}); }); $export($export.S + $export.F * (NEW_TARGET_BUG || ARGS_BUG), 'Reflect', { construct: function construct(Target, args /*, newTarget*/){ aFunction(Target); anObject(args); var newTarget = arguments.length < 3 ? Target : aFunction(arguments[2]); if(ARGS_BUG && !NEW_TARGET_BUG)return rConstruct(Target, args, newTarget); if(Target == newTarget){ // w/o altered newTarget, optimization for 0-4 arguments switch(args.length){ case 0: return new Target; case 1: return new Target(args[0]); case 2: return new Target(args[0], args[1]); case 3: return new Target(args[0], args[1], args[2]); case 4: return new Target(args[0], args[1], args[2], args[3]); } // w/o altered newTarget, lot of arguments case var $args = [null]; $args.push.apply($args, args); return new (bind.apply(Target, $args)); } // with altered newTarget, not support built-in constructors var proto = newTarget.prototype , instance = create(isObject(proto) ? proto : Object.prototype) , result = Function.apply.call(Target, instance, args); return isObject(result) ? result : instance; } }); },{"16":16,"3":3,"32":32,"34":34,"38":38,"49":49,"66":66,"7":7}],201:[function(_dereq_,module,exports){ // 26.1.3 Reflect.defineProperty(target, propertyKey, attributes) var dP = _dereq_(67) , $export = _dereq_(32) , anObject = _dereq_(7) , toPrimitive = _dereq_(110); // MS Edge has broken Reflect.defineProperty - throwing instead of returning false $export($export.S + $export.F * _dereq_(34)(function(){ Reflect.defineProperty(dP.f({}, 1, {value: 1}), 1, {value: 2}); }), 'Reflect', { defineProperty: function defineProperty(target, propertyKey, attributes){ anObject(target); propertyKey = toPrimitive(propertyKey, true); anObject(attributes); try { dP.f(target, propertyKey, attributes); return true; } catch(e){ return false; } } }); },{"110":110,"32":32,"34":34,"67":67,"7":7}],202:[function(_dereq_,module,exports){ // 26.1.4 Reflect.deleteProperty(target, propertyKey) var $export = _dereq_(32) , gOPD = _dereq_(70).f , anObject = _dereq_(7); $export($export.S, 'Reflect', { deleteProperty: function deleteProperty(target, propertyKey){ var desc = gOPD(anObject(target), propertyKey); return desc && !desc.configurable ? false : delete target[propertyKey]; } }); },{"32":32,"7":7,"70":70}],203:[function(_dereq_,module,exports){ 'use strict'; // 26.1.5 Reflect.enumerate(target) var $export = _dereq_(32) , anObject = _dereq_(7); var Enumerate = function(iterated){ this._t = anObject(iterated); // target this._i = 0; // next index var keys = this._k = [] // keys , key; for(key in iterated)keys.push(key); }; _dereq_(52)(Enumerate, 'Object', function(){ var that = this , keys = that._k , key; do { if(that._i >= keys.length)return {value: undefined, done: true}; } while(!((key = keys[that._i++]) in that._t)); return {value: key, done: false}; }); $export($export.S, 'Reflect', { enumerate: function enumerate(target){ return new Enumerate(target); } }); },{"32":32,"52":52,"7":7}],204:[function(_dereq_,module,exports){ // 26.1.7 Reflect.getOwnPropertyDescriptor(target, propertyKey) var gOPD = _dereq_(70) , $export = _dereq_(32) , anObject = _dereq_(7); $export($export.S, 'Reflect', { getOwnPropertyDescriptor: function getOwnPropertyDescriptor(target, propertyKey){ return gOPD.f(anObject(target), propertyKey); } }); },{"32":32,"7":7,"70":70}],205:[function(_dereq_,module,exports){ // 26.1.8 Reflect.getPrototypeOf(target) var $export = _dereq_(32) , getProto = _dereq_(74) , anObject = _dereq_(7); $export($export.S, 'Reflect', { getPrototypeOf: function getPrototypeOf(target){ return getProto(anObject(target)); } }); },{"32":32,"7":7,"74":74}],206:[function(_dereq_,module,exports){ // 26.1.6 Reflect.get(target, propertyKey [, receiver]) var gOPD = _dereq_(70) , getPrototypeOf = _dereq_(74) , has = _dereq_(39) , $export = _dereq_(32) , isObject = _dereq_(49) , anObject = _dereq_(7); function get(target, propertyKey/*, receiver*/){ var receiver = arguments.length < 3 ? target : arguments[2] , desc, proto; if(anObject(target) === receiver)return target[propertyKey]; if(desc = gOPD.f(target, propertyKey))return has(desc, 'value') ? desc.value : desc.get !== undefined ? desc.get.call(receiver) : undefined; if(isObject(proto = getPrototypeOf(target)))return get(proto, propertyKey, receiver); } $export($export.S, 'Reflect', {get: get}); },{"32":32,"39":39,"49":49,"7":7,"70":70,"74":74}],207:[function(_dereq_,module,exports){ // 26.1.9 Reflect.has(target, propertyKey) var $export = _dereq_(32); $export($export.S, 'Reflect', { has: function has(target, propertyKey){ return propertyKey in target; } }); },{"32":32}],208:[function(_dereq_,module,exports){ // 26.1.10 Reflect.isExtensible(target) var $export = _dereq_(32) , anObject = _dereq_(7) , $isExtensible = Object.isExtensible; $export($export.S, 'Reflect', { isExtensible: function isExtensible(target){ anObject(target); return $isExtensible ? $isExtensible(target) : true; } }); },{"32":32,"7":7}],209:[function(_dereq_,module,exports){ // 26.1.11 Reflect.ownKeys(target) var $export = _dereq_(32); $export($export.S, 'Reflect', {ownKeys: _dereq_(80)}); },{"32":32,"80":80}],210:[function(_dereq_,module,exports){ // 26.1.12 Reflect.preventExtensions(target) var $export = _dereq_(32) , anObject = _dereq_(7) , $preventExtensions = Object.preventExtensions; $export($export.S, 'Reflect', { preventExtensions: function preventExtensions(target){ anObject(target); try { if($preventExtensions)$preventExtensions(target); return true; } catch(e){ return false; } } }); },{"32":32,"7":7}],211:[function(_dereq_,module,exports){ // 26.1.14 Reflect.setPrototypeOf(target, proto) var $export = _dereq_(32) , setProto = _dereq_(90); if(setProto)$export($export.S, 'Reflect', { setPrototypeOf: function setPrototypeOf(target, proto){ setProto.check(target, proto); try { setProto.set(target, proto); return true; } catch(e){ return false; } } }); },{"32":32,"90":90}],212:[function(_dereq_,module,exports){ // 26.1.13 Reflect.set(target, propertyKey, V [, receiver]) var dP = _dereq_(67) , gOPD = _dereq_(70) , getPrototypeOf = _dereq_(74) , has = _dereq_(39) , $export = _dereq_(32) , createDesc = _dereq_(85) , anObject = _dereq_(7) , isObject = _dereq_(49); function set(target, propertyKey, V/*, receiver*/){ var receiver = arguments.length < 4 ? target : arguments[3] , ownDesc = gOPD.f(anObject(target), propertyKey) , existingDescriptor, proto; if(!ownDesc){ if(isObject(proto = getPrototypeOf(target))){ return set(proto, propertyKey, V, receiver); } ownDesc = createDesc(0); } if(has(ownDesc, 'value')){ if(ownDesc.writable === false || !isObject(receiver))return false; existingDescriptor = gOPD.f(receiver, propertyKey) || createDesc(0); existingDescriptor.value = V; dP.f(receiver, propertyKey, existingDescriptor); return true; } return ownDesc.set === undefined ? false : (ownDesc.set.call(receiver, V), true); } $export($export.S, 'Reflect', {set: set}); },{"32":32,"39":39,"49":49,"67":67,"7":7,"70":70,"74":74,"85":85}],213:[function(_dereq_,module,exports){ var global = _dereq_(38) , inheritIfRequired = _dereq_(43) , dP = _dereq_(67).f , gOPN = _dereq_(72).f , isRegExp = _dereq_(50) , $flags = _dereq_(36) , $RegExp = global.RegExp , Base = $RegExp , proto = $RegExp.prototype , re1 = /a/g , re2 = /a/g // "new" creates a new object, old webkit buggy here , CORRECT_NEW = new $RegExp(re1) !== re1; if(_dereq_(28) && (!CORRECT_NEW || _dereq_(34)(function(){ re2[_dereq_(117)('match')] = false; // RegExp constructor can alter flags and IsRegExp works correct with @@match return $RegExp(re1) != re1 || $RegExp(re2) == re2 || $RegExp(re1, 'i') != '/a/i'; }))){ $RegExp = function RegExp(p, f){ var tiRE = this instanceof $RegExp , piRE = isRegExp(p) , fiU = f === undefined; return !tiRE && piRE && p.constructor === $RegExp && fiU ? p : inheritIfRequired(CORRECT_NEW ? new Base(piRE && !fiU ? p.source : p, f) : Base((piRE = p instanceof $RegExp) ? p.source : p, piRE && fiU ? $flags.call(p) : f) , tiRE ? this : proto, $RegExp); }; var proxy = function(key){ key in $RegExp || dP($RegExp, key, { configurable: true, get: function(){ return Base[key]; }, set: function(it){ Base[key] = it; } }); }; for(var keys = gOPN(Base), i = 0; keys.length > i; )proxy(keys[i++]); proto.constructor = $RegExp; $RegExp.prototype = proto; _dereq_(87)(global, 'RegExp', $RegExp); } _dereq_(91)('RegExp'); },{"117":117,"28":28,"34":34,"36":36,"38":38,"43":43,"50":50,"67":67,"72":72,"87":87,"91":91}],214:[function(_dereq_,module,exports){ // 21.2.5.3 get RegExp.prototype.flags() if(_dereq_(28) && /./g.flags != 'g')_dereq_(67).f(RegExp.prototype, 'flags', { configurable: true, get: _dereq_(36) }); },{"28":28,"36":36,"67":67}],215:[function(_dereq_,module,exports){ // @@match logic _dereq_(35)('match', 1, function(defined, MATCH, $match){ // 21.1.3.11 String.prototype.match(regexp) return [function match(regexp){ 'use strict'; var O = defined(this) , fn = regexp == undefined ? undefined : regexp[MATCH]; return fn !== undefined ? fn.call(regexp, O) : new RegExp(regexp)[MATCH](String(O)); }, $match]; }); },{"35":35}],216:[function(_dereq_,module,exports){ // @@replace logic _dereq_(35)('replace', 2, function(defined, REPLACE, $replace){ // 21.1.3.14 String.prototype.replace(searchValue, replaceValue) return [function replace(searchValue, replaceValue){ 'use strict'; var O = defined(this) , fn = searchValue == undefined ? undefined : searchValue[REPLACE]; return fn !== undefined ? fn.call(searchValue, O, replaceValue) : $replace.call(String(O), searchValue, replaceValue); }, $replace]; }); },{"35":35}],217:[function(_dereq_,module,exports){ // @@search logic _dereq_(35)('search', 1, function(defined, SEARCH, $search){ // 21.1.3.15 String.prototype.search(regexp) return [function search(regexp){ 'use strict'; var O = defined(this) , fn = regexp == undefined ? undefined : regexp[SEARCH]; return fn !== undefined ? fn.call(regexp, O) : new RegExp(regexp)[SEARCH](String(O)); }, $search]; }); },{"35":35}],218:[function(_dereq_,module,exports){ // @@split logic _dereq_(35)('split', 2, function(defined, SPLIT, $split){ 'use strict'; var isRegExp = _dereq_(50) , _split = $split , $push = [].push , $SPLIT = 'split' , LENGTH = 'length' , LAST_INDEX = 'lastIndex'; if( 'abbc'[$SPLIT](/(b)*/)[1] == 'c' || 'test'[$SPLIT](/(?:)/, -1)[LENGTH] != 4 || 'ab'[$SPLIT](/(?:ab)*/)[LENGTH] != 2 || '.'[$SPLIT](/(.?)(.?)/)[LENGTH] != 4 || '.'[$SPLIT](/()()/)[LENGTH] > 1 || ''[$SPLIT](/.?/)[LENGTH] ){ var NPCG = /()??/.exec('')[1] === undefined; // nonparticipating capturing group // based on es5-shim implementation, need to rework it $split = function(separator, limit){ var string = String(this); if(separator === undefined && limit === 0)return []; // If `separator` is not a regex, use native split if(!isRegExp(separator))return _split.call(string, separator, limit); var output = []; var flags = (separator.ignoreCase ? 'i' : '') + (separator.multiline ? 'm' : '') + (separator.unicode ? 'u' : '') + (separator.sticky ? 'y' : ''); var lastLastIndex = 0; var splitLimit = limit === undefined ? 4294967295 : limit >>> 0; // Make `global` and avoid `lastIndex` issues by working with a copy var separatorCopy = new RegExp(separator.source, flags + 'g'); var separator2, match, lastIndex, lastLength, i; // Doesn't need flags gy, but they don't hurt if(!NPCG)separator2 = new RegExp('^' + separatorCopy.source + '$(?!\\s)', flags); while(match = separatorCopy.exec(string)){ // `separatorCopy.lastIndex` is not reliable cross-browser lastIndex = match.index + match[0][LENGTH]; if(lastIndex > lastLastIndex){ output.push(string.slice(lastLastIndex, match.index)); // Fix browsers whose `exec` methods don't consistently return `undefined` for NPCG if(!NPCG && match[LENGTH] > 1)match[0].replace(separator2, function(){ for(i = 1; i < arguments[LENGTH] - 2; i++)if(arguments[i] === undefined)match[i] = undefined; }); if(match[LENGTH] > 1 && match.index < string[LENGTH])$push.apply(output, match.slice(1)); lastLength = match[0][LENGTH]; lastLastIndex = lastIndex; if(output[LENGTH] >= splitLimit)break; } if(separatorCopy[LAST_INDEX] === match.index)separatorCopy[LAST_INDEX]++; // Avoid an infinite loop } if(lastLastIndex === string[LENGTH]){ if(lastLength || !separatorCopy.test(''))output.push(''); } else output.push(string.slice(lastLastIndex)); return output[LENGTH] > splitLimit ? output.slice(0, splitLimit) : output; }; // Chakra, V8 } else if('0'[$SPLIT](undefined, 0)[LENGTH]){ $split = function(separator, limit){ return separator === undefined && limit === 0 ? [] : _split.call(this, separator, limit); }; } // 21.1.3.17 String.prototype.split(separator, limit) return [function split(separator, limit){ var O = defined(this) , fn = separator == undefined ? undefined : separator[SPLIT]; return fn !== undefined ? fn.call(separator, O, limit) : $split.call(String(O), separator, limit); }, $split]; }); },{"35":35,"50":50}],219:[function(_dereq_,module,exports){ 'use strict'; _dereq_(214); var anObject = _dereq_(7) , $flags = _dereq_(36) , DESCRIPTORS = _dereq_(28) , TO_STRING = 'toString' , $toString = /./[TO_STRING]; var define = function(fn){ _dereq_(87)(RegExp.prototype, TO_STRING, fn, true); }; // 21.2.5.14 RegExp.prototype.toString() if(_dereq_(34)(function(){ return $toString.call({source: 'a', flags: 'b'}) != '/a/b'; })){ define(function toString(){ var R = anObject(this); return '/'.concat(R.source, '/', 'flags' in R ? R.flags : !DESCRIPTORS && R instanceof RegExp ? $flags.call(R) : undefined); }); // FF44- RegExp#toString has a wrong name } else if($toString.name != TO_STRING){ define(function toString(){ return $toString.call(this); }); } },{"214":214,"28":28,"34":34,"36":36,"7":7,"87":87}],220:[function(_dereq_,module,exports){ 'use strict'; var strong = _dereq_(19); // 23.2 Set Objects module.exports = _dereq_(22)('Set', function(get){ return function Set(){ return get(this, arguments.length > 0 ? arguments[0] : undefined); }; }, { // 23.2.3.1 Set.prototype.add(value) add: function add(value){ return strong.def(this, value = value === 0 ? 0 : value, value); } }, strong); },{"19":19,"22":22}],221:[function(_dereq_,module,exports){ 'use strict'; // B.2.3.2 String.prototype.anchor(name) _dereq_(99)('anchor', function(createHTML){ return function anchor(name){ return createHTML(this, 'a', 'name', name); } }); },{"99":99}],222:[function(_dereq_,module,exports){ 'use strict'; // B.2.3.3 String.prototype.big() _dereq_(99)('big', function(createHTML){ return function big(){ return createHTML(this, 'big', '', ''); } }); },{"99":99}],223:[function(_dereq_,module,exports){ 'use strict'; // B.2.3.4 String.prototype.blink() _dereq_(99)('blink', function(createHTML){ return function blink(){ return createHTML(this, 'blink', '', ''); } }); },{"99":99}],224:[function(_dereq_,module,exports){ 'use strict'; // B.2.3.5 String.prototype.bold() _dereq_(99)('bold', function(createHTML){ return function bold(){ return createHTML(this, 'b', '', ''); } }); },{"99":99}],225:[function(_dereq_,module,exports){ 'use strict'; var $export = _dereq_(32) , $at = _dereq_(97)(false); $export($export.P, 'String', { // 21.1.3.3 String.prototype.codePointAt(pos) codePointAt: function codePointAt(pos){ return $at(this, pos); } }); },{"32":32,"97":97}],226:[function(_dereq_,module,exports){ // 21.1.3.6 String.prototype.endsWith(searchString [, endPosition]) 'use strict'; var $export = _dereq_(32) , toLength = _dereq_(108) , context = _dereq_(98) , ENDS_WITH = 'endsWith' , $endsWith = ''[ENDS_WITH]; $export($export.P + $export.F * _dereq_(33)(ENDS_WITH), 'String', { endsWith: function endsWith(searchString /*, endPosition = @length */){ var that = context(this, searchString, ENDS_WITH) , endPosition = arguments.length > 1 ? arguments[1] : undefined , len = toLength(that.length) , end = endPosition === undefined ? len : Math.min(toLength(endPosition), len) , search = String(searchString); return $endsWith ? $endsWith.call(that, search, end) : that.slice(end - search.length, end) === search; } }); },{"108":108,"32":32,"33":33,"98":98}],227:[function(_dereq_,module,exports){ 'use strict'; // B.2.3.6 String.prototype.fixed() _dereq_(99)('fixed', function(createHTML){ return function fixed(){ return createHTML(this, 'tt', '', ''); } }); },{"99":99}],228:[function(_dereq_,module,exports){ 'use strict'; // B.2.3.7 String.prototype.fontcolor(color) _dereq_(99)('fontcolor', function(createHTML){ return function fontcolor(color){ return createHTML(this, 'font', 'color', color); } }); },{"99":99}],229:[function(_dereq_,module,exports){ 'use strict'; // B.2.3.8 String.prototype.fontsize(size) _dereq_(99)('fontsize', function(createHTML){ return function fontsize(size){ return createHTML(this, 'font', 'size', size); } }); },{"99":99}],230:[function(_dereq_,module,exports){ var $export = _dereq_(32) , toIndex = _dereq_(105) , fromCharCode = String.fromCharCode , $fromCodePoint = String.fromCodePoint; // length should be 1, old FF problem $export($export.S + $export.F * (!!$fromCodePoint && $fromCodePoint.length != 1), 'String', { // 21.1.2.2 String.fromCodePoint(...codePoints) fromCodePoint: function fromCodePoint(x){ // eslint-disable-line no-unused-vars var res = [] , aLen = arguments.length , i = 0 , code; while(aLen > i){ code = +arguments[i++]; if(toIndex(code, 0x10ffff) !== code)throw RangeError(code + ' is not a valid code point'); res.push(code < 0x10000 ? fromCharCode(code) : fromCharCode(((code -= 0x10000) >> 10) + 0xd800, code % 0x400 + 0xdc00) ); } return res.join(''); } }); },{"105":105,"32":32}],231:[function(_dereq_,module,exports){ // 21.1.3.7 String.prototype.includes(searchString, position = 0) 'use strict'; var $export = _dereq_(32) , context = _dereq_(98) , INCLUDES = 'includes'; $export($export.P + $export.F * _dereq_(33)(INCLUDES), 'String', { includes: function includes(searchString /*, position = 0 */){ return !!~context(this, searchString, INCLUDES) .indexOf(searchString, arguments.length > 1 ? arguments[1] : undefined); } }); },{"32":32,"33":33,"98":98}],232:[function(_dereq_,module,exports){ 'use strict'; // B.2.3.9 String.prototype.italics() _dereq_(99)('italics', function(createHTML){ return function italics(){ return createHTML(this, 'i', '', ''); } }); },{"99":99}],233:[function(_dereq_,module,exports){ 'use strict'; var $at = _dereq_(97)(true); // 21.1.3.27 String.prototype[@@iterator]() _dereq_(53)(String, 'String', function(iterated){ this._t = String(iterated); // target this._i = 0; // next index // 21.1.5.2.1 %StringIteratorPrototype%.next() }, function(){ var O = this._t , index = this._i , point; if(index >= O.length)return {value: undefined, done: true}; point = $at(O, index); this._i += point.length; return {value: point, done: false}; }); },{"53":53,"97":97}],234:[function(_dereq_,module,exports){ 'use strict'; // B.2.3.10 String.prototype.link(url) _dereq_(99)('link', function(createHTML){ return function link(url){ return createHTML(this, 'a', 'href', url); } }); },{"99":99}],235:[function(_dereq_,module,exports){ var $export = _dereq_(32) , toIObject = _dereq_(107) , toLength = _dereq_(108); $export($export.S, 'String', { // 21.1.2.4 String.raw(callSite, ...substitutions) raw: function raw(callSite){ var tpl = toIObject(callSite.raw) , len = toLength(tpl.length) , aLen = arguments.length , res = [] , i = 0; while(len > i){ res.push(String(tpl[i++])); if(i < aLen)res.push(String(arguments[i])); } return res.join(''); } }); },{"107":107,"108":108,"32":32}],236:[function(_dereq_,module,exports){ var $export = _dereq_(32); $export($export.P, 'String', { // 21.1.3.13 String.prototype.repeat(count) repeat: _dereq_(101) }); },{"101":101,"32":32}],237:[function(_dereq_,module,exports){ 'use strict'; // B.2.3.11 String.prototype.small() _dereq_(99)('small', function(createHTML){ return function small(){ return createHTML(this, 'small', '', ''); } }); },{"99":99}],238:[function(_dereq_,module,exports){ // 21.1.3.18 String.prototype.startsWith(searchString [, position ]) 'use strict'; var $export = _dereq_(32) , toLength = _dereq_(108) , context = _dereq_(98) , STARTS_WITH = 'startsWith' , $startsWith = ''[STARTS_WITH]; $export($export.P + $export.F * _dereq_(33)(STARTS_WITH), 'String', { startsWith: function startsWith(searchString /*, position = 0 */){ var that = context(this, searchString, STARTS_WITH) , index = toLength(Math.min(arguments.length > 1 ? arguments[1] : undefined, that.length)) , search = String(searchString); return $startsWith ? $startsWith.call(that, search, index) : that.slice(index, index + search.length) === search; } }); },{"108":108,"32":32,"33":33,"98":98}],239:[function(_dereq_,module,exports){ 'use strict'; // B.2.3.12 String.prototype.strike() _dereq_(99)('strike', function(createHTML){ return function strike(){ return createHTML(this, 'strike', '', ''); } }); },{"99":99}],240:[function(_dereq_,module,exports){ 'use strict'; // B.2.3.13 String.prototype.sub() _dereq_(99)('sub', function(createHTML){ return function sub(){ return createHTML(this, 'sub', '', ''); } }); },{"99":99}],241:[function(_dereq_,module,exports){ 'use strict'; // B.2.3.14 String.prototype.sup() _dereq_(99)('sup', function(createHTML){ return function sup(){ return createHTML(this, 'sup', '', ''); } }); },{"99":99}],242:[function(_dereq_,module,exports){ 'use strict'; // 21.1.3.25 String.prototype.trim() _dereq_(102)('trim', function($trim){ return function trim(){ return $trim(this, 3); }; }); },{"102":102}],243:[function(_dereq_,module,exports){ 'use strict'; // ECMAScript 6 symbols shim var global = _dereq_(38) , has = _dereq_(39) , DESCRIPTORS = _dereq_(28) , $export = _dereq_(32) , redefine = _dereq_(87) , META = _dereq_(62).KEY , $fails = _dereq_(34) , shared = _dereq_(94) , setToStringTag = _dereq_(92) , uid = _dereq_(114) , wks = _dereq_(117) , wksExt = _dereq_(116) , wksDefine = _dereq_(115) , keyOf = _dereq_(57) , enumKeys = _dereq_(31) , isArray = _dereq_(47) , anObject = _dereq_(7) , toIObject = _dereq_(107) , toPrimitive = _dereq_(110) , createDesc = _dereq_(85) , _create = _dereq_(66) , gOPNExt = _dereq_(71) , $GOPD = _dereq_(70) , $DP = _dereq_(67) , $keys = _dereq_(76) , gOPD = $GOPD.f , dP = $DP.f , gOPN = gOPNExt.f , $Symbol = global.Symbol , $JSON = global.JSON , _stringify = $JSON && $JSON.stringify , PROTOTYPE = 'prototype' , HIDDEN = wks('_hidden') , TO_PRIMITIVE = wks('toPrimitive') , isEnum = {}.propertyIsEnumerable , SymbolRegistry = shared('symbol-registry') , AllSymbols = shared('symbols') , OPSymbols = shared('op-symbols') , ObjectProto = Object[PROTOTYPE] , USE_NATIVE = typeof $Symbol == 'function' , QObject = global.QObject; // Don't use setters in Qt Script, https://github.com/zloirock/core-js/issues/173 var setter = !QObject || !QObject[PROTOTYPE] || !QObject[PROTOTYPE].findChild; // fallback for old Android, https://code.google.com/p/v8/issues/detail?id=687 var setSymbolDesc = DESCRIPTORS && $fails(function(){ return _create(dP({}, 'a', { get: function(){ return dP(this, 'a', {value: 7}).a; } })).a != 7; }) ? function(it, key, D){ var protoDesc = gOPD(ObjectProto, key); if(protoDesc)delete ObjectProto[key]; dP(it, key, D); if(protoDesc && it !== ObjectProto)dP(ObjectProto, key, protoDesc); } : dP; var wrap = function(tag){ var sym = AllSymbols[tag] = _create($Symbol[PROTOTYPE]); sym._k = tag; return sym; }; var isSymbol = USE_NATIVE && typeof $Symbol.iterator == 'symbol' ? function(it){ return typeof it == 'symbol'; } : function(it){ return it instanceof $Symbol; }; var $defineProperty = function defineProperty(it, key, D){ if(it === ObjectProto)$defineProperty(OPSymbols, key, D); anObject(it); key = toPrimitive(key, true); anObject(D); if(has(AllSymbols, key)){ if(!D.enumerable){ if(!has(it, HIDDEN))dP(it, HIDDEN, createDesc(1, {})); it[HIDDEN][key] = true; } else { if(has(it, HIDDEN) && it[HIDDEN][key])it[HIDDEN][key] = false; D = _create(D, {enumerable: createDesc(0, false)}); } return setSymbolDesc(it, key, D); } return dP(it, key, D); }; var $defineProperties = function defineProperties(it, P){ anObject(it); var keys = enumKeys(P = toIObject(P)) , i = 0 , l = keys.length , key; while(l > i)$defineProperty(it, key = keys[i++], P[key]); return it; }; var $create = function create(it, P){ return P === undefined ? _create(it) : $defineProperties(_create(it), P); }; var $propertyIsEnumerable = function propertyIsEnumerable(key){ var E = isEnum.call(this, key = toPrimitive(key, true)); if(this === ObjectProto && has(AllSymbols, key) && !has(OPSymbols, key))return false; return E || !has(this, key) || !has(AllSymbols, key) || has(this, HIDDEN) && this[HIDDEN][key] ? E : true; }; var $getOwnPropertyDescriptor = function getOwnPropertyDescriptor(it, key){ it = toIObject(it); key = toPrimitive(key, true); if(it === ObjectProto && has(AllSymbols, key) && !has(OPSymbols, key))return; var D = gOPD(it, key); if(D && has(AllSymbols, key) && !(has(it, HIDDEN) && it[HIDDEN][key]))D.enumerable = true; return D; }; var $getOwnPropertyNames = function getOwnPropertyNames(it){ var names = gOPN(toIObject(it)) , result = [] , i = 0 , key; while(names.length > i){ if(!has(AllSymbols, key = names[i++]) && key != HIDDEN && key != META)result.push(key); } return result; }; var $getOwnPropertySymbols = function getOwnPropertySymbols(it){ var IS_OP = it === ObjectProto , names = gOPN(IS_OP ? OPSymbols : toIObject(it)) , result = [] , i = 0 , key; while(names.length > i){ if(has(AllSymbols, key = names[i++]) && (IS_OP ? has(ObjectProto, key) : true))result.push(AllSymbols[key]); } return result; }; // 19.4.1.1 Symbol([description]) if(!USE_NATIVE){ $Symbol = function Symbol(){ if(this instanceof $Symbol)throw TypeError('Symbol is not a constructor!'); var tag = uid(arguments.length > 0 ? arguments[0] : undefined); var $set = function(value){ if(this === ObjectProto)$set.call(OPSymbols, value); if(has(this, HIDDEN) && has(this[HIDDEN], tag))this[HIDDEN][tag] = false; setSymbolDesc(this, tag, createDesc(1, value)); }; if(DESCRIPTORS && setter)setSymbolDesc(ObjectProto, tag, {configurable: true, set: $set}); return wrap(tag); }; redefine($Symbol[PROTOTYPE], 'toString', function toString(){ return this._k; }); $GOPD.f = $getOwnPropertyDescriptor; $DP.f = $defineProperty; _dereq_(72).f = gOPNExt.f = $getOwnPropertyNames; _dereq_(77).f = $propertyIsEnumerable; _dereq_(73).f = $getOwnPropertySymbols; if(DESCRIPTORS && !_dereq_(58)){ redefine(ObjectProto, 'propertyIsEnumerable', $propertyIsEnumerable, true); } wksExt.f = function(name){ return wrap(wks(name)); } } $export($export.G + $export.W + $export.F * !USE_NATIVE, {Symbol: $Symbol}); for(var symbols = ( // 19.4.2.2, 19.4.2.3, 19.4.2.4, 19.4.2.6, 19.4.2.8, 19.4.2.9, 19.4.2.10, 19.4.2.11, 19.4.2.12, 19.4.2.13, 19.4.2.14 'hasInstance,isConcatSpreadable,iterator,match,replace,search,species,split,toPrimitive,toStringTag,unscopables' ).split(','), i = 0; symbols.length > i; )wks(symbols[i++]); for(var symbols = $keys(wks.store), i = 0; symbols.length > i; )wksDefine(symbols[i++]); $export($export.S + $export.F * !USE_NATIVE, 'Symbol', { // 19.4.2.1 Symbol.for(key) 'for': function(key){ return has(SymbolRegistry, key += '') ? SymbolRegistry[key] : SymbolRegistry[key] = $Symbol(key); }, // 19.4.2.5 Symbol.keyFor(sym) keyFor: function keyFor(key){ if(isSymbol(key))return keyOf(SymbolRegistry, key); throw TypeError(key + ' is not a symbol!'); }, useSetter: function(){ setter = true; }, useSimple: function(){ setter = false; } }); $export($export.S + $export.F * !USE_NATIVE, 'Object', { // 19.1.2.2 Object.create(O [, Properties]) create: $create, // 19.1.2.4 Object.defineProperty(O, P, Attributes) defineProperty: $defineProperty, // 19.1.2.3 Object.defineProperties(O, Properties) defineProperties: $defineProperties, // 19.1.2.6 Object.getOwnPropertyDescriptor(O, P) getOwnPropertyDescriptor: $getOwnPropertyDescriptor, // 19.1.2.7 Object.getOwnPropertyNames(O) getOwnPropertyNames: $getOwnPropertyNames, // 19.1.2.8 Object.getOwnPropertySymbols(O) getOwnPropertySymbols: $getOwnPropertySymbols }); // 24.3.2 JSON.stringify(value [, replacer [, space]]) $JSON && $export($export.S + $export.F * (!USE_NATIVE || $fails(function(){ var S = $Symbol(); // MS Edge converts symbol values to JSON as {} // WebKit converts symbol values to JSON as null // V8 throws on boxed symbols return _stringify([S]) != '[null]' || _stringify({a: S}) != '{}' || _stringify(Object(S)) != '{}'; })), 'JSON', { stringify: function stringify(it){ if(it === undefined || isSymbol(it))return; // IE8 returns string on undefined var args = [it] , i = 1 , replacer, $replacer; while(arguments.length > i)args.push(arguments[i++]); replacer = args[1]; if(typeof replacer == 'function')$replacer = replacer; if($replacer || !isArray(replacer))replacer = function(key, value){ if($replacer)value = $replacer.call(this, key, value); if(!isSymbol(value))return value; }; args[1] = replacer; return _stringify.apply($JSON, args); } }); // 19.4.3.4 Symbol.prototype[@@toPrimitive](hint) $Symbol[PROTOTYPE][TO_PRIMITIVE] || _dereq_(40)($Symbol[PROTOTYPE], TO_PRIMITIVE, $Symbol[PROTOTYPE].valueOf); // 19.4.3.5 Symbol.prototype[@@toStringTag] setToStringTag($Symbol, 'Symbol'); // 20.2.1.9 Math[@@toStringTag] setToStringTag(Math, 'Math', true); // 24.3.3 JSON[@@toStringTag] setToStringTag(global.JSON, 'JSON', true); },{"107":107,"110":110,"114":114,"115":115,"116":116,"117":117,"28":28,"31":31,"32":32,"34":34,"38":38,"39":39,"40":40,"47":47,"57":57,"58":58,"62":62,"66":66,"67":67,"7":7,"70":70,"71":71,"72":72,"73":73,"76":76,"77":77,"85":85,"87":87,"92":92,"94":94}],244:[function(_dereq_,module,exports){ 'use strict'; var $export = _dereq_(32) , $typed = _dereq_(113) , buffer = _dereq_(112) , anObject = _dereq_(7) , toIndex = _dereq_(105) , toLength = _dereq_(108) , isObject = _dereq_(49) , ArrayBuffer = _dereq_(38).ArrayBuffer , speciesConstructor = _dereq_(95) , $ArrayBuffer = buffer.ArrayBuffer , $DataView = buffer.DataView , $isView = $typed.ABV && ArrayBuffer.isView , $slice = $ArrayBuffer.prototype.slice , VIEW = $typed.VIEW , ARRAY_BUFFER = 'ArrayBuffer'; $export($export.G + $export.W + $export.F * (ArrayBuffer !== $ArrayBuffer), {ArrayBuffer: $ArrayBuffer}); $export($export.S + $export.F * !$typed.CONSTR, ARRAY_BUFFER, { // 24.1.3.1 ArrayBuffer.isView(arg) isView: function isView(it){ return $isView && $isView(it) || isObject(it) && VIEW in it; } }); $export($export.P + $export.U + $export.F * _dereq_(34)(function(){ return !new $ArrayBuffer(2).slice(1, undefined).byteLength; }), ARRAY_BUFFER, { // 24.1.4.3 ArrayBuffer.prototype.slice(start, end) slice: function slice(start, end){ if($slice !== undefined && end === undefined)return $slice.call(anObject(this), start); // FF fix var len = anObject(this).byteLength , first = toIndex(start, len) , final = toIndex(end === undefined ? len : end, len) , result = new (speciesConstructor(this, $ArrayBuffer))(toLength(final - first)) , viewS = new $DataView(this) , viewT = new $DataView(result) , index = 0; while(first < final){ viewT.setUint8(index++, viewS.getUint8(first++)); } return result; } }); _dereq_(91)(ARRAY_BUFFER); },{"105":105,"108":108,"112":112,"113":113,"32":32,"34":34,"38":38,"49":49,"7":7,"91":91,"95":95}],245:[function(_dereq_,module,exports){ var $export = _dereq_(32); $export($export.G + $export.W + $export.F * !_dereq_(113).ABV, { DataView: _dereq_(112).DataView }); },{"112":112,"113":113,"32":32}],246:[function(_dereq_,module,exports){ _dereq_(111)('Float32', 4, function(init){ return function Float32Array(data, byteOffset, length){ return init(this, data, byteOffset, length); }; }); },{"111":111}],247:[function(_dereq_,module,exports){ _dereq_(111)('Float64', 8, function(init){ return function Float64Array(data, byteOffset, length){ return init(this, data, byteOffset, length); }; }); },{"111":111}],248:[function(_dereq_,module,exports){ _dereq_(111)('Int16', 2, function(init){ return function Int16Array(data, byteOffset, length){ return init(this, data, byteOffset, length); }; }); },{"111":111}],249:[function(_dereq_,module,exports){ _dereq_(111)('Int32', 4, function(init){ return function Int32Array(data, byteOffset, length){ return init(this, data, byteOffset, length); }; }); },{"111":111}],250:[function(_dereq_,module,exports){ _dereq_(111)('Int8', 1, function(init){ return function Int8Array(data, byteOffset, length){ return init(this, data, byteOffset, length); }; }); },{"111":111}],251:[function(_dereq_,module,exports){ _dereq_(111)('Uint16', 2, function(init){ return function Uint16Array(data, byteOffset, length){ return init(this, data, byteOffset, length); }; }); },{"111":111}],252:[function(_dereq_,module,exports){ _dereq_(111)('Uint32', 4, function(init){ return function Uint32Array(data, byteOffset, length){ return init(this, data, byteOffset, length); }; }); },{"111":111}],253:[function(_dereq_,module,exports){ _dereq_(111)('Uint8', 1, function(init){ return function Uint8Array(data, byteOffset, length){ return init(this, data, byteOffset, length); }; }); },{"111":111}],254:[function(_dereq_,module,exports){ _dereq_(111)('Uint8', 1, function(init){ return function Uint8ClampedArray(data, byteOffset, length){ return init(this, data, byteOffset, length); }; }, true); },{"111":111}],255:[function(_dereq_,module,exports){ 'use strict'; var each = _dereq_(12)(0) , redefine = _dereq_(87) , meta = _dereq_(62) , assign = _dereq_(65) , weak = _dereq_(21) , isObject = _dereq_(49) , getWeak = meta.getWeak , isExtensible = Object.isExtensible , uncaughtFrozenStore = weak.ufstore , tmp = {} , InternalMap; var wrapper = function(get){ return function WeakMap(){ return get(this, arguments.length > 0 ? arguments[0] : undefined); }; }; var methods = { // 23.3.3.3 WeakMap.prototype.get(key) get: function get(key){ if(isObject(key)){ var data = getWeak(key); if(data === true)return uncaughtFrozenStore(this).get(key); return data ? data[this._i] : undefined; } }, // 23.3.3.5 WeakMap.prototype.set(key, value) set: function set(key, value){ return weak.def(this, key, value); } }; // 23.3 WeakMap Objects var $WeakMap = module.exports = _dereq_(22)('WeakMap', wrapper, methods, weak, true, true); // IE11 WeakMap frozen keys fix if(new $WeakMap().set((Object.freeze || Object)(tmp), 7).get(tmp) != 7){ InternalMap = weak.getConstructor(wrapper); assign(InternalMap.prototype, methods); meta.NEED = true; each(['delete', 'has', 'get', 'set'], function(key){ var proto = $WeakMap.prototype , method = proto[key]; redefine(proto, key, function(a, b){ // store frozen objects on internal weakmap shim if(isObject(a) && !isExtensible(a)){ if(!this._f)this._f = new InternalMap; var result = this._f[key](a, b); return key == 'set' ? this : result; // store all the rest on native weakmap } return method.call(this, a, b); }); }); } },{"12":12,"21":21,"22":22,"49":49,"62":62,"65":65,"87":87}],256:[function(_dereq_,module,exports){ 'use strict'; var weak = _dereq_(21); // 23.4 WeakSet Objects _dereq_(22)('WeakSet', function(get){ return function WeakSet(){ return get(this, arguments.length > 0 ? arguments[0] : undefined); }; }, { // 23.4.3.1 WeakSet.prototype.add(value) add: function add(value){ return weak.def(this, value, true); } }, weak, false, true); },{"21":21,"22":22}],257:[function(_dereq_,module,exports){ 'use strict'; // https://github.com/tc39/Array.prototype.includes var $export = _dereq_(32) , $includes = _dereq_(11)(true); $export($export.P, 'Array', { includes: function includes(el /*, fromIndex = 0 */){ return $includes(this, el, arguments.length > 1 ? arguments[1] : undefined); } }); _dereq_(5)('includes'); },{"11":11,"32":32,"5":5}],258:[function(_dereq_,module,exports){ // https://github.com/rwaldron/tc39-notes/blob/master/es6/2014-09/sept-25.md#510-globalasap-for-enqueuing-a-microtask var $export = _dereq_(32) , microtask = _dereq_(64)() , process = _dereq_(38).process , isNode = _dereq_(18)(process) == 'process'; $export($export.G, { asap: function asap(fn){ var domain = isNode && process.domain; microtask(domain ? domain.bind(fn) : fn); } }); },{"18":18,"32":32,"38":38,"64":64}],259:[function(_dereq_,module,exports){ // https://github.com/ljharb/proposal-is-error var $export = _dereq_(32) , cof = _dereq_(18); $export($export.S, 'Error', { isError: function isError(it){ return cof(it) === 'Error'; } }); },{"18":18,"32":32}],260:[function(_dereq_,module,exports){ // https://github.com/DavidBruant/Map-Set.prototype.toJSON var $export = _dereq_(32); $export($export.P + $export.R, 'Map', {toJSON: _dereq_(20)('Map')}); },{"20":20,"32":32}],261:[function(_dereq_,module,exports){ // https://gist.github.com/BrendanEich/4294d5c212a6d2254703 var $export = _dereq_(32); $export($export.S, 'Math', { iaddh: function iaddh(x0, x1, y0, y1){ var $x0 = x0 >>> 0 , $x1 = x1 >>> 0 , $y0 = y0 >>> 0; return $x1 + (y1 >>> 0) + (($x0 & $y0 | ($x0 | $y0) & ~($x0 + $y0 >>> 0)) >>> 31) | 0; } }); },{"32":32}],262:[function(_dereq_,module,exports){ // https://gist.github.com/BrendanEich/4294d5c212a6d2254703 var $export = _dereq_(32); $export($export.S, 'Math', { imulh: function imulh(u, v){ var UINT16 = 0xffff , $u = +u , $v = +v , u0 = $u & UINT16 , v0 = $v & UINT16 , u1 = $u >> 16 , v1 = $v >> 16 , t = (u1 * v0 >>> 0) + (u0 * v0 >>> 16); return u1 * v1 + (t >> 16) + ((u0 * v1 >>> 0) + (t & UINT16) >> 16); } }); },{"32":32}],263:[function(_dereq_,module,exports){ // https://gist.github.com/BrendanEich/4294d5c212a6d2254703 var $export = _dereq_(32); $export($export.S, 'Math', { isubh: function isubh(x0, x1, y0, y1){ var $x0 = x0 >>> 0 , $x1 = x1 >>> 0 , $y0 = y0 >>> 0; return $x1 - (y1 >>> 0) - ((~$x0 & $y0 | ~($x0 ^ $y0) & $x0 - $y0 >>> 0) >>> 31) | 0; } }); },{"32":32}],264:[function(_dereq_,module,exports){ // https://gist.github.com/BrendanEich/4294d5c212a6d2254703 var $export = _dereq_(32); $export($export.S, 'Math', { umulh: function umulh(u, v){ var UINT16 = 0xffff , $u = +u , $v = +v , u0 = $u & UINT16 , v0 = $v & UINT16 , u1 = $u >>> 16 , v1 = $v >>> 16 , t = (u1 * v0 >>> 0) + (u0 * v0 >>> 16); return u1 * v1 + (t >>> 16) + ((u0 * v1 >>> 0) + (t & UINT16) >>> 16); } }); },{"32":32}],265:[function(_dereq_,module,exports){ 'use strict'; var $export = _dereq_(32) , toObject = _dereq_(109) , aFunction = _dereq_(3) , $defineProperty = _dereq_(67); // B.2.2.2 Object.prototype.__defineGetter__(P, getter) _dereq_(28) && $export($export.P + _dereq_(69), 'Object', { __defineGetter__: function __defineGetter__(P, getter){ $defineProperty.f(toObject(this), P, {get: aFunction(getter), enumerable: true, configurable: true}); } }); },{"109":109,"28":28,"3":3,"32":32,"67":67,"69":69}],266:[function(_dereq_,module,exports){ 'use strict'; var $export = _dereq_(32) , toObject = _dereq_(109) , aFunction = _dereq_(3) , $defineProperty = _dereq_(67); // B.2.2.3 Object.prototype.__defineSetter__(P, setter) _dereq_(28) && $export($export.P + _dereq_(69), 'Object', { __defineSetter__: function __defineSetter__(P, setter){ $defineProperty.f(toObject(this), P, {set: aFunction(setter), enumerable: true, configurable: true}); } }); },{"109":109,"28":28,"3":3,"32":32,"67":67,"69":69}],267:[function(_dereq_,module,exports){ // https://github.com/tc39/proposal-object-values-entries var $export = _dereq_(32) , $entries = _dereq_(79)(true); $export($export.S, 'Object', { entries: function entries(it){ return $entries(it); } }); },{"32":32,"79":79}],268:[function(_dereq_,module,exports){ // https://github.com/tc39/proposal-object-getownpropertydescriptors var $export = _dereq_(32) , ownKeys = _dereq_(80) , toIObject = _dereq_(107) , gOPD = _dereq_(70) , createProperty = _dereq_(24); $export($export.S, 'Object', { getOwnPropertyDescriptors: function getOwnPropertyDescriptors(object){ var O = toIObject(object) , getDesc = gOPD.f , keys = ownKeys(O) , result = {} , i = 0 , key; while(keys.length > i)createProperty(result, key = keys[i++], getDesc(O, key)); return result; } }); },{"107":107,"24":24,"32":32,"70":70,"80":80}],269:[function(_dereq_,module,exports){ 'use strict'; var $export = _dereq_(32) , toObject = _dereq_(109) , toPrimitive = _dereq_(110) , getPrototypeOf = _dereq_(74) , getOwnPropertyDescriptor = _dereq_(70).f; // B.2.2.4 Object.prototype.__lookupGetter__(P) _dereq_(28) && $export($export.P + _dereq_(69), 'Object', { __lookupGetter__: function __lookupGetter__(P){ var O = toObject(this) , K = toPrimitive(P, true) , D; do { if(D = getOwnPropertyDescriptor(O, K))return D.get; } while(O = getPrototypeOf(O)); } }); },{"109":109,"110":110,"28":28,"32":32,"69":69,"70":70,"74":74}],270:[function(_dereq_,module,exports){ 'use strict'; var $export = _dereq_(32) , toObject = _dereq_(109) , toPrimitive = _dereq_(110) , getPrototypeOf = _dereq_(74) , getOwnPropertyDescriptor = _dereq_(70).f; // B.2.2.5 Object.prototype.__lookupSetter__(P) _dereq_(28) && $export($export.P + _dereq_(69), 'Object', { __lookupSetter__: function __lookupSetter__(P){ var O = toObject(this) , K = toPrimitive(P, true) , D; do { if(D = getOwnPropertyDescriptor(O, K))return D.set; } while(O = getPrototypeOf(O)); } }); },{"109":109,"110":110,"28":28,"32":32,"69":69,"70":70,"74":74}],271:[function(_dereq_,module,exports){ // https://github.com/tc39/proposal-object-values-entries var $export = _dereq_(32) , $values = _dereq_(79)(false); $export($export.S, 'Object', { values: function values(it){ return $values(it); } }); },{"32":32,"79":79}],272:[function(_dereq_,module,exports){ 'use strict'; // https://github.com/zenparsing/es-observable var $export = _dereq_(32) , global = _dereq_(38) , core = _dereq_(23) , microtask = _dereq_(64)() , OBSERVABLE = _dereq_(117)('observable') , aFunction = _dereq_(3) , anObject = _dereq_(7) , anInstance = _dereq_(6) , redefineAll = _dereq_(86) , hide = _dereq_(40) , forOf = _dereq_(37) , RETURN = forOf.RETURN; var getMethod = function(fn){ return fn == null ? undefined : aFunction(fn); }; var cleanupSubscription = function(subscription){ var cleanup = subscription._c; if(cleanup){ subscription._c = undefined; cleanup(); } }; var subscriptionClosed = function(subscription){ return subscription._o === undefined; }; var closeSubscription = function(subscription){ if(!subscriptionClosed(subscription)){ subscription._o = undefined; cleanupSubscription(subscription); } }; var Subscription = function(observer, subscriber){ anObject(observer); this._c = undefined; this._o = observer; observer = new SubscriptionObserver(this); try { var cleanup = subscriber(observer) , subscription = cleanup; if(cleanup != null){ if(typeof cleanup.unsubscribe === 'function')cleanup = function(){ subscription.unsubscribe(); }; else aFunction(cleanup); this._c = cleanup; } } catch(e){ observer.error(e); return; } if(subscriptionClosed(this))cleanupSubscription(this); }; Subscription.prototype = redefineAll({}, { unsubscribe: function unsubscribe(){ closeSubscription(this); } }); var SubscriptionObserver = function(subscription){ this._s = subscription; }; SubscriptionObserver.prototype = redefineAll({}, { next: function next(value){ var subscription = this._s; if(!subscriptionClosed(subscription)){ var observer = subscription._o; try { var m = getMethod(observer.next); if(m)return m.call(observer, value); } catch(e){ try { closeSubscription(subscription); } finally { throw e; } } } }, error: function error(value){ var subscription = this._s; if(subscriptionClosed(subscription))throw value; var observer = subscription._o; subscription._o = undefined; try { var m = getMethod(observer.error); if(!m)throw value; value = m.call(observer, value); } catch(e){ try { cleanupSubscription(subscription); } finally { throw e; } } cleanupSubscription(subscription); return value; }, complete: function complete(value){ var subscription = this._s; if(!subscriptionClosed(subscription)){ var observer = subscription._o; subscription._o = undefined; try { var m = getMethod(observer.complete); value = m ? m.call(observer, value) : undefined; } catch(e){ try { cleanupSubscription(subscription); } finally { throw e; } } cleanupSubscription(subscription); return value; } } }); var $Observable = function Observable(subscriber){ anInstance(this, $Observable, 'Observable', '_f')._f = aFunction(subscriber); }; redefineAll($Observable.prototype, { subscribe: function subscribe(observer){ return new Subscription(observer, this._f); }, forEach: function forEach(fn){ var that = this; return new (core.Promise || global.Promise)(function(resolve, reject){ aFunction(fn); var subscription = that.subscribe({ next : function(value){ try { return fn(value); } catch(e){ reject(e); subscription.unsubscribe(); } }, error: reject, complete: resolve }); }); } }); redefineAll($Observable, { from: function from(x){ var C = typeof this === 'function' ? this : $Observable; var method = getMethod(anObject(x)[OBSERVABLE]); if(method){ var observable = anObject(method.call(x)); return observable.constructor === C ? observable : new C(function(observer){ return observable.subscribe(observer); }); } return new C(function(observer){ var done = false; microtask(function(){ if(!done){ try { if(forOf(x, false, function(it){ observer.next(it); if(done)return RETURN; }) === RETURN)return; } catch(e){ if(done)throw e; observer.error(e); return; } observer.complete(); } }); return function(){ done = true; }; }); }, of: function of(){ for(var i = 0, l = arguments.length, items = Array(l); i < l;)items[i] = arguments[i++]; return new (typeof this === 'function' ? this : $Observable)(function(observer){ var done = false; microtask(function(){ if(!done){ for(var i = 0; i < items.length; ++i){ observer.next(items[i]); if(done)return; } observer.complete(); } }); return function(){ done = true; }; }); } }); hide($Observable.prototype, OBSERVABLE, function(){ return this; }); $export($export.G, {Observable: $Observable}); _dereq_(91)('Observable'); },{"117":117,"23":23,"3":3,"32":32,"37":37,"38":38,"40":40,"6":6,"64":64,"7":7,"86":86,"91":91}],273:[function(_dereq_,module,exports){ var metadata = _dereq_(63) , anObject = _dereq_(7) , toMetaKey = metadata.key , ordinaryDefineOwnMetadata = metadata.set; metadata.exp({defineMetadata: function defineMetadata(metadataKey, metadataValue, target, targetKey){ ordinaryDefineOwnMetadata(metadataKey, metadataValue, anObject(target), toMetaKey(targetKey)); }}); },{"63":63,"7":7}],274:[function(_dereq_,module,exports){ var metadata = _dereq_(63) , anObject = _dereq_(7) , toMetaKey = metadata.key , getOrCreateMetadataMap = metadata.map , store = metadata.store; metadata.exp({deleteMetadata: function deleteMetadata(metadataKey, target /*, targetKey */){ var targetKey = arguments.length < 3 ? undefined : toMetaKey(arguments[2]) , metadataMap = getOrCreateMetadataMap(anObject(target), targetKey, false); if(metadataMap === undefined || !metadataMap['delete'](metadataKey))return false; if(metadataMap.size)return true; var targetMetadata = store.get(target); targetMetadata['delete'](targetKey); return !!targetMetadata.size || store['delete'](target); }}); },{"63":63,"7":7}],275:[function(_dereq_,module,exports){ var Set = _dereq_(220) , from = _dereq_(10) , metadata = _dereq_(63) , anObject = _dereq_(7) , getPrototypeOf = _dereq_(74) , ordinaryOwnMetadataKeys = metadata.keys , toMetaKey = metadata.key; var ordinaryMetadataKeys = function(O, P){ var oKeys = ordinaryOwnMetadataKeys(O, P) , parent = getPrototypeOf(O); if(parent === null)return oKeys; var pKeys = ordinaryMetadataKeys(parent, P); return pKeys.length ? oKeys.length ? from(new Set(oKeys.concat(pKeys))) : pKeys : oKeys; }; metadata.exp({getMetadataKeys: function getMetadataKeys(target /*, targetKey */){ return ordinaryMetadataKeys(anObject(target), arguments.length < 2 ? undefined : toMetaKey(arguments[1])); }}); },{"10":10,"220":220,"63":63,"7":7,"74":74}],276:[function(_dereq_,module,exports){ var metadata = _dereq_(63) , anObject = _dereq_(7) , getPrototypeOf = _dereq_(74) , ordinaryHasOwnMetadata = metadata.has , ordinaryGetOwnMetadata = metadata.get , toMetaKey = metadata.key; var ordinaryGetMetadata = function(MetadataKey, O, P){ var hasOwn = ordinaryHasOwnMetadata(MetadataKey, O, P); if(hasOwn)return ordinaryGetOwnMetadata(MetadataKey, O, P); var parent = getPrototypeOf(O); return parent !== null ? ordinaryGetMetadata(MetadataKey, parent, P) : undefined; }; metadata.exp({getMetadata: function getMetadata(metadataKey, target /*, targetKey */){ return ordinaryGetMetadata(metadataKey, anObject(target), arguments.length < 3 ? undefined : toMetaKey(arguments[2])); }}); },{"63":63,"7":7,"74":74}],277:[function(_dereq_,module,exports){ var metadata = _dereq_(63) , anObject = _dereq_(7) , ordinaryOwnMetadataKeys = metadata.keys , toMetaKey = metadata.key; metadata.exp({getOwnMetadataKeys: function getOwnMetadataKeys(target /*, targetKey */){ return ordinaryOwnMetadataKeys(anObject(target), arguments.length < 2 ? undefined : toMetaKey(arguments[1])); }}); },{"63":63,"7":7}],278:[function(_dereq_,module,exports){ var metadata = _dereq_(63) , anObject = _dereq_(7) , ordinaryGetOwnMetadata = metadata.get , toMetaKey = metadata.key; metadata.exp({getOwnMetadata: function getOwnMetadata(metadataKey, target /*, targetKey */){ return ordinaryGetOwnMetadata(metadataKey, anObject(target) , arguments.length < 3 ? undefined : toMetaKey(arguments[2])); }}); },{"63":63,"7":7}],279:[function(_dereq_,module,exports){ var metadata = _dereq_(63) , anObject = _dereq_(7) , getPrototypeOf = _dereq_(74) , ordinaryHasOwnMetadata = metadata.has , toMetaKey = metadata.key; var ordinaryHasMetadata = function(MetadataKey, O, P){ var hasOwn = ordinaryHasOwnMetadata(MetadataKey, O, P); if(hasOwn)return true; var parent = getPrototypeOf(O); return parent !== null ? ordinaryHasMetadata(MetadataKey, parent, P) : false; }; metadata.exp({hasMetadata: function hasMetadata(metadataKey, target /*, targetKey */){ return ordinaryHasMetadata(metadataKey, anObject(target), arguments.length < 3 ? undefined : toMetaKey(arguments[2])); }}); },{"63":63,"7":7,"74":74}],280:[function(_dereq_,module,exports){ var metadata = _dereq_(63) , anObject = _dereq_(7) , ordinaryHasOwnMetadata = metadata.has , toMetaKey = metadata.key; metadata.exp({hasOwnMetadata: function hasOwnMetadata(metadataKey, target /*, targetKey */){ return ordinaryHasOwnMetadata(metadataKey, anObject(target) , arguments.length < 3 ? undefined : toMetaKey(arguments[2])); }}); },{"63":63,"7":7}],281:[function(_dereq_,module,exports){ var metadata = _dereq_(63) , anObject = _dereq_(7) , aFunction = _dereq_(3) , toMetaKey = metadata.key , ordinaryDefineOwnMetadata = metadata.set; metadata.exp({metadata: function metadata(metadataKey, metadataValue){ return function decorator(target, targetKey){ ordinaryDefineOwnMetadata( metadataKey, metadataValue, (targetKey !== undefined ? anObject : aFunction)(target), toMetaKey(targetKey) ); }; }}); },{"3":3,"63":63,"7":7}],282:[function(_dereq_,module,exports){ // https://github.com/DavidBruant/Map-Set.prototype.toJSON var $export = _dereq_(32); $export($export.P + $export.R, 'Set', {toJSON: _dereq_(20)('Set')}); },{"20":20,"32":32}],283:[function(_dereq_,module,exports){ 'use strict'; // https://github.com/mathiasbynens/String.prototype.at var $export = _dereq_(32) , $at = _dereq_(97)(true); $export($export.P, 'String', { at: function at(pos){ return $at(this, pos); } }); },{"32":32,"97":97}],284:[function(_dereq_,module,exports){ 'use strict'; // https://tc39.github.io/String.prototype.matchAll/ var $export = _dereq_(32) , defined = _dereq_(27) , toLength = _dereq_(108) , isRegExp = _dereq_(50) , getFlags = _dereq_(36) , RegExpProto = RegExp.prototype; var $RegExpStringIterator = function(regexp, string){ this._r = regexp; this._s = string; }; _dereq_(52)($RegExpStringIterator, 'RegExp String', function next(){ var match = this._r.exec(this._s); return {value: match, done: match === null}; }); $export($export.P, 'String', { matchAll: function matchAll(regexp){ defined(this); if(!isRegExp(regexp))throw TypeError(regexp + ' is not a regexp!'); var S = String(this) , flags = 'flags' in RegExpProto ? String(regexp.flags) : getFlags.call(regexp) , rx = new RegExp(regexp.source, ~flags.indexOf('g') ? flags : 'g' + flags); rx.lastIndex = toLength(regexp.lastIndex); return new $RegExpStringIterator(rx, S); } }); },{"108":108,"27":27,"32":32,"36":36,"50":50,"52":52}],285:[function(_dereq_,module,exports){ 'use strict'; // https://github.com/tc39/proposal-string-pad-start-end var $export = _dereq_(32) , $pad = _dereq_(100); $export($export.P, 'String', { padEnd: function padEnd(maxLength /*, fillString = ' ' */){ return $pad(this, maxLength, arguments.length > 1 ? arguments[1] : undefined, false); } }); },{"100":100,"32":32}],286:[function(_dereq_,module,exports){ 'use strict'; // https://github.com/tc39/proposal-string-pad-start-end var $export = _dereq_(32) , $pad = _dereq_(100); $export($export.P, 'String', { padStart: function padStart(maxLength /*, fillString = ' ' */){ return $pad(this, maxLength, arguments.length > 1 ? arguments[1] : undefined, true); } }); },{"100":100,"32":32}],287:[function(_dereq_,module,exports){ 'use strict'; // https://github.com/sebmarkbage/ecmascript-string-left-right-trim _dereq_(102)('trimLeft', function($trim){ return function trimLeft(){ return $trim(this, 1); }; }, 'trimStart'); },{"102":102}],288:[function(_dereq_,module,exports){ 'use strict'; // https://github.com/sebmarkbage/ecmascript-string-left-right-trim _dereq_(102)('trimRight', function($trim){ return function trimRight(){ return $trim(this, 2); }; }, 'trimEnd'); },{"102":102}],289:[function(_dereq_,module,exports){ _dereq_(115)('asyncIterator'); },{"115":115}],290:[function(_dereq_,module,exports){ _dereq_(115)('observable'); },{"115":115}],291:[function(_dereq_,module,exports){ // https://github.com/ljharb/proposal-global var $export = _dereq_(32); $export($export.S, 'System', {global: _dereq_(38)}); },{"32":32,"38":38}],292:[function(_dereq_,module,exports){ var $iterators = _dereq_(130) , redefine = _dereq_(87) , global = _dereq_(38) , hide = _dereq_(40) , Iterators = _dereq_(56) , wks = _dereq_(117) , ITERATOR = wks('iterator') , TO_STRING_TAG = wks('toStringTag') , ArrayValues = Iterators.Array; for(var collections = ['NodeList', 'DOMTokenList', 'MediaList', 'StyleSheetList', 'CSSRuleList'], i = 0; i < 5; i++){ var NAME = collections[i] , Collection = global[NAME] , proto = Collection && Collection.prototype , key; if(proto){ if(!proto[ITERATOR])hide(proto, ITERATOR, ArrayValues); if(!proto[TO_STRING_TAG])hide(proto, TO_STRING_TAG, NAME); Iterators[NAME] = ArrayValues; for(key in $iterators)if(!proto[key])redefine(proto, key, $iterators[key], true); } } },{"117":117,"130":130,"38":38,"40":40,"56":56,"87":87}],293:[function(_dereq_,module,exports){ var $export = _dereq_(32) , $task = _dereq_(104); $export($export.G + $export.B, { setImmediate: $task.set, clearImmediate: $task.clear }); },{"104":104,"32":32}],294:[function(_dereq_,module,exports){ // ie9- setTimeout & setInterval additional parameters fix var global = _dereq_(38) , $export = _dereq_(32) , invoke = _dereq_(44) , partial = _dereq_(83) , navigator = global.navigator , MSIE = !!navigator && /MSIE .\./.test(navigator.userAgent); // <- dirty ie9- check var wrap = function(set){ return MSIE ? function(fn, time /*, ...args */){ return set(invoke( partial, [].slice.call(arguments, 2), typeof fn == 'function' ? fn : Function(fn) ), time); } : set; }; $export($export.G + $export.B + $export.F * MSIE, { setTimeout: wrap(global.setTimeout), setInterval: wrap(global.setInterval) }); },{"32":32,"38":38,"44":44,"83":83}],295:[function(_dereq_,module,exports){ _dereq_(243); _dereq_(180); _dereq_(182); _dereq_(181); _dereq_(184); _dereq_(186); _dereq_(191); _dereq_(185); _dereq_(183); _dereq_(193); _dereq_(192); _dereq_(188); _dereq_(189); _dereq_(187); _dereq_(179); _dereq_(190); _dereq_(194); _dereq_(195); _dereq_(146); _dereq_(148); _dereq_(147); _dereq_(197); _dereq_(196); _dereq_(167); _dereq_(177); _dereq_(178); _dereq_(168); _dereq_(169); _dereq_(170); _dereq_(171); _dereq_(172); _dereq_(173); _dereq_(174); _dereq_(175); _dereq_(176); _dereq_(150); _dereq_(151); _dereq_(152); _dereq_(153); _dereq_(154); _dereq_(155); _dereq_(156); _dereq_(157); _dereq_(158); _dereq_(159); _dereq_(160); _dereq_(161); _dereq_(162); _dereq_(163); _dereq_(164); _dereq_(165); _dereq_(166); _dereq_(230); _dereq_(235); _dereq_(242); _dereq_(233); _dereq_(225); _dereq_(226); _dereq_(231); _dereq_(236); _dereq_(238); _dereq_(221); _dereq_(222); _dereq_(223); _dereq_(224); _dereq_(227); _dereq_(228); _dereq_(229); _dereq_(232); _dereq_(234); _dereq_(237); _dereq_(239); _dereq_(240); _dereq_(241); _dereq_(141); _dereq_(143); _dereq_(142); _dereq_(145); _dereq_(144); _dereq_(129); _dereq_(127); _dereq_(134); _dereq_(131); _dereq_(137); _dereq_(139); _dereq_(126); _dereq_(133); _dereq_(123); _dereq_(138); _dereq_(121); _dereq_(136); _dereq_(135); _dereq_(128); _dereq_(132); _dereq_(120); _dereq_(122); _dereq_(125); _dereq_(124); _dereq_(140); _dereq_(130); _dereq_(213); _dereq_(219); _dereq_(214); _dereq_(215); _dereq_(216); _dereq_(217); _dereq_(218); _dereq_(198); _dereq_(149); _dereq_(220); _dereq_(255); _dereq_(256); _dereq_(244); _dereq_(245); _dereq_(250); _dereq_(253); _dereq_(254); _dereq_(248); _dereq_(251); _dereq_(249); _dereq_(252); _dereq_(246); _dereq_(247); _dereq_(199); _dereq_(200); _dereq_(201); _dereq_(202); _dereq_(203); _dereq_(206); _dereq_(204); _dereq_(205); _dereq_(207); _dereq_(208); _dereq_(209); _dereq_(210); _dereq_(212); _dereq_(211); _dereq_(257); _dereq_(283); _dereq_(286); _dereq_(285); _dereq_(287); _dereq_(288); _dereq_(284); _dereq_(289); _dereq_(290); _dereq_(268); _dereq_(271); _dereq_(267); _dereq_(265); _dereq_(266); _dereq_(269); _dereq_(270); _dereq_(260); _dereq_(282); _dereq_(291); _dereq_(259); _dereq_(261); _dereq_(263); _dereq_(262); _dereq_(264); _dereq_(273); _dereq_(274); _dereq_(276); _dereq_(275); _dereq_(278); _dereq_(277); _dereq_(279); _dereq_(280); _dereq_(281); _dereq_(258); _dereq_(272); _dereq_(294); _dereq_(293); _dereq_(292); module.exports = _dereq_(23); },{"120":120,"121":121,"122":122,"123":123,"124":124,"125":125,"126":126,"127":127,"128":128,"129":129,"130":130,"131":131,"132":132,"133":133,"134":134,"135":135,"136":136,"137":137,"138":138,"139":139,"140":140,"141":141,"142":142,"143":143,"144":144,"145":145,"146":146,"147":147,"148":148,"149":149,"150":150,"151":151,"152":152,"153":153,"154":154,"155":155,"156":156,"157":157,"158":158,"159":159,"160":160,"161":161,"162":162,"163":163,"164":164,"165":165,"166":166,"167":167,"168":168,"169":169,"170":170,"171":171,"172":172,"173":173,"174":174,"175":175,"176":176,"177":177,"178":178,"179":179,"180":180,"181":181,"182":182,"183":183,"184":184,"185":185,"186":186,"187":187,"188":188,"189":189,"190":190,"191":191,"192":192,"193":193,"194":194,"195":195,"196":196,"197":197,"198":198,"199":199,"200":200,"201":201,"202":202,"203":203,"204":204,"205":205,"206":206,"207":207,"208":208,"209":209,"210":210,"211":211,"212":212,"213":213,"214":214,"215":215,"216":216,"217":217,"218":218,"219":219,"220":220,"221":221,"222":222,"223":223,"224":224,"225":225,"226":226,"227":227,"228":228,"229":229,"23":23,"230":230,"231":231,"232":232,"233":233,"234":234,"235":235,"236":236,"237":237,"238":238,"239":239,"240":240,"241":241,"242":242,"243":243,"244":244,"245":245,"246":246,"247":247,"248":248,"249":249,"250":250,"251":251,"252":252,"253":253,"254":254,"255":255,"256":256,"257":257,"258":258,"259":259,"260":260,"261":261,"262":262,"263":263,"264":264,"265":265,"266":266,"267":267,"268":268,"269":269,"270":270,"271":271,"272":272,"273":273,"274":274,"275":275,"276":276,"277":277,"278":278,"279":279,"280":280,"281":281,"282":282,"283":283,"284":284,"285":285,"286":286,"287":287,"288":288,"289":289,"290":290,"291":291,"292":292,"293":293,"294":294}],296:[function(_dereq_,module,exports){ (function (global){ /** * Copyright (c) 2014, Facebook, Inc. * All rights reserved. * * This source code is licensed under the BSD-style license found in the * https://raw.github.com/facebook/regenerator/master/LICENSE file. An * additional grant of patent rights can be found in the PATENTS file in * the same directory. */ !(function(global) { "use strict"; var Op = Object.prototype; var hasOwn = Op.hasOwnProperty; var undefined; // More compressible than void 0. var $Symbol = typeof Symbol === "function" ? Symbol : {}; var iteratorSymbol = $Symbol.iterator || "@@iterator"; var toStringTagSymbol = $Symbol.toStringTag || "@@toStringTag"; var inModule = typeof module === "object"; var runtime = global.regeneratorRuntime; if (runtime) { if (inModule) { // If regeneratorRuntime is defined globally and we're in a module, // make the exports object identical to regeneratorRuntime. module.exports = runtime; } // Don't bother evaluating the rest of this file if the runtime was // already defined globally. return; } // Define the runtime globally (as expected by generated code) as either // module.exports (if we're in a module) or a new, empty object. runtime = global.regeneratorRuntime = inModule ? module.exports : {}; function wrap(innerFn, outerFn, self, tryLocsList) { // If outerFn provided and outerFn.prototype is a Generator, then outerFn.prototype instanceof Generator. var protoGenerator = outerFn && outerFn.prototype instanceof Generator ? outerFn : Generator; var generator = Object.create(protoGenerator.prototype); var context = new Context(tryLocsList || []); // The ._invoke method unifies the implementations of the .next, // .throw, and .return methods. generator._invoke = makeInvokeMethod(innerFn, self, context); return generator; } runtime.wrap = wrap; // Try/catch helper to minimize deoptimizations. Returns a completion // record like context.tryEntries[i].completion. This interface could // have been (and was previously) designed to take a closure to be // invoked without arguments, but in all the cases we care about we // already have an existing method we want to call, so there's no need // to create a new function object. We can even get away with assuming // the method takes exactly one argument, since that happens to be true // in every case, so we don't have to touch the arguments object. The // only additional allocation required is the completion record, which // has a stable shape and so hopefully should be cheap to allocate. function tryCatch(fn, obj, arg) { try { return { type: "normal", arg: fn.call(obj, arg) }; } catch (err) { return { type: "throw", arg: err }; } } var GenStateSuspendedStart = "suspendedStart"; var GenStateSuspendedYield = "suspendedYield"; var GenStateExecuting = "executing"; var GenStateCompleted = "completed"; // Returning this object from the innerFn has the same effect as // breaking out of the dispatch switch statement. var ContinueSentinel = {}; // Dummy constructor functions that we use as the .constructor and // .constructor.prototype properties for functions that return Generator // objects. For full spec compliance, you may wish to configure your // minifier not to mangle the names of these two functions. function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} // This is a polyfill for %IteratorPrototype% for environments that // don't natively support it. var IteratorPrototype = {}; IteratorPrototype[iteratorSymbol] = function () { return this; }; var getProto = Object.getPrototypeOf; var NativeIteratorPrototype = getProto && getProto(getProto(values([]))); if (NativeIteratorPrototype && NativeIteratorPrototype !== Op && hasOwn.call(NativeIteratorPrototype, iteratorSymbol)) { // This environment has a native %IteratorPrototype%; use it instead // of the polyfill. IteratorPrototype = NativeIteratorPrototype; } var Gp = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(IteratorPrototype); GeneratorFunction.prototype = Gp.constructor = GeneratorFunctionPrototype; GeneratorFunctionPrototype.constructor = GeneratorFunction; GeneratorFunctionPrototype[toStringTagSymbol] = GeneratorFunction.displayName = "GeneratorFunction"; // Helper for defining the .next, .throw, and .return methods of the // Iterator interface in terms of a single ._invoke method. function defineIteratorMethods(prototype) { ["next", "throw", "return"].forEach(function(method) { prototype[method] = function(arg) { return this._invoke(method, arg); }; }); } runtime.isGeneratorFunction = function(genFun) { var ctor = typeof genFun === "function" && genFun.constructor; return ctor ? ctor === GeneratorFunction || // For the native GeneratorFunction constructor, the best we can // do is to check its .name property. (ctor.displayName || ctor.name) === "GeneratorFunction" : false; }; runtime.mark = function(genFun) { if (Object.setPrototypeOf) { Object.setPrototypeOf(genFun, GeneratorFunctionPrototype); } else { genFun.__proto__ = GeneratorFunctionPrototype; if (!(toStringTagSymbol in genFun)) { genFun[toStringTagSymbol] = "GeneratorFunction"; } } genFun.prototype = Object.create(Gp); return genFun; }; // Within the body of any async function, `await x` is transformed to // `yield regeneratorRuntime.awrap(x)`, so that the runtime can test // `hasOwn.call(value, "__await")` to determine if the yielded value is // meant to be awaited. runtime.awrap = function(arg) { return { __await: arg }; }; function AsyncIterator(generator) { function invoke(method, arg, resolve, reject) { var record = tryCatch(generator[method], generator, arg); if (record.type === "throw") { reject(record.arg); } else { var result = record.arg; var value = result.value; if (value && typeof value === "object" && hasOwn.call(value, "__await")) { return Promise.resolve(value.__await).then(function(value) { invoke("next", value, resolve, reject); }, function(err) { invoke("throw", err, resolve, reject); }); } return Promise.resolve(value).then(function(unwrapped) { // When a yielded Promise is resolved, its final value becomes // the .value of the Promise<{value,done}> result for the // current iteration. If the Promise is rejected, however, the // result for this iteration will be rejected with the same // reason. Note that rejections of yielded Promises are not // thrown back into the generator function, as is the case // when an awaited Promise is rejected. This difference in // behavior between yield and await is important, because it // allows the consumer to decide what to do with the yielded // rejection (swallow it and continue, manually .throw it back // into the generator, abandon iteration, whatever). With // await, by contrast, there is no opportunity to examine the // rejection reason outside the generator function, so the // only option is to throw it from the await expression, and // let the generator function handle the exception. result.value = unwrapped; resolve(result); }, reject); } } if (typeof process === "object" && process.domain) { invoke = process.domain.bind(invoke); } var previousPromise; function enqueue(method, arg) { function callInvokeWithMethodAndArg() { return new Promise(function(resolve, reject) { invoke(method, arg, resolve, reject); }); } return previousPromise = // If enqueue has been called before, then we want to wait until // all previous Promises have been resolved before calling invoke, // so that results are always delivered in the correct order. If // enqueue has not been called before, then it is important to // call invoke immediately, without waiting on a callback to fire, // so that the async generator function has the opportunity to do // any necessary setup in a predictable way. This predictability // is why the Promise constructor synchronously invokes its // executor callback, and why async functions synchronously // execute code before the first await. Since we implement simple // async functions in terms of async generators, it is especially // important to get this right, even though it requires care. previousPromise ? previousPromise.then( callInvokeWithMethodAndArg, // Avoid propagating failures to Promises returned by later // invocations of the iterator. callInvokeWithMethodAndArg ) : callInvokeWithMethodAndArg(); } // Define the unified helper method that is used to implement .next, // .throw, and .return (see defineIteratorMethods). this._invoke = enqueue; } defineIteratorMethods(AsyncIterator.prototype); runtime.AsyncIterator = AsyncIterator; // Note that simple async functions are implemented on top of // AsyncIterator objects; they just return a Promise for the value of // the final result produced by the iterator. runtime.async = function(innerFn, outerFn, self, tryLocsList) { var iter = new AsyncIterator( wrap(innerFn, outerFn, self, tryLocsList) ); return runtime.isGeneratorFunction(outerFn) ? iter // If outerFn is a generator, return the full iterator. : iter.next().then(function(result) { return result.done ? result.value : iter.next(); }); }; function makeInvokeMethod(innerFn, self, context) { var state = GenStateSuspendedStart; return function invoke(method, arg) { if (state === GenStateExecuting) { throw new Error("Generator is already running"); } if (state === GenStateCompleted) { if (method === "throw") { throw arg; } // Be forgiving, per 25.3.3.3.3 of the spec: // https://people.mozilla.org/~jorendorff/es6-draft.html#sec-generatorresume return doneResult(); } while (true) { var delegate = context.delegate; if (delegate) { if (method === "return" || (method === "throw" && delegate.iterator[method] === undefined)) { // A return or throw (when the delegate iterator has no throw // method) always terminates the yield* loop. context.delegate = null; // If the delegate iterator has a return method, give it a // chance to clean up. var returnMethod = delegate.iterator["return"]; if (returnMethod) { var record = tryCatch(returnMethod, delegate.iterator, arg); if (record.type === "throw") { // If the return method threw an exception, let that // exception prevail over the original return or throw. method = "throw"; arg = record.arg; continue; } } if (method === "return") { // Continue with the outer return, now that the delegate // iterator has been terminated. continue; } } var record = tryCatch( delegate.iterator[method], delegate.iterator, arg ); if (record.type === "throw") { context.delegate = null; // Like returning generator.throw(uncaught), but without the // overhead of an extra function call. method = "throw"; arg = record.arg; continue; } // Delegate generator ran and handled its own exceptions so // regardless of what the method was, we continue as if it is // "next" with an undefined arg. method = "next"; arg = undefined; var info = record.arg; if (info.done) { context[delegate.resultName] = info.value; context.next = delegate.nextLoc; } else { state = GenStateSuspendedYield; return info; } context.delegate = null; } if (method === "next") { // Setting context._sent for legacy support of Babel's // function.sent implementation. context.sent = context._sent = arg; } else if (method === "throw") { if (state === GenStateSuspendedStart) { state = GenStateCompleted; throw arg; } if (context.dispatchException(arg)) { // If the dispatched exception was caught by a catch block, // then let that catch block handle the exception normally. method = "next"; arg = undefined; } } else if (method === "return") { context.abrupt("return", arg); } state = GenStateExecuting; var record = tryCatch(innerFn, self, context); if (record.type === "normal") { // If an exception is thrown from innerFn, we leave state === // GenStateExecuting and loop back for another invocation. state = context.done ? GenStateCompleted : GenStateSuspendedYield; var info = { value: record.arg, done: context.done }; if (record.arg === ContinueSentinel) { if (context.delegate && method === "next") { // Deliberately forget the last sent value so that we don't // accidentally pass it on to the delegate. arg = undefined; } } else { return info; } } else if (record.type === "throw") { state = GenStateCompleted; // Dispatch the exception by looping back around to the // context.dispatchException(arg) call above. method = "throw"; arg = record.arg; } } }; } // Define Generator.prototype.{next,throw,return} in terms of the // unified ._invoke helper method. defineIteratorMethods(Gp); Gp[toStringTagSymbol] = "Generator"; Gp.toString = function() { return "[object Generator]"; }; function pushTryEntry(locs) { var entry = { tryLoc: locs[0] }; if (1 in locs) { entry.catchLoc = locs[1]; } if (2 in locs) { entry.finallyLoc = locs[2]; entry.afterLoc = locs[3]; } this.tryEntries.push(entry); } function resetTryEntry(entry) { var record = entry.completion || {}; record.type = "normal"; delete record.arg; entry.completion = record; } function Context(tryLocsList) { // The root entry object (effectively a try statement without a catch // or a finally block) gives us a place to store values thrown from // locations where there is no enclosing try statement. this.tryEntries = [{ tryLoc: "root" }]; tryLocsList.forEach(pushTryEntry, this); this.reset(true); } runtime.keys = function(object) { var keys = []; for (var key in object) { keys.push(key); } keys.reverse(); // Rather than returning an object with a next method, we keep // things simple and return the next function itself. return function next() { while (keys.length) { var key = keys.pop(); if (key in object) { next.value = key; next.done = false; return next; } } // To avoid creating an additional object, we just hang the .value // and .done properties off the next function object itself. This // also ensures that the minifier will not anonymize the function. next.done = true; return next; }; }; function values(iterable) { if (iterable) { var iteratorMethod = iterable[iteratorSymbol]; if (iteratorMethod) { return iteratorMethod.call(iterable); } if (typeof iterable.next === "function") { return iterable; } if (!isNaN(iterable.length)) { var i = -1, next = function next() { while (++i < iterable.length) { if (hasOwn.call(iterable, i)) { next.value = iterable[i]; next.done = false; return next; } } next.value = undefined; next.done = true; return next; }; return next.next = next; } } // Return an iterator with no values. return { next: doneResult }; } runtime.values = values; function doneResult() { return { value: undefined, done: true }; } Context.prototype = { constructor: Context, reset: function(skipTempReset) { this.prev = 0; this.next = 0; // Resetting context._sent for legacy support of Babel's // function.sent implementation. this.sent = this._sent = undefined; this.done = false; this.delegate = null; this.tryEntries.forEach(resetTryEntry); if (!skipTempReset) { for (var name in this) { // Not sure about the optimal order of these conditions: if (name.charAt(0) === "t" && hasOwn.call(this, name) && !isNaN(+name.slice(1))) { this[name] = undefined; } } } }, stop: function() { this.done = true; var rootEntry = this.tryEntries[0]; var rootRecord = rootEntry.completion; if (rootRecord.type === "throw") { throw rootRecord.arg; } return this.rval; }, dispatchException: function(exception) { if (this.done) { throw exception; } var context = this; function handle(loc, caught) { record.type = "throw"; record.arg = exception; context.next = loc; return !!caught; } for (var i = this.tryEntries.length - 1; i >= 0; --i) { var entry = this.tryEntries[i]; var record = entry.completion; if (entry.tryLoc === "root") { // Exception thrown outside of any try block that could handle // it, so set the completion value of the entire function to // throw the exception. return handle("end"); } if (entry.tryLoc <= this.prev) { var hasCatch = hasOwn.call(entry, "catchLoc"); var hasFinally = hasOwn.call(entry, "finallyLoc"); if (hasCatch && hasFinally) { if (this.prev < entry.catchLoc) { return handle(entry.catchLoc, true); } else if (this.prev < entry.finallyLoc) { return handle(entry.finallyLoc); } } else if (hasCatch) { if (this.prev < entry.catchLoc) { return handle(entry.catchLoc, true); } } else if (hasFinally) { if (this.prev < entry.finallyLoc) { return handle(entry.finallyLoc); } } else { throw new Error("try statement without catch or finally"); } } } }, abrupt: function(type, arg) { for (var i = this.tryEntries.length - 1; i >= 0; --i) { var entry = this.tryEntries[i]; if (entry.tryLoc <= this.prev && hasOwn.call(entry, "finallyLoc") && this.prev < entry.finallyLoc) { var finallyEntry = entry; break; } } if (finallyEntry && (type === "break" || type === "continue") && finallyEntry.tryLoc <= arg && arg <= finallyEntry.finallyLoc) { // Ignore the finally entry if control is not jumping to a // location outside the try/catch block. finallyEntry = null; } var record = finallyEntry ? finallyEntry.completion : {}; record.type = type; record.arg = arg; if (finallyEntry) { this.next = finallyEntry.finallyLoc; } else { this.complete(record); } return ContinueSentinel; }, complete: function(record, afterLoc) { if (record.type === "throw") { throw record.arg; } if (record.type === "break" || record.type === "continue") { this.next = record.arg; } else if (record.type === "return") { this.rval = record.arg; this.next = "end"; } else if (record.type === "normal" && afterLoc) { this.next = afterLoc; } }, finish: function(finallyLoc) { for (var i = this.tryEntries.length - 1; i >= 0; --i) { var entry = this.tryEntries[i]; if (entry.finallyLoc === finallyLoc) { this.complete(entry.completion, entry.afterLoc); resetTryEntry(entry); return ContinueSentinel; } } }, "catch": function(tryLoc) { for (var i = this.tryEntries.length - 1; i >= 0; --i) { var entry = this.tryEntries[i]; if (entry.tryLoc === tryLoc) { var record = entry.completion; if (record.type === "throw") { var thrown = record.arg; resetTryEntry(entry); } return thrown; } } // The context.catch method must only be called with a location // argument that corresponds to a known catch block. throw new Error("illegal catch attempt"); }, delegateYield: function(iterable, resultName, nextLoc) { this.delegate = { iterator: values(iterable), resultName: resultName, nextLoc: nextLoc }; return ContinueSentinel; } }; })( // Among the various tricks for obtaining a reference to the global // object, this seems to be the most reliable technique that does not // use indirect eval (which violates Content Security Policy). typeof global === "object" ? global : typeof window === "object" ? window : typeof self === "object" ? self : this ); }).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {}) },{}]},{},[1]); require=(function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o...', true, true); tt.jsxName = new acorn.TokenType('jsxName'); tt.jsxText = new acorn.TokenType('jsxText', {beforeExpr: true}); tt.jsxTagStart = new acorn.TokenType('jsxTagStart'); tt.jsxTagEnd = new acorn.TokenType('jsxTagEnd'); tt.jsxTagStart.updateContext = function() { this.context.push(tc.j_expr); // treat as beginning of JSX expression this.context.push(tc.j_oTag); // start opening tag context this.exprAllowed = false; }; tt.jsxTagEnd.updateContext = function(prevType) { var out = this.context.pop(); if (out === tc.j_oTag && prevType === tt.slash || out === tc.j_cTag) { this.context.pop(); this.exprAllowed = this.curContext() === tc.j_expr; } else { this.exprAllowed = true; } }; var pp = acorn.Parser.prototype; // Reads inline JSX contents token. pp.jsx_readToken = function() { var out = '', chunkStart = this.pos; for (;;) { if (this.pos >= this.input.length) this.raise(this.start, 'Unterminated JSX contents'); var ch = this.input.charCodeAt(this.pos); switch (ch) { case 60: // '<' case 123: // '{' if (this.pos === this.start) { if (ch === 60 && this.exprAllowed) { ++this.pos; return this.finishToken(tt.jsxTagStart); } return this.getTokenFromCode(ch); } out += this.input.slice(chunkStart, this.pos); return this.finishToken(tt.jsxText, out); case 38: // '&' out += this.input.slice(chunkStart, this.pos); out += this.jsx_readEntity(); chunkStart = this.pos; break; default: if (acorn.isNewLine(ch)) { out += this.input.slice(chunkStart, this.pos); out += this.jsx_readNewLine(true); chunkStart = this.pos; } else { ++this.pos; } } } }; pp.jsx_readNewLine = function(normalizeCRLF) { var ch = this.input.charCodeAt(this.pos); var out; ++this.pos; if (ch === 13 && this.input.charCodeAt(this.pos) === 10) { ++this.pos; out = normalizeCRLF ? '\n' : '\r\n'; } else { out = String.fromCharCode(ch); } if (this.options.locations) { ++this.curLine; this.lineStart = this.pos; } return out; }; pp.jsx_readString = function(quote) { var out = '', chunkStart = ++this.pos; for (;;) { if (this.pos >= this.input.length) this.raise(this.start, 'Unterminated string constant'); var ch = this.input.charCodeAt(this.pos); if (ch === quote) break; if (ch === 38) { // '&' out += this.input.slice(chunkStart, this.pos); out += this.jsx_readEntity(); chunkStart = this.pos; } else if (acorn.isNewLine(ch)) { out += this.input.slice(chunkStart, this.pos); out += this.jsx_readNewLine(false); chunkStart = this.pos; } else { ++this.pos; } } out += this.input.slice(chunkStart, this.pos++); return this.finishToken(tt.string, out); }; pp.jsx_readEntity = function() { var str = '', count = 0, entity; var ch = this.input[this.pos]; if (ch !== '&') this.raise(this.pos, 'Entity must start with an ampersand'); var startPos = ++this.pos; while (this.pos < this.input.length && count++ < 10) { ch = this.input[this.pos++]; if (ch === ';') { if (str[0] === '#') { if (str[1] === 'x') { str = str.substr(2); if (hexNumber.test(str)) entity = String.fromCharCode(parseInt(str, 16)); } else { str = str.substr(1); if (decimalNumber.test(str)) entity = String.fromCharCode(parseInt(str, 10)); } } else { entity = XHTMLEntities[str]; } break; } str += ch; } if (!entity) { this.pos = startPos; return '&'; } return entity; }; // Read a JSX identifier (valid tag or attribute name). // // Optimized version since JSX identifiers can't contain // escape characters and so can be read as single slice. // Also assumes that first character was already checked // by isIdentifierStart in readToken. pp.jsx_readWord = function() { var ch, start = this.pos; do { ch = this.input.charCodeAt(++this.pos); } while (acorn.isIdentifierChar(ch) || ch === 45); // '-' return this.finishToken(tt.jsxName, this.input.slice(start, this.pos)); }; // Transforms JSX element name to string. function getQualifiedJSXName(object) { if (object.type === 'JSXIdentifier') return object.name; if (object.type === 'JSXNamespacedName') return object.namespace.name + ':' + object.name.name; if (object.type === 'JSXMemberExpression') return getQualifiedJSXName(object.object) + '.' + getQualifiedJSXName(object.property); } // Parse next token as JSX identifier pp.jsx_parseIdentifier = function() { var node = this.startNode(); if (this.type === tt.jsxName) node.name = this.value; else if (this.type.keyword) node.name = this.type.keyword; else this.unexpected(); this.next(); return this.finishNode(node, 'JSXIdentifier'); }; // Parse namespaced identifier. pp.jsx_parseNamespacedName = function() { var startPos = this.start, startLoc = this.startLoc; var name = this.jsx_parseIdentifier(); if (!this.options.plugins.jsx.allowNamespaces || !this.eat(tt.colon)) return name; var node = this.startNodeAt(startPos, startLoc); node.namespace = name; node.name = this.jsx_parseIdentifier(); return this.finishNode(node, 'JSXNamespacedName'); }; // Parses element name in any form - namespaced, member // or single identifier. pp.jsx_parseElementName = function() { var startPos = this.start, startLoc = this.startLoc; var node = this.jsx_parseNamespacedName(); if (this.type === tt.dot && node.type === 'JSXNamespacedName' && !this.options.plugins.jsx.allowNamespacedObjects) { this.unexpected(); } while (this.eat(tt.dot)) { var newNode = this.startNodeAt(startPos, startLoc); newNode.object = node; newNode.property = this.jsx_parseIdentifier(); node = this.finishNode(newNode, 'JSXMemberExpression'); } return node; }; // Parses any type of JSX attribute value. pp.jsx_parseAttributeValue = function() { switch (this.type) { case tt.braceL: var node = this.jsx_parseExpressionContainer(); if (node.expression.type === 'JSXEmptyExpression') this.raise(node.start, 'JSX attributes must only be assigned a non-empty expression'); return node; case tt.jsxTagStart: case tt.string: return this.parseExprAtom(); default: this.raise(this.start, 'JSX value should be either an expression or a quoted JSX text'); } }; // JSXEmptyExpression is unique type since it doesn't actually parse anything, // and so it should start at the end of last read token (left brace) and finish // at the beginning of the next one (right brace). pp.jsx_parseEmptyExpression = function() { var node = this.startNodeAt(this.lastTokEnd, this.lastTokEndLoc); return this.finishNodeAt(node, 'JSXEmptyExpression', this.start, this.startLoc); }; // Parses JSX expression enclosed into curly brackets. pp.jsx_parseExpressionContainer = function() { var node = this.startNode(); this.next(); node.expression = this.type === tt.braceR ? this.jsx_parseEmptyExpression() : this.parseExpression(); this.expect(tt.braceR); return this.finishNode(node, 'JSXExpressionContainer'); }; // Parses following JSX attribute name-value pair. pp.jsx_parseAttribute = function() { var node = this.startNode(); if (this.eat(tt.braceL)) { this.expect(tt.ellipsis); node.argument = this.parseMaybeAssign(); this.expect(tt.braceR); return this.finishNode(node, 'JSXSpreadAttribute'); } node.name = this.jsx_parseNamespacedName(); node.value = this.eat(tt.eq) ? this.jsx_parseAttributeValue() : null; return this.finishNode(node, 'JSXAttribute'); }; // Parses JSX opening tag starting after '<'. pp.jsx_parseOpeningElementAt = function(startPos, startLoc) { var node = this.startNodeAt(startPos, startLoc); node.attributes = []; node.name = this.jsx_parseElementName(); while (this.type !== tt.slash && this.type !== tt.jsxTagEnd) node.attributes.push(this.jsx_parseAttribute()); node.selfClosing = this.eat(tt.slash); this.expect(tt.jsxTagEnd); return this.finishNode(node, 'JSXOpeningElement'); }; // Parses JSX closing tag starting after ''); } } node.openingElement = openingElement; node.closingElement = closingElement; node.children = children; if (this.type === tt.relational && this.value === "<") { this.raise(this.start, "Adjacent JSX elements must be wrapped in an enclosing tag"); } return this.finishNode(node, 'JSXElement'); }; // Parses entire JSX element from current position. pp.jsx_parseElement = function() { var startPos = this.start, startLoc = this.startLoc; this.next(); return this.jsx_parseElementAt(startPos, startLoc); }; acorn.plugins.jsx = function(instance, opts) { if (!opts) { return; } if (typeof opts !== 'object') { opts = {}; } instance.options.plugins.jsx = { allowNamespaces: opts.allowNamespaces !== false, allowNamespacedObjects: !!opts.allowNamespacedObjects }; instance.extend('parseExprAtom', function(inner) { return function(refShortHandDefaultPos) { if (this.type === tt.jsxText) return this.parseLiteral(this.value); else if (this.type === tt.jsxTagStart) return this.jsx_parseElement(); else return inner.call(this, refShortHandDefaultPos); }; }); instance.extend('readToken', function(inner) { return function(code) { var context = this.curContext(); if (context === tc.j_expr) return this.jsx_readToken(); if (context === tc.j_oTag || context === tc.j_cTag) { if (acorn.isIdentifierStart(code)) return this.jsx_readWord(); if (code == 62) { ++this.pos; return this.finishToken(tt.jsxTagEnd); } if ((code === 34 || code === 39) && context == tc.j_oTag) return this.jsx_readString(code); } if (code === 60 && this.exprAllowed) { ++this.pos; return this.finishToken(tt.jsxTagStart); } return inner.call(this, code); }; }); instance.extend('updateContext', function(inner) { return function(prevType) { if (this.type == tt.braceL) { var curContext = this.curContext(); if (curContext == tc.j_oTag) this.context.push(tc.b_expr); else if (curContext == tc.j_expr) this.context.push(tc.b_tmpl); else inner.call(this, prevType); this.exprAllowed = true; } else if (this.type === tt.slash && prevType === tt.jsxTagStart) { this.context.length -= 2; // do not consider JSX expr -> JSX open tag -> ... anymore this.context.push(tc.j_cTag); // reconsider as closing tag context this.exprAllowed = false; } else { return inner.call(this, prevType); } }; }); }; return acorn; }; },{"./xhtml":2}],2:[function(require,module,exports){ module.exports = { quot: '\u0022', amp: '&', apos: '\u0027', lt: '<', gt: '>', nbsp: '\u00A0', iexcl: '\u00A1', cent: '\u00A2', pound: '\u00A3', curren: '\u00A4', yen: '\u00A5', brvbar: '\u00A6', sect: '\u00A7', uml: '\u00A8', copy: '\u00A9', ordf: '\u00AA', laquo: '\u00AB', not: '\u00AC', shy: '\u00AD', reg: '\u00AE', macr: '\u00AF', deg: '\u00B0', plusmn: '\u00B1', sup2: '\u00B2', sup3: '\u00B3', acute: '\u00B4', micro: '\u00B5', para: '\u00B6', middot: '\u00B7', cedil: '\u00B8', sup1: '\u00B9', ordm: '\u00BA', raquo: '\u00BB', frac14: '\u00BC', frac12: '\u00BD', frac34: '\u00BE', iquest: '\u00BF', Agrave: '\u00C0', Aacute: '\u00C1', Acirc: '\u00C2', Atilde: '\u00C3', Auml: '\u00C4', Aring: '\u00C5', AElig: '\u00C6', Ccedil: '\u00C7', Egrave: '\u00C8', Eacute: '\u00C9', Ecirc: '\u00CA', Euml: '\u00CB', Igrave: '\u00CC', Iacute: '\u00CD', Icirc: '\u00CE', Iuml: '\u00CF', ETH: '\u00D0', Ntilde: '\u00D1', Ograve: '\u00D2', Oacute: '\u00D3', Ocirc: '\u00D4', Otilde: '\u00D5', Ouml: '\u00D6', times: '\u00D7', Oslash: '\u00D8', Ugrave: '\u00D9', Uacute: '\u00DA', Ucirc: '\u00DB', Uuml: '\u00DC', Yacute: '\u00DD', THORN: '\u00DE', szlig: '\u00DF', agrave: '\u00E0', aacute: '\u00E1', acirc: '\u00E2', atilde: '\u00E3', auml: '\u00E4', aring: '\u00E5', aelig: '\u00E6', ccedil: '\u00E7', egrave: '\u00E8', eacute: '\u00E9', ecirc: '\u00EA', euml: '\u00EB', igrave: '\u00EC', iacute: '\u00ED', icirc: '\u00EE', iuml: '\u00EF', eth: '\u00F0', ntilde: '\u00F1', ograve: '\u00F2', oacute: '\u00F3', ocirc: '\u00F4', otilde: '\u00F5', ouml: '\u00F6', divide: '\u00F7', oslash: '\u00F8', ugrave: '\u00F9', uacute: '\u00FA', ucirc: '\u00FB', uuml: '\u00FC', yacute: '\u00FD', thorn: '\u00FE', yuml: '\u00FF', OElig: '\u0152', oelig: '\u0153', Scaron: '\u0160', scaron: '\u0161', Yuml: '\u0178', fnof: '\u0192', circ: '\u02C6', tilde: '\u02DC', Alpha: '\u0391', Beta: '\u0392', Gamma: '\u0393', Delta: '\u0394', Epsilon: '\u0395', Zeta: '\u0396', Eta: '\u0397', Theta: '\u0398', Iota: '\u0399', Kappa: '\u039A', Lambda: '\u039B', Mu: '\u039C', Nu: '\u039D', Xi: '\u039E', Omicron: '\u039F', Pi: '\u03A0', Rho: '\u03A1', Sigma: '\u03A3', Tau: '\u03A4', Upsilon: '\u03A5', Phi: '\u03A6', Chi: '\u03A7', Psi: '\u03A8', Omega: '\u03A9', alpha: '\u03B1', beta: '\u03B2', gamma: '\u03B3', delta: '\u03B4', epsilon: '\u03B5', zeta: '\u03B6', eta: '\u03B7', theta: '\u03B8', iota: '\u03B9', kappa: '\u03BA', lambda: '\u03BB', mu: '\u03BC', nu: '\u03BD', xi: '\u03BE', omicron: '\u03BF', pi: '\u03C0', rho: '\u03C1', sigmaf: '\u03C2', sigma: '\u03C3', tau: '\u03C4', upsilon: '\u03C5', phi: '\u03C6', chi: '\u03C7', psi: '\u03C8', omega: '\u03C9', thetasym: '\u03D1', upsih: '\u03D2', piv: '\u03D6', ensp: '\u2002', emsp: '\u2003', thinsp: '\u2009', zwnj: '\u200C', zwj: '\u200D', lrm: '\u200E', rlm: '\u200F', ndash: '\u2013', mdash: '\u2014', lsquo: '\u2018', rsquo: '\u2019', sbquo: '\u201A', ldquo: '\u201C', rdquo: '\u201D', bdquo: '\u201E', dagger: '\u2020', Dagger: '\u2021', bull: '\u2022', hellip: '\u2026', permil: '\u2030', prime: '\u2032', Prime: '\u2033', lsaquo: '\u2039', rsaquo: '\u203A', oline: '\u203E', frasl: '\u2044', euro: '\u20AC', image: '\u2111', weierp: '\u2118', real: '\u211C', trade: '\u2122', alefsym: '\u2135', larr: '\u2190', uarr: '\u2191', rarr: '\u2192', darr: '\u2193', harr: '\u2194', crarr: '\u21B5', lArr: '\u21D0', uArr: '\u21D1', rArr: '\u21D2', dArr: '\u21D3', hArr: '\u21D4', forall: '\u2200', part: '\u2202', exist: '\u2203', empty: '\u2205', nabla: '\u2207', isin: '\u2208', notin: '\u2209', ni: '\u220B', prod: '\u220F', sum: '\u2211', minus: '\u2212', lowast: '\u2217', radic: '\u221A', prop: '\u221D', infin: '\u221E', ang: '\u2220', and: '\u2227', or: '\u2228', cap: '\u2229', cup: '\u222A', 'int': '\u222B', there4: '\u2234', sim: '\u223C', cong: '\u2245', asymp: '\u2248', ne: '\u2260', equiv: '\u2261', le: '\u2264', ge: '\u2265', sub: '\u2282', sup: '\u2283', nsub: '\u2284', sube: '\u2286', supe: '\u2287', oplus: '\u2295', otimes: '\u2297', perp: '\u22A5', sdot: '\u22C5', lceil: '\u2308', rceil: '\u2309', lfloor: '\u230A', rfloor: '\u230B', lang: '\u2329', rang: '\u232A', loz: '\u25CA', spades: '\u2660', clubs: '\u2663', hearts: '\u2665', diams: '\u2666' }; },{}],3:[function(require,module,exports){ (function (global, factory) { typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) : typeof define === 'function' && define.amd ? define(['exports'], factory) : (factory((global.acorn = global.acorn || {}))); }(this, (function (exports) { 'use strict'; // Reserved word lists for various dialects of the language var reservedWords = { 3: "abstract boolean byte char class double enum export extends final float goto implements import int interface long native package private protected public short static super synchronized throws transient volatile", 5: "class enum extends super const export import", 6: "enum", strict: "implements interface let package private protected public static yield", strictBind: "eval arguments" } // And the keywords var ecma5AndLessKeywords = "break case catch continue debugger default do else finally for function if return switch throw try var while with null true false instanceof typeof void delete new in this" var keywords = { 5: ecma5AndLessKeywords, 6: ecma5AndLessKeywords + " const class extends export import super" } // ## Character categories // Big ugly regular expressions that match characters in the // whitespace, identifier, and identifier-start categories. These // are only applied when a character is found to actually have a // code point above 128. // Generated by `bin/generate-identifier-regex.js`. var nonASCIIidentifierStartChars = "\xaa\xb5\xba\xc0-\xd6\xd8-\xf6\xf8-\u02c1\u02c6-\u02d1\u02e0-\u02e4\u02ec\u02ee\u0370-\u0374\u0376\u0377\u037a-\u037d\u037f\u0386\u0388-\u038a\u038c\u038e-\u03a1\u03a3-\u03f5\u03f7-\u0481\u048a-\u052f\u0531-\u0556\u0559\u0561-\u0587\u05d0-\u05ea\u05f0-\u05f2\u0620-\u064a\u066e\u066f\u0671-\u06d3\u06d5\u06e5\u06e6\u06ee\u06ef\u06fa-\u06fc\u06ff\u0710\u0712-\u072f\u074d-\u07a5\u07b1\u07ca-\u07ea\u07f4\u07f5\u07fa\u0800-\u0815\u081a\u0824\u0828\u0840-\u0858\u08a0-\u08b4\u08b6-\u08bd\u0904-\u0939\u093d\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098c\u098f\u0990\u0993-\u09a8\u09aa-\u09b0\u09b2\u09b6-\u09b9\u09bd\u09ce\u09dc\u09dd\u09df-\u09e1\u09f0\u09f1\u0a05-\u0a0a\u0a0f\u0a10\u0a13-\u0a28\u0a2a-\u0a30\u0a32\u0a33\u0a35\u0a36\u0a38\u0a39\u0a59-\u0a5c\u0a5e\u0a72-\u0a74\u0a85-\u0a8d\u0a8f-\u0a91\u0a93-\u0aa8\u0aaa-\u0ab0\u0ab2\u0ab3\u0ab5-\u0ab9\u0abd\u0ad0\u0ae0\u0ae1\u0af9\u0b05-\u0b0c\u0b0f\u0b10\u0b13-\u0b28\u0b2a-\u0b30\u0b32\u0b33\u0b35-\u0b39\u0b3d\u0b5c\u0b5d\u0b5f-\u0b61\u0b71\u0b83\u0b85-\u0b8a\u0b8e-\u0b90\u0b92-\u0b95\u0b99\u0b9a\u0b9c\u0b9e\u0b9f\u0ba3\u0ba4\u0ba8-\u0baa\u0bae-\u0bb9\u0bd0\u0c05-\u0c0c\u0c0e-\u0c10\u0c12-\u0c28\u0c2a-\u0c39\u0c3d\u0c58-\u0c5a\u0c60\u0c61\u0c80\u0c85-\u0c8c\u0c8e-\u0c90\u0c92-\u0ca8\u0caa-\u0cb3\u0cb5-\u0cb9\u0cbd\u0cde\u0ce0\u0ce1\u0cf1\u0cf2\u0d05-\u0d0c\u0d0e-\u0d10\u0d12-\u0d3a\u0d3d\u0d4e\u0d54-\u0d56\u0d5f-\u0d61\u0d7a-\u0d7f\u0d85-\u0d96\u0d9a-\u0db1\u0db3-\u0dbb\u0dbd\u0dc0-\u0dc6\u0e01-\u0e30\u0e32\u0e33\u0e40-\u0e46\u0e81\u0e82\u0e84\u0e87\u0e88\u0e8a\u0e8d\u0e94-\u0e97\u0e99-\u0e9f\u0ea1-\u0ea3\u0ea5\u0ea7\u0eaa\u0eab\u0ead-\u0eb0\u0eb2\u0eb3\u0ebd\u0ec0-\u0ec4\u0ec6\u0edc-\u0edf\u0f00\u0f40-\u0f47\u0f49-\u0f6c\u0f88-\u0f8c\u1000-\u102a\u103f\u1050-\u1055\u105a-\u105d\u1061\u1065\u1066\u106e-\u1070\u1075-\u1081\u108e\u10a0-\u10c5\u10c7\u10cd\u10d0-\u10fa\u10fc-\u1248\u124a-\u124d\u1250-\u1256\u1258\u125a-\u125d\u1260-\u1288\u128a-\u128d\u1290-\u12b0\u12b2-\u12b5\u12b8-\u12be\u12c0\u12c2-\u12c5\u12c8-\u12d6\u12d8-\u1310\u1312-\u1315\u1318-\u135a\u1380-\u138f\u13a0-\u13f5\u13f8-\u13fd\u1401-\u166c\u166f-\u167f\u1681-\u169a\u16a0-\u16ea\u16ee-\u16f8\u1700-\u170c\u170e-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176c\u176e-\u1770\u1780-\u17b3\u17d7\u17dc\u1820-\u1877\u1880-\u18a8\u18aa\u18b0-\u18f5\u1900-\u191e\u1950-\u196d\u1970-\u1974\u1980-\u19ab\u19b0-\u19c9\u1a00-\u1a16\u1a20-\u1a54\u1aa7\u1b05-\u1b33\u1b45-\u1b4b\u1b83-\u1ba0\u1bae\u1baf\u1bba-\u1be5\u1c00-\u1c23\u1c4d-\u1c4f\u1c5a-\u1c7d\u1c80-\u1c88\u1ce9-\u1cec\u1cee-\u1cf1\u1cf5\u1cf6\u1d00-\u1dbf\u1e00-\u1f15\u1f18-\u1f1d\u1f20-\u1f45\u1f48-\u1f4d\u1f50-\u1f57\u1f59\u1f5b\u1f5d\u1f5f-\u1f7d\u1f80-\u1fb4\u1fb6-\u1fbc\u1fbe\u1fc2-\u1fc4\u1fc6-\u1fcc\u1fd0-\u1fd3\u1fd6-\u1fdb\u1fe0-\u1fec\u1ff2-\u1ff4\u1ff6-\u1ffc\u2071\u207f\u2090-\u209c\u2102\u2107\u210a-\u2113\u2115\u2118-\u211d\u2124\u2126\u2128\u212a-\u2139\u213c-\u213f\u2145-\u2149\u214e\u2160-\u2188\u2c00-\u2c2e\u2c30-\u2c5e\u2c60-\u2ce4\u2ceb-\u2cee\u2cf2\u2cf3\u2d00-\u2d25\u2d27\u2d2d\u2d30-\u2d67\u2d6f\u2d80-\u2d96\u2da0-\u2da6\u2da8-\u2dae\u2db0-\u2db6\u2db8-\u2dbe\u2dc0-\u2dc6\u2dc8-\u2dce\u2dd0-\u2dd6\u2dd8-\u2dde\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303c\u3041-\u3096\u309b-\u309f\u30a1-\u30fa\u30fc-\u30ff\u3105-\u312d\u3131-\u318e\u31a0-\u31ba\u31f0-\u31ff\u3400-\u4db5\u4e00-\u9fd5\ua000-\ua48c\ua4d0-\ua4fd\ua500-\ua60c\ua610-\ua61f\ua62a\ua62b\ua640-\ua66e\ua67f-\ua69d\ua6a0-\ua6ef\ua717-\ua71f\ua722-\ua788\ua78b-\ua7ae\ua7b0-\ua7b7\ua7f7-\ua801\ua803-\ua805\ua807-\ua80a\ua80c-\ua822\ua840-\ua873\ua882-\ua8b3\ua8f2-\ua8f7\ua8fb\ua8fd\ua90a-\ua925\ua930-\ua946\ua960-\ua97c\ua984-\ua9b2\ua9cf\ua9e0-\ua9e4\ua9e6-\ua9ef\ua9fa-\ua9fe\uaa00-\uaa28\uaa40-\uaa42\uaa44-\uaa4b\uaa60-\uaa76\uaa7a\uaa7e-\uaaaf\uaab1\uaab5\uaab6\uaab9-\uaabd\uaac0\uaac2\uaadb-\uaadd\uaae0-\uaaea\uaaf2-\uaaf4\uab01-\uab06\uab09-\uab0e\uab11-\uab16\uab20-\uab26\uab28-\uab2e\uab30-\uab5a\uab5c-\uab65\uab70-\uabe2\uac00-\ud7a3\ud7b0-\ud7c6\ud7cb-\ud7fb\uf900-\ufa6d\ufa70-\ufad9\ufb00-\ufb06\ufb13-\ufb17\ufb1d\ufb1f-\ufb28\ufb2a-\ufb36\ufb38-\ufb3c\ufb3e\ufb40\ufb41\ufb43\ufb44\ufb46-\ufbb1\ufbd3-\ufd3d\ufd50-\ufd8f\ufd92-\ufdc7\ufdf0-\ufdfb\ufe70-\ufe74\ufe76-\ufefc\uff21-\uff3a\uff41-\uff5a\uff66-\uffbe\uffc2-\uffc7\uffca-\uffcf\uffd2-\uffd7\uffda-\uffdc" var nonASCIIidentifierChars = "\u200c\u200d\xb7\u0300-\u036f\u0387\u0483-\u0487\u0591-\u05bd\u05bf\u05c1\u05c2\u05c4\u05c5\u05c7\u0610-\u061a\u064b-\u0669\u0670\u06d6-\u06dc\u06df-\u06e4\u06e7\u06e8\u06ea-\u06ed\u06f0-\u06f9\u0711\u0730-\u074a\u07a6-\u07b0\u07c0-\u07c9\u07eb-\u07f3\u0816-\u0819\u081b-\u0823\u0825-\u0827\u0829-\u082d\u0859-\u085b\u08d4-\u08e1\u08e3-\u0903\u093a-\u093c\u093e-\u094f\u0951-\u0957\u0962\u0963\u0966-\u096f\u0981-\u0983\u09bc\u09be-\u09c4\u09c7\u09c8\u09cb-\u09cd\u09d7\u09e2\u09e3\u09e6-\u09ef\u0a01-\u0a03\u0a3c\u0a3e-\u0a42\u0a47\u0a48\u0a4b-\u0a4d\u0a51\u0a66-\u0a71\u0a75\u0a81-\u0a83\u0abc\u0abe-\u0ac5\u0ac7-\u0ac9\u0acb-\u0acd\u0ae2\u0ae3\u0ae6-\u0aef\u0b01-\u0b03\u0b3c\u0b3e-\u0b44\u0b47\u0b48\u0b4b-\u0b4d\u0b56\u0b57\u0b62\u0b63\u0b66-\u0b6f\u0b82\u0bbe-\u0bc2\u0bc6-\u0bc8\u0bca-\u0bcd\u0bd7\u0be6-\u0bef\u0c00-\u0c03\u0c3e-\u0c44\u0c46-\u0c48\u0c4a-\u0c4d\u0c55\u0c56\u0c62\u0c63\u0c66-\u0c6f\u0c81-\u0c83\u0cbc\u0cbe-\u0cc4\u0cc6-\u0cc8\u0cca-\u0ccd\u0cd5\u0cd6\u0ce2\u0ce3\u0ce6-\u0cef\u0d01-\u0d03\u0d3e-\u0d44\u0d46-\u0d48\u0d4a-\u0d4d\u0d57\u0d62\u0d63\u0d66-\u0d6f\u0d82\u0d83\u0dca\u0dcf-\u0dd4\u0dd6\u0dd8-\u0ddf\u0de6-\u0def\u0df2\u0df3\u0e31\u0e34-\u0e3a\u0e47-\u0e4e\u0e50-\u0e59\u0eb1\u0eb4-\u0eb9\u0ebb\u0ebc\u0ec8-\u0ecd\u0ed0-\u0ed9\u0f18\u0f19\u0f20-\u0f29\u0f35\u0f37\u0f39\u0f3e\u0f3f\u0f71-\u0f84\u0f86\u0f87\u0f8d-\u0f97\u0f99-\u0fbc\u0fc6\u102b-\u103e\u1040-\u1049\u1056-\u1059\u105e-\u1060\u1062-\u1064\u1067-\u106d\u1071-\u1074\u1082-\u108d\u108f-\u109d\u135d-\u135f\u1369-\u1371\u1712-\u1714\u1732-\u1734\u1752\u1753\u1772\u1773\u17b4-\u17d3\u17dd\u17e0-\u17e9\u180b-\u180d\u1810-\u1819\u18a9\u1920-\u192b\u1930-\u193b\u1946-\u194f\u19d0-\u19da\u1a17-\u1a1b\u1a55-\u1a5e\u1a60-\u1a7c\u1a7f-\u1a89\u1a90-\u1a99\u1ab0-\u1abd\u1b00-\u1b04\u1b34-\u1b44\u1b50-\u1b59\u1b6b-\u1b73\u1b80-\u1b82\u1ba1-\u1bad\u1bb0-\u1bb9\u1be6-\u1bf3\u1c24-\u1c37\u1c40-\u1c49\u1c50-\u1c59\u1cd0-\u1cd2\u1cd4-\u1ce8\u1ced\u1cf2-\u1cf4\u1cf8\u1cf9\u1dc0-\u1df5\u1dfb-\u1dff\u203f\u2040\u2054\u20d0-\u20dc\u20e1\u20e5-\u20f0\u2cef-\u2cf1\u2d7f\u2de0-\u2dff\u302a-\u302f\u3099\u309a\ua620-\ua629\ua66f\ua674-\ua67d\ua69e\ua69f\ua6f0\ua6f1\ua802\ua806\ua80b\ua823-\ua827\ua880\ua881\ua8b4-\ua8c5\ua8d0-\ua8d9\ua8e0-\ua8f1\ua900-\ua909\ua926-\ua92d\ua947-\ua953\ua980-\ua983\ua9b3-\ua9c0\ua9d0-\ua9d9\ua9e5\ua9f0-\ua9f9\uaa29-\uaa36\uaa43\uaa4c\uaa4d\uaa50-\uaa59\uaa7b-\uaa7d\uaab0\uaab2-\uaab4\uaab7\uaab8\uaabe\uaabf\uaac1\uaaeb-\uaaef\uaaf5\uaaf6\uabe3-\uabea\uabec\uabed\uabf0-\uabf9\ufb1e\ufe00-\ufe0f\ufe20-\ufe2f\ufe33\ufe34\ufe4d-\ufe4f\uff10-\uff19\uff3f" var nonASCIIidentifierStart = new RegExp("[" + nonASCIIidentifierStartChars + "]") var nonASCIIidentifier = new RegExp("[" + nonASCIIidentifierStartChars + nonASCIIidentifierChars + "]") nonASCIIidentifierStartChars = nonASCIIidentifierChars = null // These are a run-length and offset encoded representation of the // >0xffff code points that are a valid part of identifiers. The // offset starts at 0x10000, and each pair of numbers represents an // offset to the next range, and then a size of the range. They were // generated by bin/generate-identifier-regex.js // eslint-disable-next-line comma-spacing var astralIdentifierStartCodes = [0,11,2,25,2,18,2,1,2,14,3,13,35,122,70,52,268,28,4,48,48,31,17,26,6,37,11,29,3,35,5,7,2,4,43,157,19,35,5,35,5,39,9,51,157,310,10,21,11,7,153,5,3,0,2,43,2,1,4,0,3,22,11,22,10,30,66,18,2,1,11,21,11,25,71,55,7,1,65,0,16,3,2,2,2,26,45,28,4,28,36,7,2,27,28,53,11,21,11,18,14,17,111,72,56,50,14,50,785,52,76,44,33,24,27,35,42,34,4,0,13,47,15,3,22,0,2,0,36,17,2,24,85,6,2,0,2,3,2,14,2,9,8,46,39,7,3,1,3,21,2,6,2,1,2,4,4,0,19,0,13,4,159,52,19,3,54,47,21,1,2,0,185,46,42,3,37,47,21,0,60,42,86,25,391,63,32,0,449,56,264,8,2,36,18,0,50,29,881,921,103,110,18,195,2749,1070,4050,582,8634,568,8,30,114,29,19,47,17,3,32,20,6,18,881,68,12,0,67,12,65,0,32,6124,20,754,9486,1,3071,106,6,12,4,8,8,9,5991,84,2,70,2,1,3,0,3,1,3,3,2,11,2,0,2,6,2,64,2,3,3,7,2,6,2,27,2,3,2,4,2,0,4,6,2,339,3,24,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,30,2,24,2,7,4149,196,60,67,1213,3,2,26,2,1,2,0,3,0,2,9,2,3,2,0,2,0,7,0,5,0,2,0,2,0,2,2,2,1,2,0,3,0,2,0,2,0,2,0,2,0,2,1,2,0,3,3,2,6,2,3,2,3,2,0,2,9,2,16,6,2,2,4,2,16,4421,42710,42,4148,12,221,3,5761,10591,541] // eslint-disable-next-line comma-spacing var astralIdentifierCodes = [509,0,227,0,150,4,294,9,1368,2,2,1,6,3,41,2,5,0,166,1,1306,2,54,14,32,9,16,3,46,10,54,9,7,2,37,13,2,9,52,0,13,2,49,13,10,2,4,9,83,11,7,0,161,11,6,9,7,3,57,0,2,6,3,1,3,2,10,0,11,1,3,6,4,4,193,17,10,9,87,19,13,9,214,6,3,8,28,1,83,16,16,9,82,12,9,9,84,14,5,9,423,9,838,7,2,7,17,9,57,21,2,13,19882,9,135,4,60,6,26,9,1016,45,17,3,19723,1,5319,4,4,5,9,7,3,6,31,3,149,2,1418,49,513,54,5,49,9,0,15,0,23,4,2,14,1361,6,2,16,3,6,2,1,2,4,2214,6,110,6,6,9,792487,239] // This has a complexity linear to the value of the code. The // assumption is that looking up astral identifier characters is // rare. function isInAstralSet(code, set) { var pos = 0x10000 for (var i = 0; i < set.length; i += 2) { pos += set[i] if (pos > code) return false pos += set[i + 1] if (pos >= code) return true } } // Test whether a given character code starts an identifier. function isIdentifierStart(code, astral) { if (code < 65) return code === 36 if (code < 91) return true if (code < 97) return code === 95 if (code < 123) return true if (code <= 0xffff) return code >= 0xaa && nonASCIIidentifierStart.test(String.fromCharCode(code)) if (astral === false) return false return isInAstralSet(code, astralIdentifierStartCodes) } // Test whether a given character is part of an identifier. function isIdentifierChar(code, astral) { if (code < 48) return code === 36 if (code < 58) return true if (code < 65) return false if (code < 91) return true if (code < 97) return code === 95 if (code < 123) return true if (code <= 0xffff) return code >= 0xaa && nonASCIIidentifier.test(String.fromCharCode(code)) if (astral === false) return false return isInAstralSet(code, astralIdentifierStartCodes) || isInAstralSet(code, astralIdentifierCodes) } // ## Token types // The assignment of fine-grained, information-carrying type objects // allows the tokenizer to store the information it has about a // token in a way that is very cheap for the parser to look up. // All token type variables start with an underscore, to make them // easy to recognize. // The `beforeExpr` property is used to disambiguate between regular // expressions and divisions. It is set on all token types that can // be followed by an expression (thus, a slash after them would be a // regular expression). // // The `startsExpr` property is used to check if the token ends a // `yield` expression. It is set on all token types that either can // directly start an expression (like a quotation mark) or can // continue an expression (like the body of a string). // // `isLoop` marks a keyword as starting a loop, which is important // to know when parsing a label, in order to allow or disallow // continue jumps to that label. var TokenType = function TokenType(label, conf) { if ( conf === void 0 ) conf = {}; this.label = label this.keyword = conf.keyword this.beforeExpr = !!conf.beforeExpr this.startsExpr = !!conf.startsExpr this.isLoop = !!conf.isLoop this.isAssign = !!conf.isAssign this.prefix = !!conf.prefix this.postfix = !!conf.postfix this.binop = conf.binop || null this.updateContext = null }; function binop(name, prec) { return new TokenType(name, {beforeExpr: true, binop: prec}) } var beforeExpr = {beforeExpr: true}; var startsExpr = {startsExpr: true}; // Map keyword names to token types. var keywordTypes = {} // Succinct definitions of keyword token types function kw(name, options) { if ( options === void 0 ) options = {}; options.keyword = name return keywordTypes[name] = new TokenType(name, options) } var tt = { num: new TokenType("num", startsExpr), regexp: new TokenType("regexp", startsExpr), string: new TokenType("string", startsExpr), name: new TokenType("name", startsExpr), eof: new TokenType("eof"), // Punctuation token types. bracketL: new TokenType("[", {beforeExpr: true, startsExpr: true}), bracketR: new TokenType("]"), braceL: new TokenType("{", {beforeExpr: true, startsExpr: true}), braceR: new TokenType("}"), parenL: new TokenType("(", {beforeExpr: true, startsExpr: true}), parenR: new TokenType(")"), comma: new TokenType(",", beforeExpr), semi: new TokenType(";", beforeExpr), colon: new TokenType(":", beforeExpr), dot: new TokenType("."), question: new TokenType("?", beforeExpr), arrow: new TokenType("=>", beforeExpr), template: new TokenType("template"), ellipsis: new TokenType("...", beforeExpr), backQuote: new TokenType("`", startsExpr), dollarBraceL: new TokenType("${", {beforeExpr: true, startsExpr: true}), // Operators. These carry several kinds of properties to help the // parser use them properly (the presence of these properties is // what categorizes them as operators). // // `binop`, when present, specifies that this operator is a binary // operator, and will refer to its precedence. // // `prefix` and `postfix` mark the operator as a prefix or postfix // unary operator. // // `isAssign` marks all of `=`, `+=`, `-=` etcetera, which act as // binary operators with a very low precedence, that should result // in AssignmentExpression nodes. eq: new TokenType("=", {beforeExpr: true, isAssign: true}), assign: new TokenType("_=", {beforeExpr: true, isAssign: true}), incDec: new TokenType("++/--", {prefix: true, postfix: true, startsExpr: true}), prefix: new TokenType("prefix", {beforeExpr: true, prefix: true, startsExpr: true}), logicalOR: binop("||", 1), logicalAND: binop("&&", 2), bitwiseOR: binop("|", 3), bitwiseXOR: binop("^", 4), bitwiseAND: binop("&", 5), equality: binop("==/!=", 6), relational: binop("", 7), bitShift: binop("<>", 8), plusMin: new TokenType("+/-", {beforeExpr: true, binop: 9, prefix: true, startsExpr: true}), modulo: binop("%", 10), star: binop("*", 10), slash: binop("/", 10), starstar: new TokenType("**", {beforeExpr: true}), // Keyword token types. _break: kw("break"), _case: kw("case", beforeExpr), _catch: kw("catch"), _continue: kw("continue"), _debugger: kw("debugger"), _default: kw("default", beforeExpr), _do: kw("do", {isLoop: true, beforeExpr: true}), _else: kw("else", beforeExpr), _finally: kw("finally"), _for: kw("for", {isLoop: true}), _function: kw("function", startsExpr), _if: kw("if"), _return: kw("return", beforeExpr), _switch: kw("switch"), _throw: kw("throw", beforeExpr), _try: kw("try"), _var: kw("var"), _const: kw("const"), _while: kw("while", {isLoop: true}), _with: kw("with"), _new: kw("new", {beforeExpr: true, startsExpr: true}), _this: kw("this", startsExpr), _super: kw("super", startsExpr), _class: kw("class"), _extends: kw("extends", beforeExpr), _export: kw("export"), _import: kw("import"), _null: kw("null", startsExpr), _true: kw("true", startsExpr), _false: kw("false", startsExpr), _in: kw("in", {beforeExpr: true, binop: 7}), _instanceof: kw("instanceof", {beforeExpr: true, binop: 7}), _typeof: kw("typeof", {beforeExpr: true, prefix: true, startsExpr: true}), _void: kw("void", {beforeExpr: true, prefix: true, startsExpr: true}), _delete: kw("delete", {beforeExpr: true, prefix: true, startsExpr: true}) } // Matches a whole line break (where CRLF is considered a single // line break). Used to count lines. var lineBreak = /\r\n?|\n|\u2028|\u2029/ var lineBreakG = new RegExp(lineBreak.source, "g") function isNewLine(code) { return code === 10 || code === 13 || code === 0x2028 || code === 0x2029 } var nonASCIIwhitespace = /[\u1680\u180e\u2000-\u200a\u202f\u205f\u3000\ufeff]/ var skipWhiteSpace = /(?:\s|\/\/.*|\/\*[^]*?\*\/)*/g var ref = Object.prototype; var hasOwnProperty = ref.hasOwnProperty; var toString = ref.toString; // Checks if an object has a property. function has(obj, propName) { return hasOwnProperty.call(obj, propName) } var isArray = Array.isArray || (function (obj) { return ( toString.call(obj) === "[object Array]" ); }) // These are used when `options.locations` is on, for the // `startLoc` and `endLoc` properties. var Position = function Position(line, col) { this.line = line this.column = col }; Position.prototype.offset = function offset (n) { return new Position(this.line, this.column + n) }; var SourceLocation = function SourceLocation(p, start, end) { this.start = start this.end = end if (p.sourceFile !== null) this.source = p.sourceFile }; // The `getLineInfo` function is mostly useful when the // `locations` option is off (for performance reasons) and you // want to find the line/column position for a given character // offset. `input` should be the code string that the offset refers // into. function getLineInfo(input, offset) { for (var line = 1, cur = 0;;) { lineBreakG.lastIndex = cur var match = lineBreakG.exec(input) if (match && match.index < offset) { ++line cur = match.index + match[0].length } else { return new Position(line, offset - cur) } } } // A second optional argument can be given to further configure // the parser process. These options are recognized: var defaultOptions = { // `ecmaVersion` indicates the ECMAScript version to parse. Must // be either 3, 5, 6 (2015), 7 (2016), or 8 (2017). This influences support // for strict mode, the set of reserved words, and support for // new syntax features. The default is 7. ecmaVersion: 7, // `sourceType` indicates the mode the code should be parsed in. // Can be either `"script"` or `"module"`. This influences global // strict mode and parsing of `import` and `export` declarations. sourceType: "script", // `onInsertedSemicolon` can be a callback that will be called // when a semicolon is automatically inserted. It will be passed // th position of the comma as an offset, and if `locations` is // enabled, it is given the location as a `{line, column}` object // as second argument. onInsertedSemicolon: null, // `onTrailingComma` is similar to `onInsertedSemicolon`, but for // trailing commas. onTrailingComma: null, // By default, reserved words are only enforced if ecmaVersion >= 5. // Set `allowReserved` to a boolean value to explicitly turn this on // an off. When this option has the value "never", reserved words // and keywords can also not be used as property names. allowReserved: null, // When enabled, a return at the top level is not considered an // error. allowReturnOutsideFunction: false, // When enabled, import/export statements are not constrained to // appearing at the top of the program. allowImportExportEverywhere: false, // When enabled, hashbang directive in the beginning of file // is allowed and treated as a line comment. allowHashBang: false, // When `locations` is on, `loc` properties holding objects with // `start` and `end` properties in `{line, column}` form (with // line being 1-based and column 0-based) will be attached to the // nodes. locations: false, // A function can be passed as `onToken` option, which will // cause Acorn to call that function with object in the same // format as tokens returned from `tokenizer().getToken()`. Note // that you are not allowed to call the parser from the // callback—that will corrupt its internal state. onToken: null, // A function can be passed as `onComment` option, which will // cause Acorn to call that function with `(block, text, start, // end)` parameters whenever a comment is skipped. `block` is a // boolean indicating whether this is a block (`/* */`) comment, // `text` is the content of the comment, and `start` and `end` are // character offsets that denote the start and end of the comment. // When the `locations` option is on, two more parameters are // passed, the full `{line, column}` locations of the start and // end of the comments. Note that you are not allowed to call the // parser from the callback—that will corrupt its internal state. onComment: null, // Nodes have their start and end characters offsets recorded in // `start` and `end` properties (directly on the node, rather than // the `loc` object, which holds line/column data. To also add a // [semi-standardized][range] `range` property holding a `[start, // end]` array with the same numbers, set the `ranges` option to // `true`. // // [range]: https://bugzilla.mozilla.org/show_bug.cgi?id=745678 ranges: false, // It is possible to parse multiple files into a single AST by // passing the tree produced by parsing the first file as // `program` option in subsequent parses. This will add the // toplevel forms of the parsed file to the `Program` (top) node // of an existing parse tree. program: null, // When `locations` is on, you can pass this to record the source // file in every node's `loc` object. sourceFile: null, // This value, if given, is stored in every node, whether // `locations` is on or off. directSourceFile: null, // When enabled, parenthesized expressions are represented by // (non-standard) ParenthesizedExpression nodes preserveParens: false, plugins: {} } // Interpret and default an options object function getOptions(opts) { var options = {} for (var opt in defaultOptions) options[opt] = opts && has(opts, opt) ? opts[opt] : defaultOptions[opt] if (options.ecmaVersion >= 2015) options.ecmaVersion -= 2009 if (options.allowReserved == null) options.allowReserved = options.ecmaVersion < 5 if (isArray(options.onToken)) { var tokens = options.onToken options.onToken = function (token) { return tokens.push(token); } } if (isArray(options.onComment)) options.onComment = pushComment(options, options.onComment) return options } function pushComment(options, array) { return function(block, text, start, end, startLoc, endLoc) { var comment = { type: block ? "Block" : "Line", value: text, start: start, end: end } if (options.locations) comment.loc = new SourceLocation(this, startLoc, endLoc) if (options.ranges) comment.range = [start, end] array.push(comment) } } // Registered plugins var plugins = {} function keywordRegexp(words) { return new RegExp("^(" + words.replace(/ /g, "|") + ")$") } var Parser = function Parser(options, input, startPos) { this.options = options = getOptions(options) this.sourceFile = options.sourceFile this.keywords = keywordRegexp(keywords[options.ecmaVersion >= 6 ? 6 : 5]) var reserved = "" if (!options.allowReserved) { for (var v = options.ecmaVersion;; v--) if (reserved = reservedWords[v]) break if (options.sourceType == "module") reserved += " await" } this.reservedWords = keywordRegexp(reserved) var reservedStrict = (reserved ? reserved + " " : "") + reservedWords.strict this.reservedWordsStrict = keywordRegexp(reservedStrict) this.reservedWordsStrictBind = keywordRegexp(reservedStrict + " " + reservedWords.strictBind) this.input = String(input) // Used to signal to callers of `readWord1` whether the word // contained any escape sequences. This is needed because words with // escape sequences must not be interpreted as keywords. this.containsEsc = false // Load plugins this.loadPlugins(options.plugins) // Set up token state // The current position of the tokenizer in the input. if (startPos) { this.pos = startPos this.lineStart = this.input.lastIndexOf("\n", startPos - 1) + 1 this.curLine = this.input.slice(0, this.lineStart).split(lineBreak).length } else { this.pos = this.lineStart = 0 this.curLine = 1 } // Properties of the current token: // Its type this.type = tt.eof // For tokens that include more information than their type, the value this.value = null // Its start and end offset this.start = this.end = this.pos // And, if locations are used, the {line, column} object // corresponding to those offsets this.startLoc = this.endLoc = this.curPosition() // Position information for the previous token this.lastTokEndLoc = this.lastTokStartLoc = null this.lastTokStart = this.lastTokEnd = this.pos // The context stack is used to superficially track syntactic // context to predict whether a regular expression is allowed in a // given position. this.context = this.initialContext() this.exprAllowed = true // Figure out if it's a module code. this.inModule = options.sourceType === "module" this.strict = this.inModule || this.strictDirective(this.pos) // Used to signify the start of a potential arrow function this.potentialArrowAt = -1 // Flags to track whether we are in a function, a generator, an async function. this.inFunction = this.inGenerator = this.inAsync = false // Positions to delayed-check that yield/await does not exist in default parameters. this.yieldPos = this.awaitPos = 0 // Labels in scope. this.labels = [] // If enabled, skip leading hashbang line. if (this.pos === 0 && options.allowHashBang && this.input.slice(0, 2) === "#!") this.skipLineComment(2) // Scope tracking for duplicate variable names (see scope.js) this.scopeStack = [] this.enterFunctionScope() }; // DEPRECATED Kept for backwards compatibility until 3.0 in case a plugin uses them Parser.prototype.isKeyword = function isKeyword (word) { return this.keywords.test(word) }; Parser.prototype.isReservedWord = function isReservedWord (word) { return this.reservedWords.test(word) }; Parser.prototype.extend = function extend (name, f) { this[name] = f(this[name]) }; Parser.prototype.loadPlugins = function loadPlugins (pluginConfigs) { var this$1 = this; for (var name in pluginConfigs) { var plugin = plugins[name] if (!plugin) throw new Error("Plugin '" + name + "' not found") plugin(this$1, pluginConfigs[name]) } }; Parser.prototype.parse = function parse () { var node = this.options.program || this.startNode() this.nextToken() return this.parseTopLevel(node) }; var pp = Parser.prototype // ## Parser utilities var literal = /^(?:'((?:[^']|\.)*)'|"((?:[^"]|\.)*)"|;)/ pp.strictDirective = function(start) { var this$1 = this; for (;;) { skipWhiteSpace.lastIndex = start start += skipWhiteSpace.exec(this$1.input)[0].length var match = literal.exec(this$1.input.slice(start)) if (!match) return false if ((match[1] || match[2]) == "use strict") return true start += match[0].length } } // Predicate that tests whether the next token is of the given // type, and if yes, consumes it as a side effect. pp.eat = function(type) { if (this.type === type) { this.next() return true } else { return false } } // Tests whether parsed token is a contextual keyword. pp.isContextual = function(name) { return this.type === tt.name && this.value === name } // Consumes contextual keyword if possible. pp.eatContextual = function(name) { return this.value === name && this.eat(tt.name) } // Asserts that following token is given contextual keyword. pp.expectContextual = function(name) { if (!this.eatContextual(name)) this.unexpected() } // Test whether a semicolon can be inserted at the current position. pp.canInsertSemicolon = function() { return this.type === tt.eof || this.type === tt.braceR || lineBreak.test(this.input.slice(this.lastTokEnd, this.start)) } pp.insertSemicolon = function() { if (this.canInsertSemicolon()) { if (this.options.onInsertedSemicolon) this.options.onInsertedSemicolon(this.lastTokEnd, this.lastTokEndLoc) return true } } // Consume a semicolon, or, failing that, see if we are allowed to // pretend that there is a semicolon at this position. pp.semicolon = function() { if (!this.eat(tt.semi) && !this.insertSemicolon()) this.unexpected() } pp.afterTrailingComma = function(tokType, notNext) { if (this.type == tokType) { if (this.options.onTrailingComma) this.options.onTrailingComma(this.lastTokStart, this.lastTokStartLoc) if (!notNext) this.next() return true } } // Expect a token of a given type. If found, consume it, otherwise, // raise an unexpected token error. pp.expect = function(type) { this.eat(type) || this.unexpected() } // Raise an unexpected token error. pp.unexpected = function(pos) { this.raise(pos != null ? pos : this.start, "Unexpected token") } var DestructuringErrors = function DestructuringErrors() { this.shorthandAssign = this.trailingComma = this.parenthesizedAssign = this.parenthesizedBind = -1 }; pp.checkPatternErrors = function(refDestructuringErrors, isAssign) { if (!refDestructuringErrors) return if (refDestructuringErrors.trailingComma > -1) this.raiseRecoverable(refDestructuringErrors.trailingComma, "Comma is not permitted after the rest element") var parens = isAssign ? refDestructuringErrors.parenthesizedAssign : refDestructuringErrors.parenthesizedBind if (parens > -1) this.raiseRecoverable(parens, "Parenthesized pattern") } pp.checkExpressionErrors = function(refDestructuringErrors, andThrow) { var pos = refDestructuringErrors ? refDestructuringErrors.shorthandAssign : -1 if (!andThrow) return pos >= 0 if (pos > -1) this.raise(pos, "Shorthand property assignments are valid only in destructuring patterns") } pp.checkYieldAwaitInDefaultParams = function() { if (this.yieldPos && (!this.awaitPos || this.yieldPos < this.awaitPos)) this.raise(this.yieldPos, "Yield expression cannot be a default value") if (this.awaitPos) this.raise(this.awaitPos, "Await expression cannot be a default value") } pp.isSimpleAssignTarget = function(expr) { if (expr.type === "ParenthesizedExpression") return this.isSimpleAssignTarget(expr.expression) return expr.type === "Identifier" || expr.type === "MemberExpression" } var pp$1 = Parser.prototype // ### Statement parsing // Parse a program. Initializes the parser, reads any number of // statements, and wraps them in a Program node. Optionally takes a // `program` argument. If present, the statements will be appended // to its body instead of creating a new node. pp$1.parseTopLevel = function(node) { var this$1 = this; var exports = {} if (!node.body) node.body = [] while (this.type !== tt.eof) { var stmt = this$1.parseStatement(true, true, exports) node.body.push(stmt) } this.next() if (this.options.ecmaVersion >= 6) { node.sourceType = this.options.sourceType } return this.finishNode(node, "Program") } var loopLabel = {kind: "loop"}; var switchLabel = {kind: "switch"}; pp$1.isLet = function() { if (this.type !== tt.name || this.options.ecmaVersion < 6 || this.value != "let") return false skipWhiteSpace.lastIndex = this.pos var skip = skipWhiteSpace.exec(this.input) var next = this.pos + skip[0].length, nextCh = this.input.charCodeAt(next) if (nextCh === 91 || nextCh == 123) return true // '{' and '[' if (isIdentifierStart(nextCh, true)) { var pos = next + 1 while (isIdentifierChar(this.input.charCodeAt(pos), true)) ++pos var ident = this.input.slice(next, pos) if (!this.isKeyword(ident)) return true } return false } // check 'async [no LineTerminator here] function' // - 'async /*foo*/ function' is OK. // - 'async /*\n*/ function' is invalid. pp$1.isAsyncFunction = function() { if (this.type !== tt.name || this.options.ecmaVersion < 8 || this.value != "async") return false skipWhiteSpace.lastIndex = this.pos var skip = skipWhiteSpace.exec(this.input) var next = this.pos + skip[0].length return !lineBreak.test(this.input.slice(this.pos, next)) && this.input.slice(next, next + 8) === "function" && (next + 8 == this.input.length || !isIdentifierChar(this.input.charAt(next + 8))) } // Parse a single statement. // // If expecting a statement and finding a slash operator, parse a // regular expression literal. This is to handle cases like // `if (foo) /blah/.exec(foo)`, where looking at the previous token // does not help. pp$1.parseStatement = function(declaration, topLevel, exports) { var starttype = this.type, node = this.startNode(), kind if (this.isLet()) { starttype = tt._var kind = "let" } // Most types of statements are recognized by the keyword they // start with. Many are trivial to parse, some require a bit of // complexity. switch (starttype) { case tt._break: case tt._continue: return this.parseBreakContinueStatement(node, starttype.keyword) case tt._debugger: return this.parseDebuggerStatement(node) case tt._do: return this.parseDoStatement(node) case tt._for: return this.parseForStatement(node) case tt._function: if (!declaration && this.options.ecmaVersion >= 6) this.unexpected() return this.parseFunctionStatement(node, false) case tt._class: if (!declaration) this.unexpected() return this.parseClass(node, true) case tt._if: return this.parseIfStatement(node) case tt._return: return this.parseReturnStatement(node) case tt._switch: return this.parseSwitchStatement(node) case tt._throw: return this.parseThrowStatement(node) case tt._try: return this.parseTryStatement(node) case tt._const: case tt._var: kind = kind || this.value if (!declaration && kind != "var") this.unexpected() return this.parseVarStatement(node, kind) case tt._while: return this.parseWhileStatement(node) case tt._with: return this.parseWithStatement(node) case tt.braceL: return this.parseBlock() case tt.semi: return this.parseEmptyStatement(node) case tt._export: case tt._import: if (!this.options.allowImportExportEverywhere) { if (!topLevel) this.raise(this.start, "'import' and 'export' may only appear at the top level") if (!this.inModule) this.raise(this.start, "'import' and 'export' may appear only with 'sourceType: module'") } return starttype === tt._import ? this.parseImport(node) : this.parseExport(node, exports) // If the statement does not start with a statement keyword or a // brace, it's an ExpressionStatement or LabeledStatement. We // simply start parsing an expression, and afterwards, if the // next token is a colon and the expression was a simple // Identifier node, we switch to interpreting it as a label. default: if (this.isAsyncFunction() && declaration) { this.next() return this.parseFunctionStatement(node, true) } var maybeName = this.value, expr = this.parseExpression() if (starttype === tt.name && expr.type === "Identifier" && this.eat(tt.colon)) return this.parseLabeledStatement(node, maybeName, expr) else return this.parseExpressionStatement(node, expr) } } pp$1.parseBreakContinueStatement = function(node, keyword) { var this$1 = this; var isBreak = keyword == "break" this.next() if (this.eat(tt.semi) || this.insertSemicolon()) node.label = null else if (this.type !== tt.name) this.unexpected() else { node.label = this.parseIdent() this.semicolon() } // Verify that there is an actual destination to break or // continue to. var i = 0 for (; i < this.labels.length; ++i) { var lab = this$1.labels[i] if (node.label == null || lab.name === node.label.name) { if (lab.kind != null && (isBreak || lab.kind === "loop")) break if (node.label && isBreak) break } } if (i === this.labels.length) this.raise(node.start, "Unsyntactic " + keyword) return this.finishNode(node, isBreak ? "BreakStatement" : "ContinueStatement") } pp$1.parseDebuggerStatement = function(node) { this.next() this.semicolon() return this.finishNode(node, "DebuggerStatement") } pp$1.parseDoStatement = function(node) { this.next() this.labels.push(loopLabel) node.body = this.parseStatement(false) this.labels.pop() this.expect(tt._while) node.test = this.parseParenExpression() if (this.options.ecmaVersion >= 6) this.eat(tt.semi) else this.semicolon() return this.finishNode(node, "DoWhileStatement") } // Disambiguating between a `for` and a `for`/`in` or `for`/`of` // loop is non-trivial. Basically, we have to parse the init `var` // statement or expression, disallowing the `in` operator (see // the second parameter to `parseExpression`), and then check // whether the next token is `in` or `of`. When there is no init // part (semicolon immediately after the opening parenthesis), it // is a regular `for` loop. pp$1.parseForStatement = function(node) { this.next() this.labels.push(loopLabel) this.enterLexicalScope() this.expect(tt.parenL) if (this.type === tt.semi) return this.parseFor(node, null) var isLet = this.isLet() if (this.type === tt._var || this.type === tt._const || isLet) { var init$1 = this.startNode(), kind = isLet ? "let" : this.value this.next() this.parseVar(init$1, true, kind) this.finishNode(init$1, "VariableDeclaration") if ((this.type === tt._in || (this.options.ecmaVersion >= 6 && this.isContextual("of"))) && init$1.declarations.length === 1 && !(kind !== "var" && init$1.declarations[0].init)) return this.parseForIn(node, init$1) return this.parseFor(node, init$1) } var refDestructuringErrors = new DestructuringErrors var init = this.parseExpression(true, refDestructuringErrors) if (this.type === tt._in || (this.options.ecmaVersion >= 6 && this.isContextual("of"))) { this.toAssignable(init) this.checkLVal(init) this.checkPatternErrors(refDestructuringErrors, true) return this.parseForIn(node, init) } else { this.checkExpressionErrors(refDestructuringErrors, true) } return this.parseFor(node, init) } pp$1.parseFunctionStatement = function(node, isAsync) { this.next() return this.parseFunction(node, true, false, isAsync) } pp$1.isFunction = function() { return this.type === tt._function || this.isAsyncFunction() } pp$1.parseIfStatement = function(node) { this.next() node.test = this.parseParenExpression() // allow function declarations in branches, but only in non-strict mode node.consequent = this.parseStatement(!this.strict && this.isFunction()) node.alternate = this.eat(tt._else) ? this.parseStatement(!this.strict && this.isFunction()) : null return this.finishNode(node, "IfStatement") } pp$1.parseReturnStatement = function(node) { if (!this.inFunction && !this.options.allowReturnOutsideFunction) this.raise(this.start, "'return' outside of function") this.next() // In `return` (and `break`/`continue`), the keywords with // optional arguments, we eagerly look for a semicolon or the // possibility to insert one. if (this.eat(tt.semi) || this.insertSemicolon()) node.argument = null else { node.argument = this.parseExpression(); this.semicolon() } return this.finishNode(node, "ReturnStatement") } pp$1.parseSwitchStatement = function(node) { var this$1 = this; this.next() node.discriminant = this.parseParenExpression() node.cases = [] this.expect(tt.braceL) this.labels.push(switchLabel) this.enterLexicalScope() // Statements under must be grouped (by label) in SwitchCase // nodes. `cur` is used to keep the node that we are currently // adding statements to. var cur for (var sawDefault = false; this.type != tt.braceR;) { if (this$1.type === tt._case || this$1.type === tt._default) { var isCase = this$1.type === tt._case if (cur) this$1.finishNode(cur, "SwitchCase") node.cases.push(cur = this$1.startNode()) cur.consequent = [] this$1.next() if (isCase) { cur.test = this$1.parseExpression() } else { if (sawDefault) this$1.raiseRecoverable(this$1.lastTokStart, "Multiple default clauses") sawDefault = true cur.test = null } this$1.expect(tt.colon) } else { if (!cur) this$1.unexpected() cur.consequent.push(this$1.parseStatement(true)) } } this.exitLexicalScope() if (cur) this.finishNode(cur, "SwitchCase") this.next() // Closing brace this.labels.pop() return this.finishNode(node, "SwitchStatement") } pp$1.parseThrowStatement = function(node) { this.next() if (lineBreak.test(this.input.slice(this.lastTokEnd, this.start))) this.raise(this.lastTokEnd, "Illegal newline after throw") node.argument = this.parseExpression() this.semicolon() return this.finishNode(node, "ThrowStatement") } // Reused empty array added for node fields that are always empty. var empty = [] pp$1.parseTryStatement = function(node) { this.next() node.block = this.parseBlock() node.handler = null if (this.type === tt._catch) { var clause = this.startNode() this.next() this.expect(tt.parenL) clause.param = this.parseBindingAtom() this.enterLexicalScope() this.checkLVal(clause.param, "let") this.expect(tt.parenR) clause.body = this.parseBlock(false) this.exitLexicalScope() node.handler = this.finishNode(clause, "CatchClause") } node.finalizer = this.eat(tt._finally) ? this.parseBlock() : null if (!node.handler && !node.finalizer) this.raise(node.start, "Missing catch or finally clause") return this.finishNode(node, "TryStatement") } pp$1.parseVarStatement = function(node, kind) { this.next() this.parseVar(node, false, kind) this.semicolon() return this.finishNode(node, "VariableDeclaration") } pp$1.parseWhileStatement = function(node) { this.next() node.test = this.parseParenExpression() this.labels.push(loopLabel) node.body = this.parseStatement(false) this.labels.pop() return this.finishNode(node, "WhileStatement") } pp$1.parseWithStatement = function(node) { if (this.strict) this.raise(this.start, "'with' in strict mode") this.next() node.object = this.parseParenExpression() node.body = this.parseStatement(false) return this.finishNode(node, "WithStatement") } pp$1.parseEmptyStatement = function(node) { this.next() return this.finishNode(node, "EmptyStatement") } pp$1.parseLabeledStatement = function(node, maybeName, expr) { var this$1 = this; for (var i = 0; i < this.labels.length; ++i) if (this$1.labels[i].name === maybeName) this$1.raise(expr.start, "Label '" + maybeName + "' is already declared") var kind = this.type.isLoop ? "loop" : this.type === tt._switch ? "switch" : null for (var i$1 = this.labels.length - 1; i$1 >= 0; i$1--) { var label = this$1.labels[i$1] if (label.statementStart == node.start) { label.statementStart = this$1.start label.kind = kind } else break } this.labels.push({name: maybeName, kind: kind, statementStart: this.start}) node.body = this.parseStatement(true) if (node.body.type == "ClassDeclaration" || node.body.type == "VariableDeclaration" && node.body.kind != "var" || node.body.type == "FunctionDeclaration" && (this.strict || node.body.generator)) this.raiseRecoverable(node.body.start, "Invalid labeled declaration") this.labels.pop() node.label = expr return this.finishNode(node, "LabeledStatement") } pp$1.parseExpressionStatement = function(node, expr) { node.expression = expr this.semicolon() return this.finishNode(node, "ExpressionStatement") } // Parse a semicolon-enclosed block of statements, handling `"use // strict"` declarations when `allowStrict` is true (used for // function bodies). pp$1.parseBlock = function(createNewLexicalScope) { var this$1 = this; if ( createNewLexicalScope === void 0 ) createNewLexicalScope = true; var node = this.startNode() node.body = [] this.expect(tt.braceL) if (createNewLexicalScope) { this.enterLexicalScope() } while (!this.eat(tt.braceR)) { var stmt = this$1.parseStatement(true) node.body.push(stmt) } if (createNewLexicalScope) { this.exitLexicalScope() } return this.finishNode(node, "BlockStatement") } // Parse a regular `for` loop. The disambiguation code in // `parseStatement` will already have parsed the init statement or // expression. pp$1.parseFor = function(node, init) { node.init = init this.expect(tt.semi) node.test = this.type === tt.semi ? null : this.parseExpression() this.expect(tt.semi) node.update = this.type === tt.parenR ? null : this.parseExpression() this.expect(tt.parenR) this.exitLexicalScope() node.body = this.parseStatement(false) this.labels.pop() return this.finishNode(node, "ForStatement") } // Parse a `for`/`in` and `for`/`of` loop, which are almost // same from parser's perspective. pp$1.parseForIn = function(node, init) { var type = this.type === tt._in ? "ForInStatement" : "ForOfStatement" this.next() node.left = init node.right = this.parseExpression() this.expect(tt.parenR) this.exitLexicalScope() node.body = this.parseStatement(false) this.labels.pop() return this.finishNode(node, type) } // Parse a list of variable declarations. pp$1.parseVar = function(node, isFor, kind) { var this$1 = this; node.declarations = [] node.kind = kind for (;;) { var decl = this$1.startNode() this$1.parseVarId(decl, kind) if (this$1.eat(tt.eq)) { decl.init = this$1.parseMaybeAssign(isFor) } else if (kind === "const" && !(this$1.type === tt._in || (this$1.options.ecmaVersion >= 6 && this$1.isContextual("of")))) { this$1.unexpected() } else if (decl.id.type != "Identifier" && !(isFor && (this$1.type === tt._in || this$1.isContextual("of")))) { this$1.raise(this$1.lastTokEnd, "Complex binding patterns require an initialization value") } else { decl.init = null } node.declarations.push(this$1.finishNode(decl, "VariableDeclarator")) if (!this$1.eat(tt.comma)) break } return node } pp$1.parseVarId = function(decl, kind) { decl.id = this.parseBindingAtom(kind) this.checkLVal(decl.id, kind, false) } // Parse a function declaration or literal (depending on the // `isStatement` parameter). pp$1.parseFunction = function(node, isStatement, allowExpressionBody, isAsync) { this.initFunction(node) if (this.options.ecmaVersion >= 6 && !isAsync) node.generator = this.eat(tt.star) if (this.options.ecmaVersion >= 8) node.async = !!isAsync if (isStatement) { node.id = isStatement === "nullableID" && this.type != tt.name ? null : this.parseIdent() if (node.id) { this.checkLVal(node.id, "var") } } var oldInGen = this.inGenerator, oldInAsync = this.inAsync, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldInFunc = this.inFunction this.inGenerator = node.generator this.inAsync = node.async this.yieldPos = 0 this.awaitPos = 0 this.inFunction = true this.enterFunctionScope() if (!isStatement) node.id = this.type == tt.name ? this.parseIdent() : null this.parseFunctionParams(node) this.parseFunctionBody(node, allowExpressionBody) this.inGenerator = oldInGen this.inAsync = oldInAsync this.yieldPos = oldYieldPos this.awaitPos = oldAwaitPos this.inFunction = oldInFunc return this.finishNode(node, isStatement ? "FunctionDeclaration" : "FunctionExpression") } pp$1.parseFunctionParams = function(node) { this.expect(tt.parenL) node.params = this.parseBindingList(tt.parenR, false, this.options.ecmaVersion >= 8, true) this.checkYieldAwaitInDefaultParams() } // Parse a class declaration or literal (depending on the // `isStatement` parameter). pp$1.parseClass = function(node, isStatement) { var this$1 = this; this.next() this.parseClassId(node, isStatement) this.parseClassSuper(node) var classBody = this.startNode() var hadConstructor = false classBody.body = [] this.expect(tt.braceL) while (!this.eat(tt.braceR)) { if (this$1.eat(tt.semi)) continue var method = this$1.startNode() var isGenerator = this$1.eat(tt.star) var isAsync = false var isMaybeStatic = this$1.type === tt.name && this$1.value === "static" this$1.parsePropertyName(method) method.static = isMaybeStatic && this$1.type !== tt.parenL if (method.static) { if (isGenerator) this$1.unexpected() isGenerator = this$1.eat(tt.star) this$1.parsePropertyName(method) } if (this$1.options.ecmaVersion >= 8 && !isGenerator && !method.computed && method.key.type === "Identifier" && method.key.name === "async" && this$1.type !== tt.parenL && !this$1.canInsertSemicolon()) { isAsync = true this$1.parsePropertyName(method) } method.kind = "method" var isGetSet = false if (!method.computed) { var key = method.key; if (!isGenerator && !isAsync && key.type === "Identifier" && this$1.type !== tt.parenL && (key.name === "get" || key.name === "set")) { isGetSet = true method.kind = key.name key = this$1.parsePropertyName(method) } if (!method.static && (key.type === "Identifier" && key.name === "constructor" || key.type === "Literal" && key.value === "constructor")) { if (hadConstructor) this$1.raise(key.start, "Duplicate constructor in the same class") if (isGetSet) this$1.raise(key.start, "Constructor can't have get/set modifier") if (isGenerator) this$1.raise(key.start, "Constructor can't be a generator") if (isAsync) this$1.raise(key.start, "Constructor can't be an async method") method.kind = "constructor" hadConstructor = true } } this$1.parseClassMethod(classBody, method, isGenerator, isAsync) if (isGetSet) { var paramCount = method.kind === "get" ? 0 : 1 if (method.value.params.length !== paramCount) { var start = method.value.start if (method.kind === "get") this$1.raiseRecoverable(start, "getter should have no params") else this$1.raiseRecoverable(start, "setter should have exactly one param") } else { if (method.kind === "set" && method.value.params[0].type === "RestElement") this$1.raiseRecoverable(method.value.params[0].start, "Setter cannot use rest params") } } } node.body = this.finishNode(classBody, "ClassBody") return this.finishNode(node, isStatement ? "ClassDeclaration" : "ClassExpression") } pp$1.parseClassMethod = function(classBody, method, isGenerator, isAsync) { method.value = this.parseMethod(isGenerator, isAsync) classBody.body.push(this.finishNode(method, "MethodDefinition")) } pp$1.parseClassId = function(node, isStatement) { node.id = this.type === tt.name ? this.parseIdent() : isStatement === true ? this.unexpected() : null } pp$1.parseClassSuper = function(node) { node.superClass = this.eat(tt._extends) ? this.parseExprSubscripts() : null } // Parses module export declaration. pp$1.parseExport = function(node, exports) { var this$1 = this; this.next() // export * from '...' if (this.eat(tt.star)) { this.expectContextual("from") node.source = this.type === tt.string ? this.parseExprAtom() : this.unexpected() this.semicolon() return this.finishNode(node, "ExportAllDeclaration") } if (this.eat(tt._default)) { // export default ... this.checkExport(exports, "default", this.lastTokStart) var isAsync if (this.type === tt._function || (isAsync = this.isAsyncFunction())) { var fNode = this.startNode() this.next() if (isAsync) this.next() node.declaration = this.parseFunction(fNode, "nullableID", false, isAsync) } else if (this.type === tt._class) { var cNode = this.startNode() node.declaration = this.parseClass(cNode, "nullableID") } else { node.declaration = this.parseMaybeAssign() this.semicolon() } return this.finishNode(node, "ExportDefaultDeclaration") } // export var|const|let|function|class ... if (this.shouldParseExportStatement()) { node.declaration = this.parseStatement(true) if (node.declaration.type === "VariableDeclaration") this.checkVariableExport(exports, node.declaration.declarations) else this.checkExport(exports, node.declaration.id.name, node.declaration.id.start) node.specifiers = [] node.source = null } else { // export { x, y as z } [from '...'] node.declaration = null node.specifiers = this.parseExportSpecifiers(exports) if (this.eatContextual("from")) { node.source = this.type === tt.string ? this.parseExprAtom() : this.unexpected() } else { // check for keywords used as local names for (var i = 0; i < node.specifiers.length; i++) { if (this$1.keywords.test(node.specifiers[i].local.name) || this$1.reservedWords.test(node.specifiers[i].local.name)) { this$1.unexpected(node.specifiers[i].local.start) } } node.source = null } this.semicolon() } return this.finishNode(node, "ExportNamedDeclaration") } pp$1.checkExport = function(exports, name, pos) { if (!exports) return if (has(exports, name)) this.raiseRecoverable(pos, "Duplicate export '" + name + "'") exports[name] = true } pp$1.checkPatternExport = function(exports, pat) { var this$1 = this; var type = pat.type if (type == "Identifier") this.checkExport(exports, pat.name, pat.start) else if (type == "ObjectPattern") for (var i = 0; i < pat.properties.length; ++i) this$1.checkPatternExport(exports, pat.properties[i].value) else if (type == "ArrayPattern") for (var i$1 = 0; i$1 < pat.elements.length; ++i$1) { var elt = pat.elements[i$1] if (elt) this$1.checkPatternExport(exports, elt) } else if (type == "AssignmentPattern") this.checkPatternExport(exports, pat.left) else if (type == "ParenthesizedExpression") this.checkPatternExport(exports, pat.expression) } pp$1.checkVariableExport = function(exports, decls) { var this$1 = this; if (!exports) return for (var i = 0; i < decls.length; i++) this$1.checkPatternExport(exports, decls[i].id) } pp$1.shouldParseExportStatement = function() { return this.type.keyword === "var" || this.type.keyword === "const" || this.type.keyword === "class" || this.type.keyword === "function" || this.isLet() || this.isAsyncFunction() } // Parses a comma-separated list of module exports. pp$1.parseExportSpecifiers = function(exports) { var this$1 = this; var nodes = [], first = true // export { x, y as z } [from '...'] this.expect(tt.braceL) while (!this.eat(tt.braceR)) { if (!first) { this$1.expect(tt.comma) if (this$1.afterTrailingComma(tt.braceR)) break } else first = false var node = this$1.startNode() node.local = this$1.parseIdent(true) node.exported = this$1.eatContextual("as") ? this$1.parseIdent(true) : node.local this$1.checkExport(exports, node.exported.name, node.exported.start) nodes.push(this$1.finishNode(node, "ExportSpecifier")) } return nodes } // Parses import declaration. pp$1.parseImport = function(node) { this.next() // import '...' if (this.type === tt.string) { node.specifiers = empty node.source = this.parseExprAtom() } else { node.specifiers = this.parseImportSpecifiers() this.expectContextual("from") node.source = this.type === tt.string ? this.parseExprAtom() : this.unexpected() } this.semicolon() return this.finishNode(node, "ImportDeclaration") } // Parses a comma-separated list of module imports. pp$1.parseImportSpecifiers = function() { var this$1 = this; var nodes = [], first = true if (this.type === tt.name) { // import defaultObj, { x, y as z } from '...' var node = this.startNode() node.local = this.parseIdent() this.checkLVal(node.local, "let") nodes.push(this.finishNode(node, "ImportDefaultSpecifier")) if (!this.eat(tt.comma)) return nodes } if (this.type === tt.star) { var node$1 = this.startNode() this.next() this.expectContextual("as") node$1.local = this.parseIdent() this.checkLVal(node$1.local, "let") nodes.push(this.finishNode(node$1, "ImportNamespaceSpecifier")) return nodes } this.expect(tt.braceL) while (!this.eat(tt.braceR)) { if (!first) { this$1.expect(tt.comma) if (this$1.afterTrailingComma(tt.braceR)) break } else first = false var node$2 = this$1.startNode() node$2.imported = this$1.parseIdent(true) if (this$1.eatContextual("as")) { node$2.local = this$1.parseIdent() } else { node$2.local = node$2.imported if (this$1.isKeyword(node$2.local.name)) this$1.unexpected(node$2.local.start) if (this$1.reservedWordsStrict.test(node$2.local.name)) this$1.raiseRecoverable(node$2.local.start, "The keyword '" + node$2.local.name + "' is reserved") } this$1.checkLVal(node$2.local, "let") nodes.push(this$1.finishNode(node$2, "ImportSpecifier")) } return nodes } var pp$2 = Parser.prototype // Convert existing expression atom to assignable pattern // if possible. pp$2.toAssignable = function(node, isBinding) { var this$1 = this; if (this.options.ecmaVersion >= 6 && node) { switch (node.type) { case "Identifier": if (this.inAsync && node.name === "await") this.raise(node.start, "Can not use 'await' as identifier inside an async function") break case "ObjectPattern": case "ArrayPattern": break case "ObjectExpression": node.type = "ObjectPattern" for (var i = 0; i < node.properties.length; i++) { var prop = node.properties[i] if (prop.kind !== "init") this$1.raise(prop.key.start, "Object pattern can't contain getter or setter") this$1.toAssignable(prop.value, isBinding) } break case "ArrayExpression": node.type = "ArrayPattern" this.toAssignableList(node.elements, isBinding) break case "AssignmentExpression": if (node.operator === "=") { node.type = "AssignmentPattern" delete node.operator this.toAssignable(node.left, isBinding) // falls through to AssignmentPattern } else { this.raise(node.left.end, "Only '=' operator can be used for specifying default value.") break } case "AssignmentPattern": break case "ParenthesizedExpression": node.expression = this.toAssignable(node.expression, isBinding) break case "MemberExpression": if (!isBinding) break default: this.raise(node.start, "Assigning to rvalue") } } return node } // Convert list of expression atoms to binding list. pp$2.toAssignableList = function(exprList, isBinding) { var this$1 = this; var end = exprList.length if (end) { var last = exprList[end - 1] if (last && last.type == "RestElement") { --end } else if (last && last.type == "SpreadElement") { last.type = "RestElement" var arg = last.argument this.toAssignable(arg, isBinding) if (arg.type !== "Identifier" && arg.type !== "MemberExpression" && arg.type !== "ArrayPattern") this.unexpected(arg.start) --end } if (isBinding && last && last.type === "RestElement" && last.argument.type !== "Identifier") this.unexpected(last.argument.start) } for (var i = 0; i < end; i++) { var elt = exprList[i] if (elt) this$1.toAssignable(elt, isBinding) } return exprList } // Parses spread element. pp$2.parseSpread = function(refDestructuringErrors) { var node = this.startNode() this.next() node.argument = this.parseMaybeAssign(false, refDestructuringErrors) return this.finishNode(node, "SpreadElement") } pp$2.parseRest = function(allowNonIdent) { var node = this.startNode() this.next() // RestElement inside of a function parameter must be an identifier if (allowNonIdent) node.argument = this.type === tt.name ? this.parseIdent() : this.unexpected() else node.argument = this.type === tt.name || this.type === tt.bracketL ? this.parseBindingAtom() : this.unexpected() return this.finishNode(node, "RestElement") } // Parses lvalue (assignable) atom. pp$2.parseBindingAtom = function() { if (this.options.ecmaVersion < 6) return this.parseIdent() switch (this.type) { case tt.name: return this.parseIdent() case tt.bracketL: var node = this.startNode() this.next() node.elements = this.parseBindingList(tt.bracketR, true, true) return this.finishNode(node, "ArrayPattern") case tt.braceL: return this.parseObj(true) default: this.unexpected() } } pp$2.parseBindingList = function(close, allowEmpty, allowTrailingComma, allowNonIdent) { var this$1 = this; var elts = [], first = true while (!this.eat(close)) { if (first) first = false else this$1.expect(tt.comma) if (allowEmpty && this$1.type === tt.comma) { elts.push(null) } else if (allowTrailingComma && this$1.afterTrailingComma(close)) { break } else if (this$1.type === tt.ellipsis) { var rest = this$1.parseRest(allowNonIdent) this$1.parseBindingListItem(rest) elts.push(rest) if (this$1.type === tt.comma) this$1.raise(this$1.start, "Comma is not permitted after the rest element") this$1.expect(close) break } else { var elem = this$1.parseMaybeDefault(this$1.start, this$1.startLoc) this$1.parseBindingListItem(elem) elts.push(elem) } } return elts } pp$2.parseBindingListItem = function(param) { return param } // Parses assignment pattern around given atom if possible. pp$2.parseMaybeDefault = function(startPos, startLoc, left) { left = left || this.parseBindingAtom() if (this.options.ecmaVersion < 6 || !this.eat(tt.eq)) return left var node = this.startNodeAt(startPos, startLoc) node.left = left node.right = this.parseMaybeAssign() return this.finishNode(node, "AssignmentPattern") } // Verify that a node is an lval — something that can be assigned // to. // bindingType can be either: // 'var' indicating that the lval creates a 'var' binding // 'let' indicating that the lval creates a lexical ('let' or 'const') binding // 'none' indicating that the binding should be checked for illegal identifiers, but not for duplicate references pp$2.checkLVal = function(expr, bindingType, checkClashes) { var this$1 = this; switch (expr.type) { case "Identifier": if (this.strict && this.reservedWordsStrictBind.test(expr.name)) this.raiseRecoverable(expr.start, (bindingType ? "Binding " : "Assigning to ") + expr.name + " in strict mode") if (checkClashes) { if (has(checkClashes, expr.name)) this.raiseRecoverable(expr.start, "Argument name clash") checkClashes[expr.name] = true } if (bindingType && bindingType !== "none") { if ( bindingType === "var" && !this.canDeclareVarName(expr.name) || bindingType !== "var" && !this.canDeclareLexicalName(expr.name) ) { this.raiseRecoverable(expr.start, ("Identifier '" + (expr.name) + "' has already been declared")) } if (bindingType === "var") { this.declareVarName(expr.name) } else { this.declareLexicalName(expr.name) } } break case "MemberExpression": if (bindingType) this.raiseRecoverable(expr.start, (bindingType ? "Binding" : "Assigning to") + " member expression") break case "ObjectPattern": for (var i = 0; i < expr.properties.length; i++) this$1.checkLVal(expr.properties[i].value, bindingType, checkClashes) break case "ArrayPattern": for (var i$1 = 0; i$1 < expr.elements.length; i$1++) { var elem = expr.elements[i$1] if (elem) this$1.checkLVal(elem, bindingType, checkClashes) } break case "AssignmentPattern": this.checkLVal(expr.left, bindingType, checkClashes) break case "RestElement": this.checkLVal(expr.argument, bindingType, checkClashes) break case "ParenthesizedExpression": this.checkLVal(expr.expression, bindingType, checkClashes) break default: this.raise(expr.start, (bindingType ? "Binding" : "Assigning to") + " rvalue") } } // A recursive descent parser operates by defining functions for all // syntactic elements, and recursively calling those, each function // advancing the input stream and returning an AST node. Precedence // of constructs (for example, the fact that `!x[1]` means `!(x[1])` // instead of `(!x)[1]` is handled by the fact that the parser // function that parses unary prefix operators is called first, and // in turn calls the function that parses `[]` subscripts — that // way, it'll receive the node for `x[1]` already parsed, and wraps // *that* in the unary operator node. // // Acorn uses an [operator precedence parser][opp] to handle binary // operator precedence, because it is much more compact than using // the technique outlined above, which uses different, nesting // functions to specify precedence, for all of the ten binary // precedence levels that JavaScript defines. // // [opp]: http://en.wikipedia.org/wiki/Operator-precedence_parser var pp$3 = Parser.prototype // Check if property name clashes with already added. // Object/class getters and setters are not allowed to clash — // either with each other or with an init property — and in // strict mode, init properties are also not allowed to be repeated. pp$3.checkPropClash = function(prop, propHash) { if (this.options.ecmaVersion >= 6 && (prop.computed || prop.method || prop.shorthand)) return var key = prop.key; var name switch (key.type) { case "Identifier": name = key.name; break case "Literal": name = String(key.value); break default: return } var kind = prop.kind; if (this.options.ecmaVersion >= 6) { if (name === "__proto__" && kind === "init") { if (propHash.proto) this.raiseRecoverable(key.start, "Redefinition of __proto__ property") propHash.proto = true } return } name = "$" + name var other = propHash[name] if (other) { var redefinition if (kind === "init") { redefinition = this.strict && other.init || other.get || other.set } else { redefinition = other.init || other[kind] } if (redefinition) this.raiseRecoverable(key.start, "Redefinition of property") } else { other = propHash[name] = { init: false, get: false, set: false } } other[kind] = true } // ### Expression parsing // These nest, from the most general expression type at the top to // 'atomic', nondivisible expression types at the bottom. Most of // the functions will simply let the function(s) below them parse, // and, *if* the syntactic construct they handle is present, wrap // the AST node that the inner parser gave them in another node. // Parse a full expression. The optional arguments are used to // forbid the `in` operator (in for loops initalization expressions) // and provide reference for storing '=' operator inside shorthand // property assignment in contexts where both object expression // and object pattern might appear (so it's possible to raise // delayed syntax error at correct position). pp$3.parseExpression = function(noIn, refDestructuringErrors) { var this$1 = this; var startPos = this.start, startLoc = this.startLoc var expr = this.parseMaybeAssign(noIn, refDestructuringErrors) if (this.type === tt.comma) { var node = this.startNodeAt(startPos, startLoc) node.expressions = [expr] while (this.eat(tt.comma)) node.expressions.push(this$1.parseMaybeAssign(noIn, refDestructuringErrors)) return this.finishNode(node, "SequenceExpression") } return expr } // Parse an assignment expression. This includes applications of // operators like `+=`. pp$3.parseMaybeAssign = function(noIn, refDestructuringErrors, afterLeftParse) { if (this.inGenerator && this.isContextual("yield")) return this.parseYield() var ownDestructuringErrors = false, oldParenAssign = -1, oldTrailingComma = -1 if (refDestructuringErrors) { oldParenAssign = refDestructuringErrors.parenthesizedAssign oldTrailingComma = refDestructuringErrors.trailingComma refDestructuringErrors.parenthesizedAssign = refDestructuringErrors.trailingComma = -1 } else { refDestructuringErrors = new DestructuringErrors ownDestructuringErrors = true } var startPos = this.start, startLoc = this.startLoc if (this.type == tt.parenL || this.type == tt.name) this.potentialArrowAt = this.start var left = this.parseMaybeConditional(noIn, refDestructuringErrors) if (afterLeftParse) left = afterLeftParse.call(this, left, startPos, startLoc) if (this.type.isAssign) { this.checkPatternErrors(refDestructuringErrors, true) if (!ownDestructuringErrors) DestructuringErrors.call(refDestructuringErrors) var node = this.startNodeAt(startPos, startLoc) node.operator = this.value node.left = this.type === tt.eq ? this.toAssignable(left) : left refDestructuringErrors.shorthandAssign = -1 // reset because shorthand default was used correctly this.checkLVal(left) this.next() node.right = this.parseMaybeAssign(noIn) return this.finishNode(node, "AssignmentExpression") } else { if (ownDestructuringErrors) this.checkExpressionErrors(refDestructuringErrors, true) } if (oldParenAssign > -1) refDestructuringErrors.parenthesizedAssign = oldParenAssign if (oldTrailingComma > -1) refDestructuringErrors.trailingComma = oldTrailingComma return left } // Parse a ternary conditional (`?:`) operator. pp$3.parseMaybeConditional = function(noIn, refDestructuringErrors) { var startPos = this.start, startLoc = this.startLoc var expr = this.parseExprOps(noIn, refDestructuringErrors) if (this.checkExpressionErrors(refDestructuringErrors)) return expr if (this.eat(tt.question)) { var node = this.startNodeAt(startPos, startLoc) node.test = expr node.consequent = this.parseMaybeAssign() this.expect(tt.colon) node.alternate = this.parseMaybeAssign(noIn) return this.finishNode(node, "ConditionalExpression") } return expr } // Start the precedence parser. pp$3.parseExprOps = function(noIn, refDestructuringErrors) { var startPos = this.start, startLoc = this.startLoc var expr = this.parseMaybeUnary(refDestructuringErrors, false) if (this.checkExpressionErrors(refDestructuringErrors)) return expr return expr.start == startPos && expr.type === "ArrowFunctionExpression" ? expr : this.parseExprOp(expr, startPos, startLoc, -1, noIn) } // Parse binary operators with the operator precedence parsing // algorithm. `left` is the left-hand side of the operator. // `minPrec` provides context that allows the function to stop and // defer further parser to one of its callers when it encounters an // operator that has a lower precedence than the set it is parsing. pp$3.parseExprOp = function(left, leftStartPos, leftStartLoc, minPrec, noIn) { var prec = this.type.binop if (prec != null && (!noIn || this.type !== tt._in)) { if (prec > minPrec) { var logical = this.type === tt.logicalOR || this.type === tt.logicalAND var op = this.value this.next() var startPos = this.start, startLoc = this.startLoc var right = this.parseExprOp(this.parseMaybeUnary(null, false), startPos, startLoc, prec, noIn) var node = this.buildBinary(leftStartPos, leftStartLoc, left, right, op, logical) return this.parseExprOp(node, leftStartPos, leftStartLoc, minPrec, noIn) } } return left } pp$3.buildBinary = function(startPos, startLoc, left, right, op, logical) { var node = this.startNodeAt(startPos, startLoc) node.left = left node.operator = op node.right = right return this.finishNode(node, logical ? "LogicalExpression" : "BinaryExpression") } // Parse unary operators, both prefix and postfix. pp$3.parseMaybeUnary = function(refDestructuringErrors, sawUnary) { var this$1 = this; var startPos = this.start, startLoc = this.startLoc, expr if (this.inAsync && this.isContextual("await")) { expr = this.parseAwait(refDestructuringErrors) sawUnary = true } else if (this.type.prefix) { var node = this.startNode(), update = this.type === tt.incDec node.operator = this.value node.prefix = true this.next() node.argument = this.parseMaybeUnary(null, true) this.checkExpressionErrors(refDestructuringErrors, true) if (update) this.checkLVal(node.argument) else if (this.strict && node.operator === "delete" && node.argument.type === "Identifier") this.raiseRecoverable(node.start, "Deleting local variable in strict mode") else sawUnary = true expr = this.finishNode(node, update ? "UpdateExpression" : "UnaryExpression") } else { expr = this.parseExprSubscripts(refDestructuringErrors) if (this.checkExpressionErrors(refDestructuringErrors)) return expr while (this.type.postfix && !this.canInsertSemicolon()) { var node$1 = this$1.startNodeAt(startPos, startLoc) node$1.operator = this$1.value node$1.prefix = false node$1.argument = expr this$1.checkLVal(expr) this$1.next() expr = this$1.finishNode(node$1, "UpdateExpression") } } if (!sawUnary && this.eat(tt.starstar)) return this.buildBinary(startPos, startLoc, expr, this.parseMaybeUnary(null, false), "**", false) else return expr } // Parse call, dot, and `[]`-subscript expressions. pp$3.parseExprSubscripts = function(refDestructuringErrors) { var startPos = this.start, startLoc = this.startLoc var expr = this.parseExprAtom(refDestructuringErrors) var skipArrowSubscripts = expr.type === "ArrowFunctionExpression" && this.input.slice(this.lastTokStart, this.lastTokEnd) !== ")" if (this.checkExpressionErrors(refDestructuringErrors) || skipArrowSubscripts) return expr var result = this.parseSubscripts(expr, startPos, startLoc) if (refDestructuringErrors && result.type === "MemberExpression") { if (refDestructuringErrors.parenthesizedAssign >= result.start) refDestructuringErrors.parenthesizedAssign = -1 if (refDestructuringErrors.parenthesizedBind >= result.start) refDestructuringErrors.parenthesizedBind = -1 } return result } pp$3.parseSubscripts = function(base, startPos, startLoc, noCalls) { var this$1 = this; var maybeAsyncArrow = this.options.ecmaVersion >= 8 && base.type === "Identifier" && base.name === "async" && this.lastTokEnd == base.end && !this.canInsertSemicolon() for (var computed;;) { if ((computed = this$1.eat(tt.bracketL)) || this$1.eat(tt.dot)) { var node = this$1.startNodeAt(startPos, startLoc) node.object = base node.property = computed ? this$1.parseExpression() : this$1.parseIdent(true) node.computed = !!computed if (computed) this$1.expect(tt.bracketR) base = this$1.finishNode(node, "MemberExpression") } else if (!noCalls && this$1.eat(tt.parenL)) { var refDestructuringErrors = new DestructuringErrors, oldYieldPos = this$1.yieldPos, oldAwaitPos = this$1.awaitPos this$1.yieldPos = 0 this$1.awaitPos = 0 var exprList = this$1.parseExprList(tt.parenR, this$1.options.ecmaVersion >= 8, false, refDestructuringErrors) if (maybeAsyncArrow && !this$1.canInsertSemicolon() && this$1.eat(tt.arrow)) { this$1.checkPatternErrors(refDestructuringErrors, false) this$1.checkYieldAwaitInDefaultParams() this$1.yieldPos = oldYieldPos this$1.awaitPos = oldAwaitPos return this$1.parseArrowExpression(this$1.startNodeAt(startPos, startLoc), exprList, true) } this$1.checkExpressionErrors(refDestructuringErrors, true) this$1.yieldPos = oldYieldPos || this$1.yieldPos this$1.awaitPos = oldAwaitPos || this$1.awaitPos var node$1 = this$1.startNodeAt(startPos, startLoc) node$1.callee = base node$1.arguments = exprList base = this$1.finishNode(node$1, "CallExpression") } else if (this$1.type === tt.backQuote) { var node$2 = this$1.startNodeAt(startPos, startLoc) node$2.tag = base node$2.quasi = this$1.parseTemplate() base = this$1.finishNode(node$2, "TaggedTemplateExpression") } else { return base } } } // Parse an atomic expression — either a single token that is an // expression, an expression started by a keyword like `function` or // `new`, or an expression wrapped in punctuation like `()`, `[]`, // or `{}`. pp$3.parseExprAtom = function(refDestructuringErrors) { var node, canBeArrow = this.potentialArrowAt == this.start switch (this.type) { case tt._super: if (!this.inFunction) this.raise(this.start, "'super' outside of function or class") case tt._this: var type = this.type === tt._this ? "ThisExpression" : "Super" node = this.startNode() this.next() return this.finishNode(node, type) case tt.name: var startPos = this.start, startLoc = this.startLoc var id = this.parseIdent(this.type !== tt.name) if (this.options.ecmaVersion >= 8 && id.name === "async" && !this.canInsertSemicolon() && this.eat(tt._function)) return this.parseFunction(this.startNodeAt(startPos, startLoc), false, false, true) if (canBeArrow && !this.canInsertSemicolon()) { if (this.eat(tt.arrow)) return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], false) if (this.options.ecmaVersion >= 8 && id.name === "async" && this.type === tt.name) { id = this.parseIdent() if (this.canInsertSemicolon() || !this.eat(tt.arrow)) this.unexpected() return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), [id], true) } } return id case tt.regexp: var value = this.value node = this.parseLiteral(value.value) node.regex = {pattern: value.pattern, flags: value.flags} return node case tt.num: case tt.string: return this.parseLiteral(this.value) case tt._null: case tt._true: case tt._false: node = this.startNode() node.value = this.type === tt._null ? null : this.type === tt._true node.raw = this.type.keyword this.next() return this.finishNode(node, "Literal") case tt.parenL: var start = this.start, expr = this.parseParenAndDistinguishExpression(canBeArrow) if (refDestructuringErrors) { if (refDestructuringErrors.parenthesizedAssign < 0 && !this.isSimpleAssignTarget(expr)) refDestructuringErrors.parenthesizedAssign = start if (refDestructuringErrors.parenthesizedBind < 0) refDestructuringErrors.parenthesizedBind = start } return expr case tt.bracketL: node = this.startNode() this.next() node.elements = this.parseExprList(tt.bracketR, true, true, refDestructuringErrors) return this.finishNode(node, "ArrayExpression") case tt.braceL: return this.parseObj(false, refDestructuringErrors) case tt._function: node = this.startNode() this.next() return this.parseFunction(node, false) case tt._class: return this.parseClass(this.startNode(), false) case tt._new: return this.parseNew() case tt.backQuote: return this.parseTemplate() default: this.unexpected() } } pp$3.parseLiteral = function(value) { var node = this.startNode() node.value = value node.raw = this.input.slice(this.start, this.end) this.next() return this.finishNode(node, "Literal") } pp$3.parseParenExpression = function() { this.expect(tt.parenL) var val = this.parseExpression() this.expect(tt.parenR) return val } pp$3.parseParenAndDistinguishExpression = function(canBeArrow) { var this$1 = this; var startPos = this.start, startLoc = this.startLoc, val, allowTrailingComma = this.options.ecmaVersion >= 8 if (this.options.ecmaVersion >= 6) { this.next() var innerStartPos = this.start, innerStartLoc = this.startLoc var exprList = [], first = true, lastIsComma = false var refDestructuringErrors = new DestructuringErrors, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, spreadStart, innerParenStart this.yieldPos = 0 this.awaitPos = 0 while (this.type !== tt.parenR) { first ? first = false : this$1.expect(tt.comma) if (allowTrailingComma && this$1.afterTrailingComma(tt.parenR, true)) { lastIsComma = true break } else if (this$1.type === tt.ellipsis) { spreadStart = this$1.start exprList.push(this$1.parseParenItem(this$1.parseRest())) if (this$1.type === tt.comma) this$1.raise(this$1.start, "Comma is not permitted after the rest element") break } else { if (this$1.type === tt.parenL && !innerParenStart) { innerParenStart = this$1.start } exprList.push(this$1.parseMaybeAssign(false, refDestructuringErrors, this$1.parseParenItem)) } } var innerEndPos = this.start, innerEndLoc = this.startLoc this.expect(tt.parenR) if (canBeArrow && !this.canInsertSemicolon() && this.eat(tt.arrow)) { this.checkPatternErrors(refDestructuringErrors, false) this.checkYieldAwaitInDefaultParams() if (innerParenStart) this.unexpected(innerParenStart) this.yieldPos = oldYieldPos this.awaitPos = oldAwaitPos return this.parseParenArrowList(startPos, startLoc, exprList) } if (!exprList.length || lastIsComma) this.unexpected(this.lastTokStart) if (spreadStart) this.unexpected(spreadStart) this.checkExpressionErrors(refDestructuringErrors, true) this.yieldPos = oldYieldPos || this.yieldPos this.awaitPos = oldAwaitPos || this.awaitPos if (exprList.length > 1) { val = this.startNodeAt(innerStartPos, innerStartLoc) val.expressions = exprList this.finishNodeAt(val, "SequenceExpression", innerEndPos, innerEndLoc) } else { val = exprList[0] } } else { val = this.parseParenExpression() } if (this.options.preserveParens) { var par = this.startNodeAt(startPos, startLoc) par.expression = val return this.finishNode(par, "ParenthesizedExpression") } else { return val } } pp$3.parseParenItem = function(item) { return item } pp$3.parseParenArrowList = function(startPos, startLoc, exprList) { return this.parseArrowExpression(this.startNodeAt(startPos, startLoc), exprList) } // New's precedence is slightly tricky. It must allow its argument to // be a `[]` or dot subscript expression, but not a call — at least, // not without wrapping it in parentheses. Thus, it uses the noCalls // argument to parseSubscripts to prevent it from consuming the // argument list. var empty$1 = [] pp$3.parseNew = function() { var node = this.startNode() var meta = this.parseIdent(true) if (this.options.ecmaVersion >= 6 && this.eat(tt.dot)) { node.meta = meta node.property = this.parseIdent(true) if (node.property.name !== "target") this.raiseRecoverable(node.property.start, "The only valid meta property for new is new.target") if (!this.inFunction) this.raiseRecoverable(node.start, "new.target can only be used in functions") return this.finishNode(node, "MetaProperty") } var startPos = this.start, startLoc = this.startLoc node.callee = this.parseSubscripts(this.parseExprAtom(), startPos, startLoc, true) if (this.eat(tt.parenL)) node.arguments = this.parseExprList(tt.parenR, this.options.ecmaVersion >= 8, false) else node.arguments = empty$1 return this.finishNode(node, "NewExpression") } // Parse template expression. pp$3.parseTemplateElement = function() { var elem = this.startNode() elem.value = { raw: this.input.slice(this.start, this.end).replace(/\r\n?/g, "\n"), cooked: this.value } this.next() elem.tail = this.type === tt.backQuote return this.finishNode(elem, "TemplateElement") } pp$3.parseTemplate = function() { var this$1 = this; var node = this.startNode() this.next() node.expressions = [] var curElt = this.parseTemplateElement() node.quasis = [curElt] while (!curElt.tail) { this$1.expect(tt.dollarBraceL) node.expressions.push(this$1.parseExpression()) this$1.expect(tt.braceR) node.quasis.push(curElt = this$1.parseTemplateElement()) } this.next() return this.finishNode(node, "TemplateLiteral") } // Parse an object literal or binding pattern. pp$3.parseObj = function(isPattern, refDestructuringErrors) { var this$1 = this; var node = this.startNode(), first = true, propHash = {} node.properties = [] this.next() while (!this.eat(tt.braceR)) { if (!first) { this$1.expect(tt.comma) if (this$1.afterTrailingComma(tt.braceR)) break } else first = false var prop = this$1.startNode(), isGenerator, isAsync, startPos, startLoc if (this$1.options.ecmaVersion >= 6) { prop.method = false prop.shorthand = false if (isPattern || refDestructuringErrors) { startPos = this$1.start startLoc = this$1.startLoc } if (!isPattern) isGenerator = this$1.eat(tt.star) } this$1.parsePropertyName(prop) if (!isPattern && this$1.options.ecmaVersion >= 8 && !isGenerator && !prop.computed && prop.key.type === "Identifier" && prop.key.name === "async" && this$1.type !== tt.parenL && this$1.type !== tt.colon && !this$1.canInsertSemicolon()) { isAsync = true this$1.parsePropertyName(prop, refDestructuringErrors) } else { isAsync = false } this$1.parsePropertyValue(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors) this$1.checkPropClash(prop, propHash) node.properties.push(this$1.finishNode(prop, "Property")) } return this.finishNode(node, isPattern ? "ObjectPattern" : "ObjectExpression") } pp$3.parsePropertyValue = function(prop, isPattern, isGenerator, isAsync, startPos, startLoc, refDestructuringErrors) { if ((isGenerator || isAsync) && this.type === tt.colon) this.unexpected() if (this.eat(tt.colon)) { prop.value = isPattern ? this.parseMaybeDefault(this.start, this.startLoc) : this.parseMaybeAssign(false, refDestructuringErrors) prop.kind = "init" } else if (this.options.ecmaVersion >= 6 && this.type === tt.parenL) { if (isPattern) this.unexpected() prop.kind = "init" prop.method = true prop.value = this.parseMethod(isGenerator, isAsync) } else if (this.options.ecmaVersion >= 5 && !prop.computed && prop.key.type === "Identifier" && (prop.key.name === "get" || prop.key.name === "set") && (this.type != tt.comma && this.type != tt.braceR)) { if (isGenerator || isAsync || isPattern) this.unexpected() prop.kind = prop.key.name this.parsePropertyName(prop) prop.value = this.parseMethod(false) var paramCount = prop.kind === "get" ? 0 : 1 if (prop.value.params.length !== paramCount) { var start = prop.value.start if (prop.kind === "get") this.raiseRecoverable(start, "getter should have no params") else this.raiseRecoverable(start, "setter should have exactly one param") } else { if (prop.kind === "set" && prop.value.params[0].type === "RestElement") this.raiseRecoverable(prop.value.params[0].start, "Setter cannot use rest params") } } else if (this.options.ecmaVersion >= 6 && !prop.computed && prop.key.type === "Identifier") { if (this.keywords.test(prop.key.name) || (this.strict ? this.reservedWordsStrict : this.reservedWords).test(prop.key.name) || (this.inGenerator && prop.key.name == "yield") || (this.inAsync && prop.key.name == "await")) this.raiseRecoverable(prop.key.start, "'" + prop.key.name + "' can not be used as shorthand property") prop.kind = "init" if (isPattern) { prop.value = this.parseMaybeDefault(startPos, startLoc, prop.key) } else if (this.type === tt.eq && refDestructuringErrors) { if (refDestructuringErrors.shorthandAssign < 0) refDestructuringErrors.shorthandAssign = this.start prop.value = this.parseMaybeDefault(startPos, startLoc, prop.key) } else { prop.value = prop.key } prop.shorthand = true } else this.unexpected() } pp$3.parsePropertyName = function(prop) { if (this.options.ecmaVersion >= 6) { if (this.eat(tt.bracketL)) { prop.computed = true prop.key = this.parseMaybeAssign() this.expect(tt.bracketR) return prop.key } else { prop.computed = false } } return prop.key = this.type === tt.num || this.type === tt.string ? this.parseExprAtom() : this.parseIdent(true) } // Initialize empty function node. pp$3.initFunction = function(node) { node.id = null if (this.options.ecmaVersion >= 6) { node.generator = false node.expression = false } if (this.options.ecmaVersion >= 8) node.async = false } // Parse object or class method. pp$3.parseMethod = function(isGenerator, isAsync) { var node = this.startNode(), oldInGen = this.inGenerator, oldInAsync = this.inAsync, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldInFunc = this.inFunction this.initFunction(node) if (this.options.ecmaVersion >= 6) node.generator = isGenerator if (this.options.ecmaVersion >= 8) node.async = !!isAsync this.inGenerator = node.generator this.inAsync = node.async this.yieldPos = 0 this.awaitPos = 0 this.inFunction = true this.enterFunctionScope() this.expect(tt.parenL) node.params = this.parseBindingList(tt.parenR, false, this.options.ecmaVersion >= 8) this.checkYieldAwaitInDefaultParams() this.parseFunctionBody(node, false) this.inGenerator = oldInGen this.inAsync = oldInAsync this.yieldPos = oldYieldPos this.awaitPos = oldAwaitPos this.inFunction = oldInFunc return this.finishNode(node, "FunctionExpression") } // Parse arrow function expression with given parameters. pp$3.parseArrowExpression = function(node, params, isAsync) { var oldInGen = this.inGenerator, oldInAsync = this.inAsync, oldYieldPos = this.yieldPos, oldAwaitPos = this.awaitPos, oldInFunc = this.inFunction this.enterFunctionScope() this.initFunction(node) if (this.options.ecmaVersion >= 8) node.async = !!isAsync this.inGenerator = false this.inAsync = node.async this.yieldPos = 0 this.awaitPos = 0 this.inFunction = true node.params = this.toAssignableList(params, true) this.parseFunctionBody(node, true) this.inGenerator = oldInGen this.inAsync = oldInAsync this.yieldPos = oldYieldPos this.awaitPos = oldAwaitPos this.inFunction = oldInFunc return this.finishNode(node, "ArrowFunctionExpression") } // Parse function body and check parameters. pp$3.parseFunctionBody = function(node, isArrowFunction) { var isExpression = isArrowFunction && this.type !== tt.braceL var oldStrict = this.strict, useStrict = false if (isExpression) { node.body = this.parseMaybeAssign() node.expression = true this.checkParams(node, false) } else { var nonSimple = this.options.ecmaVersion >= 7 && !this.isSimpleParamList(node.params) if (!oldStrict || nonSimple) { useStrict = this.strictDirective(this.end) // If this is a strict mode function, verify that argument names // are not repeated, and it does not try to bind the words `eval` // or `arguments`. if (useStrict && nonSimple) this.raiseRecoverable(node.start, "Illegal 'use strict' directive in function with non-simple parameter list") } // Start a new scope with regard to labels and the `inFunction` // flag (restore them to their old value afterwards). var oldLabels = this.labels this.labels = [] if (useStrict) this.strict = true // Add the params to varDeclaredNames to ensure that an error is thrown // if a let/const declaration in the function clashes with one of the params. this.checkParams(node, !oldStrict && !useStrict && !isArrowFunction && this.isSimpleParamList(node.params)) node.body = this.parseBlock(false) node.expression = false this.labels = oldLabels } this.exitFunctionScope() if (this.strict && node.id) { // Ensure the function name isn't a forbidden identifier in strict mode, e.g. 'eval' this.checkLVal(node.id, "none") } this.strict = oldStrict } pp$3.isSimpleParamList = function(params) { for (var i = 0; i < params.length; i++) if (params[i].type !== "Identifier") return false return true } // Checks function params for various disallowed patterns such as using "eval" // or "arguments" and duplicate parameters. pp$3.checkParams = function(node, allowDuplicates) { var this$1 = this; var nameHash = {} for (var i = 0; i < node.params.length; i++) this$1.checkLVal(node.params[i], "var", allowDuplicates ? null : nameHash) } // Parses a comma-separated list of expressions, and returns them as // an array. `close` is the token type that ends the list, and // `allowEmpty` can be turned on to allow subsequent commas with // nothing in between them to be parsed as `null` (which is needed // for array literals). pp$3.parseExprList = function(close, allowTrailingComma, allowEmpty, refDestructuringErrors) { var this$1 = this; var elts = [], first = true while (!this.eat(close)) { if (!first) { this$1.expect(tt.comma) if (allowTrailingComma && this$1.afterTrailingComma(close)) break } else first = false var elt if (allowEmpty && this$1.type === tt.comma) elt = null else if (this$1.type === tt.ellipsis) { elt = this$1.parseSpread(refDestructuringErrors) if (refDestructuringErrors && this$1.type === tt.comma && refDestructuringErrors.trailingComma < 0) refDestructuringErrors.trailingComma = this$1.start } else { elt = this$1.parseMaybeAssign(false, refDestructuringErrors) } elts.push(elt) } return elts } // Parse the next token as an identifier. If `liberal` is true (used // when parsing properties), it will also convert keywords into // identifiers. pp$3.parseIdent = function(liberal) { var node = this.startNode() if (liberal && this.options.allowReserved == "never") liberal = false if (this.type === tt.name) { if (!liberal && (this.strict ? this.reservedWordsStrict : this.reservedWords).test(this.value) && (this.options.ecmaVersion >= 6 || this.input.slice(this.start, this.end).indexOf("\\") == -1)) this.raiseRecoverable(this.start, "The keyword '" + this.value + "' is reserved") if (this.inGenerator && this.value === "yield") this.raiseRecoverable(this.start, "Can not use 'yield' as identifier inside a generator") if (this.inAsync && this.value === "await") this.raiseRecoverable(this.start, "Can not use 'await' as identifier inside an async function") node.name = this.value } else if (liberal && this.type.keyword) { node.name = this.type.keyword } else { this.unexpected() } this.next() return this.finishNode(node, "Identifier") } // Parses yield expression inside generator. pp$3.parseYield = function() { if (!this.yieldPos) this.yieldPos = this.start var node = this.startNode() this.next() if (this.type == tt.semi || this.canInsertSemicolon() || (this.type != tt.star && !this.type.startsExpr)) { node.delegate = false node.argument = null } else { node.delegate = this.eat(tt.star) node.argument = this.parseMaybeAssign() } return this.finishNode(node, "YieldExpression") } pp$3.parseAwait = function() { if (!this.awaitPos) this.awaitPos = this.start var node = this.startNode() this.next() node.argument = this.parseMaybeUnary(null, true) return this.finishNode(node, "AwaitExpression") } var pp$4 = Parser.prototype // This function is used to raise exceptions on parse errors. It // takes an offset integer (into the current `input`) to indicate // the location of the error, attaches the position to the end // of the error message, and then raises a `SyntaxError` with that // message. pp$4.raise = function(pos, message) { var loc = getLineInfo(this.input, pos) message += " (" + loc.line + ":" + loc.column + ")" var err = new SyntaxError(message) err.pos = pos; err.loc = loc; err.raisedAt = this.pos throw err } pp$4.raiseRecoverable = pp$4.raise pp$4.curPosition = function() { if (this.options.locations) { return new Position(this.curLine, this.pos - this.lineStart) } } var pp$5 = Parser.prototype // Object.assign polyfill var assign = Object.assign || function(target) { var sources = [], len = arguments.length - 1; while ( len-- > 0 ) sources[ len ] = arguments[ len + 1 ]; for (var i = 0; i < sources.length; i++) { var source = sources[i] for (var key in source) { if (has(source, key)) { target[key] = source[key] } } } return target } // The functions in this module keep track of declared variables in the current scope in order to detect duplicate variable names. pp$5.enterFunctionScope = function() { // var: a hash of var-declared names in the current lexical scope // lexical: a hash of lexically-declared names in the current lexical scope // childVar: a hash of var-declared names in all child lexical scopes of the current lexical scope (within the current function scope) // parentLexical: a hash of lexically-declared names in all parent lexical scopes of the current lexical scope (within the current function scope) this.scopeStack.push({var: {}, lexical: {}, childVar: {}, parentLexical: {}}) } pp$5.exitFunctionScope = function() { this.scopeStack.pop() } pp$5.enterLexicalScope = function() { var parentScope = this.scopeStack[this.scopeStack.length - 1] var childScope = {var: {}, lexical: {}, childVar: {}, parentLexical: {}} this.scopeStack.push(childScope) assign(childScope.parentLexical, parentScope.lexical, parentScope.parentLexical) } pp$5.exitLexicalScope = function() { var childScope = this.scopeStack.pop() var parentScope = this.scopeStack[this.scopeStack.length - 1] assign(parentScope.childVar, childScope.var, childScope.childVar) } /** * A name can be declared with `var` if there are no variables with the same name declared with `let`/`const` * in the current lexical scope or any of the parent lexical scopes in this function. */ pp$5.canDeclareVarName = function(name) { var currentScope = this.scopeStack[this.scopeStack.length - 1] return !has(currentScope.lexical, name) && !has(currentScope.parentLexical, name) } /** * A name can be declared with `let`/`const` if there are no variables with the same name declared with `let`/`const` * in the current scope, and there are no variables with the same name declared with `var` in the current scope or in * any child lexical scopes in this function. */ pp$5.canDeclareLexicalName = function(name) { var currentScope = this.scopeStack[this.scopeStack.length - 1] return !has(currentScope.lexical, name) && !has(currentScope.var, name) && !has(currentScope.childVar, name) } pp$5.declareVarName = function(name) { this.scopeStack[this.scopeStack.length - 1].var[name] = true } pp$5.declareLexicalName = function(name) { this.scopeStack[this.scopeStack.length - 1].lexical[name] = true } var Node = function Node(parser, pos, loc) { this.type = "" this.start = pos this.end = 0 if (parser.options.locations) this.loc = new SourceLocation(parser, loc) if (parser.options.directSourceFile) this.sourceFile = parser.options.directSourceFile if (parser.options.ranges) this.range = [pos, 0] }; // Start an AST node, attaching a start offset. var pp$6 = Parser.prototype pp$6.startNode = function() { return new Node(this, this.start, this.startLoc) } pp$6.startNodeAt = function(pos, loc) { return new Node(this, pos, loc) } // Finish an AST node, adding `type` and `end` properties. function finishNodeAt(node, type, pos, loc) { node.type = type node.end = pos if (this.options.locations) node.loc.end = loc if (this.options.ranges) node.range[1] = pos return node } pp$6.finishNode = function(node, type) { return finishNodeAt.call(this, node, type, this.lastTokEnd, this.lastTokEndLoc) } // Finish node at given position pp$6.finishNodeAt = function(node, type, pos, loc) { return finishNodeAt.call(this, node, type, pos, loc) } // The algorithm used to determine whether a regexp can appear at a // given point in the program is loosely based on sweet.js' approach. // See https://github.com/mozilla/sweet.js/wiki/design var TokContext = function TokContext(token, isExpr, preserveSpace, override, generator) { this.token = token this.isExpr = !!isExpr this.preserveSpace = !!preserveSpace this.override = override this.generator = !!generator }; var types = { b_stat: new TokContext("{", false), b_expr: new TokContext("{", true), b_tmpl: new TokContext("${", true), p_stat: new TokContext("(", false), p_expr: new TokContext("(", true), q_tmpl: new TokContext("`", true, true, function (p) { return p.readTmplToken(); }), f_expr: new TokContext("function", true), f_expr_gen: new TokContext("function", true, false, null, true), f_gen: new TokContext("function", false, false, null, true) } var pp$7 = Parser.prototype pp$7.initialContext = function() { return [types.b_stat] } pp$7.braceIsBlock = function(prevType) { if (prevType === tt.colon) { var parent = this.curContext() if (parent === types.b_stat || parent === types.b_expr) return !parent.isExpr } if (prevType === tt._return) return lineBreak.test(this.input.slice(this.lastTokEnd, this.start)) if (prevType === tt._else || prevType === tt.semi || prevType === tt.eof || prevType === tt.parenR || prevType == tt.arrow) return true if (prevType == tt.braceL) return this.curContext() === types.b_stat return !this.exprAllowed } pp$7.inGeneratorContext = function() { var this$1 = this; for (var i = this.context.length - 1; i >= 0; i--) if (this$1.context[i].generator) return true return false } pp$7.updateContext = function(prevType) { var update, type = this.type if (type.keyword && prevType == tt.dot) this.exprAllowed = false else if (update = type.updateContext) update.call(this, prevType) else this.exprAllowed = type.beforeExpr } // Token-specific context update code tt.parenR.updateContext = tt.braceR.updateContext = function() { if (this.context.length == 1) { this.exprAllowed = true return } var out = this.context.pop(), cur if (out === types.b_stat && (cur = this.curContext()) && cur.token === "function") { this.context.pop() this.exprAllowed = false } else if (out === types.b_tmpl) { this.exprAllowed = true } else { this.exprAllowed = !out.isExpr } } tt.braceL.updateContext = function(prevType) { this.context.push(this.braceIsBlock(prevType) ? types.b_stat : types.b_expr) this.exprAllowed = true } tt.dollarBraceL.updateContext = function() { this.context.push(types.b_tmpl) this.exprAllowed = true } tt.parenL.updateContext = function(prevType) { var statementParens = prevType === tt._if || prevType === tt._for || prevType === tt._with || prevType === tt._while this.context.push(statementParens ? types.p_stat : types.p_expr) this.exprAllowed = true } tt.incDec.updateContext = function() { // tokExprAllowed stays unchanged } tt._function.updateContext = function(prevType) { if (prevType.beforeExpr && prevType !== tt.semi && prevType !== tt._else && !((prevType === tt.colon || prevType === tt.braceL) && this.curContext() === types.b_stat)) this.context.push(types.f_expr) this.exprAllowed = false } tt.backQuote.updateContext = function() { if (this.curContext() === types.q_tmpl) this.context.pop() else this.context.push(types.q_tmpl) this.exprAllowed = false } tt.star.updateContext = function(prevType) { if (prevType == tt._function) { if (this.curContext() === types.f_expr) this.context[this.context.length - 1] = types.f_expr_gen else this.context.push(types.f_gen) } this.exprAllowed = true } tt.name.updateContext = function(prevType) { var allowed = false if (this.options.ecmaVersion >= 6) { if (this.value == "of" && !this.exprAllowed || this.value == "yield" && this.inGeneratorContext()) allowed = true } this.exprAllowed = allowed } // Object type used to represent tokens. Note that normally, tokens // simply exist as properties on the parser object. This is only // used for the onToken callback and the external tokenizer. var Token = function Token(p) { this.type = p.type this.value = p.value this.start = p.start this.end = p.end if (p.options.locations) this.loc = new SourceLocation(p, p.startLoc, p.endLoc) if (p.options.ranges) this.range = [p.start, p.end] }; // ## Tokenizer var pp$8 = Parser.prototype // Are we running under Rhino? var isRhino = typeof Packages == "object" && Object.prototype.toString.call(Packages) == "[object JavaPackage]" // Move to the next token pp$8.next = function() { if (this.options.onToken) this.options.onToken(new Token(this)) this.lastTokEnd = this.end this.lastTokStart = this.start this.lastTokEndLoc = this.endLoc this.lastTokStartLoc = this.startLoc this.nextToken() } pp$8.getToken = function() { this.next() return new Token(this) } // If we're in an ES6 environment, make parsers iterable if (typeof Symbol !== "undefined") pp$8[Symbol.iterator] = function() { var this$1 = this; return { next: function () { var token = this$1.getToken() return { done: token.type === tt.eof, value: token } } } } // Toggle strict mode. Re-reads the next number or string to please // pedantic tests (`"use strict"; 010;` should fail). pp$8.curContext = function() { return this.context[this.context.length - 1] } // Read a single token, updating the parser object's token-related // properties. pp$8.nextToken = function() { var curContext = this.curContext() if (!curContext || !curContext.preserveSpace) this.skipSpace() this.start = this.pos if (this.options.locations) this.startLoc = this.curPosition() if (this.pos >= this.input.length) return this.finishToken(tt.eof) if (curContext.override) return curContext.override(this) else this.readToken(this.fullCharCodeAtPos()) } pp$8.readToken = function(code) { // Identifier or keyword. '\uXXXX' sequences are allowed in // identifiers, so '\' also dispatches to that. if (isIdentifierStart(code, this.options.ecmaVersion >= 6) || code === 92 /* '\' */) return this.readWord() return this.getTokenFromCode(code) } pp$8.fullCharCodeAtPos = function() { var code = this.input.charCodeAt(this.pos) if (code <= 0xd7ff || code >= 0xe000) return code var next = this.input.charCodeAt(this.pos + 1) return (code << 10) + next - 0x35fdc00 } pp$8.skipBlockComment = function() { var this$1 = this; var startLoc = this.options.onComment && this.curPosition() var start = this.pos, end = this.input.indexOf("*/", this.pos += 2) if (end === -1) this.raise(this.pos - 2, "Unterminated comment") this.pos = end + 2 if (this.options.locations) { lineBreakG.lastIndex = start var match while ((match = lineBreakG.exec(this.input)) && match.index < this.pos) { ++this$1.curLine this$1.lineStart = match.index + match[0].length } } if (this.options.onComment) this.options.onComment(true, this.input.slice(start + 2, end), start, this.pos, startLoc, this.curPosition()) } pp$8.skipLineComment = function(startSkip) { var this$1 = this; var start = this.pos var startLoc = this.options.onComment && this.curPosition() var ch = this.input.charCodeAt(this.pos += startSkip) while (this.pos < this.input.length && ch !== 10 && ch !== 13 && ch !== 8232 && ch !== 8233) { ++this$1.pos ch = this$1.input.charCodeAt(this$1.pos) } if (this.options.onComment) this.options.onComment(false, this.input.slice(start + startSkip, this.pos), start, this.pos, startLoc, this.curPosition()) } // Called at the start of the parse and after every token. Skips // whitespace and comments, and. pp$8.skipSpace = function() { var this$1 = this; loop: while (this.pos < this.input.length) { var ch = this$1.input.charCodeAt(this$1.pos) switch (ch) { case 32: case 160: // ' ' ++this$1.pos break case 13: if (this$1.input.charCodeAt(this$1.pos + 1) === 10) { ++this$1.pos } case 10: case 8232: case 8233: ++this$1.pos if (this$1.options.locations) { ++this$1.curLine this$1.lineStart = this$1.pos } break case 47: // '/' switch (this$1.input.charCodeAt(this$1.pos + 1)) { case 42: // '*' this$1.skipBlockComment() break case 47: this$1.skipLineComment(2) break default: break loop } break default: if (ch > 8 && ch < 14 || ch >= 5760 && nonASCIIwhitespace.test(String.fromCharCode(ch))) { ++this$1.pos } else { break loop } } } } // Called at the end of every token. Sets `end`, `val`, and // maintains `context` and `exprAllowed`, and skips the space after // the token, so that the next one's `start` will point at the // right position. pp$8.finishToken = function(type, val) { this.end = this.pos if (this.options.locations) this.endLoc = this.curPosition() var prevType = this.type this.type = type this.value = val this.updateContext(prevType) } // ### Token reading // This is the function that is called to fetch the next token. It // is somewhat obscure, because it works in character codes rather // than characters, and because operator parsing has been inlined // into it. // // All in the name of speed. // pp$8.readToken_dot = function() { var next = this.input.charCodeAt(this.pos + 1) if (next >= 48 && next <= 57) return this.readNumber(true) var next2 = this.input.charCodeAt(this.pos + 2) if (this.options.ecmaVersion >= 6 && next === 46 && next2 === 46) { // 46 = dot '.' this.pos += 3 return this.finishToken(tt.ellipsis) } else { ++this.pos return this.finishToken(tt.dot) } } pp$8.readToken_slash = function() { // '/' var next = this.input.charCodeAt(this.pos + 1) if (this.exprAllowed) { ++this.pos; return this.readRegexp() } if (next === 61) return this.finishOp(tt.assign, 2) return this.finishOp(tt.slash, 1) } pp$8.readToken_mult_modulo_exp = function(code) { // '%*' var next = this.input.charCodeAt(this.pos + 1) var size = 1 var tokentype = code === 42 ? tt.star : tt.modulo // exponentiation operator ** and **= if (this.options.ecmaVersion >= 7 && next === 42) { ++size tokentype = tt.starstar next = this.input.charCodeAt(this.pos + 2) } if (next === 61) return this.finishOp(tt.assign, size + 1) return this.finishOp(tokentype, size) } pp$8.readToken_pipe_amp = function(code) { // '|&' var next = this.input.charCodeAt(this.pos + 1) if (next === code) return this.finishOp(code === 124 ? tt.logicalOR : tt.logicalAND, 2) if (next === 61) return this.finishOp(tt.assign, 2) return this.finishOp(code === 124 ? tt.bitwiseOR : tt.bitwiseAND, 1) } pp$8.readToken_caret = function() { // '^' var next = this.input.charCodeAt(this.pos + 1) if (next === 61) return this.finishOp(tt.assign, 2) return this.finishOp(tt.bitwiseXOR, 1) } pp$8.readToken_plus_min = function(code) { // '+-' var next = this.input.charCodeAt(this.pos + 1) if (next === code) { if (next == 45 && this.input.charCodeAt(this.pos + 2) == 62 && lineBreak.test(this.input.slice(this.lastTokEnd, this.pos))) { // A `-->` line comment this.skipLineComment(3) this.skipSpace() return this.nextToken() } return this.finishOp(tt.incDec, 2) } if (next === 61) return this.finishOp(tt.assign, 2) return this.finishOp(tt.plusMin, 1) } pp$8.readToken_lt_gt = function(code) { // '<>' var next = this.input.charCodeAt(this.pos + 1) var size = 1 if (next === code) { size = code === 62 && this.input.charCodeAt(this.pos + 2) === 62 ? 3 : 2 if (this.input.charCodeAt(this.pos + size) === 61) return this.finishOp(tt.assign, size + 1) return this.finishOp(tt.bitShift, size) } if (next == 33 && code == 60 && this.input.charCodeAt(this.pos + 2) == 45 && this.input.charCodeAt(this.pos + 3) == 45) { if (this.inModule) this.unexpected() // ` {"no-alert": "2 no-console: 2"} // Should ignore that case as well. if (ConfigOps.isEverySeverityValid(items)) { return items; } } catch (ex) {} // ignore to parse the string by a fallback. // Optionator cannot parse commaless notations. // But we are supporting that. So this is a fallback for that. items = {}; string = string.replace(/([a-zA-Z0-9\-/]+):/g, "\"$1\":").replace(/(]|[0-9])\s+(?=")/, "$1,"); try { items = JSON.parse("{" + string + "}"); } catch (ex) { messages.push({ ruleId: null, fatal: true, severity: 2, source: null, message: "Failed to parse JSON from '" + string + "': " + ex.message, line: location.start.line, column: location.start.column + 1 }); } return items; } /** * Parses a config of values separated by comma. * @param {string} string The string to parse. * @returns {Object} Result map of values and true values */ function parseListConfig(string) { var items = {}; // Collapse whitespace around , string = string.replace(/\s*,\s*/g, ","); string.split(/,+/).forEach(function (name) { name = name.trim(); if (!name) { return; } items[name] = true; }); return items; } /** * Ensures that variables representing built-in properties of the Global Object, * and any globals declared by special block comments, are present in the global * scope. * @param {ASTNode} program The top node of the AST. * @param {Scope} globalScope The global scope. * @param {Object} config The existing configuration data. * @param {Environments} envContext Env context * @returns {void} */ function addDeclaredGlobals(program, globalScope, config, envContext) { var declaredGlobals = {}, exportedGlobals = {}, explicitGlobals = {}, builtin = envContext.get("builtin"); Object.assign(declaredGlobals, builtin); Object.keys(config.env).forEach(function (name) { if (config.env[name]) { var env = envContext.get(name), environmentGlobals = env && env.globals; if (environmentGlobals) { Object.assign(declaredGlobals, environmentGlobals); } } }); Object.assign(exportedGlobals, config.exported); Object.assign(declaredGlobals, config.globals); Object.assign(explicitGlobals, config.astGlobals); Object.keys(declaredGlobals).forEach(function (name) { var variable = globalScope.set.get(name); if (!variable) { variable = new eslintScope.Variable(name, globalScope); variable.eslintExplicitGlobal = false; globalScope.variables.push(variable); globalScope.set.set(name, variable); } variable.writeable = declaredGlobals[name]; }); Object.keys(explicitGlobals).forEach(function (name) { var variable = globalScope.set.get(name); if (!variable) { variable = new eslintScope.Variable(name, globalScope); variable.eslintExplicitGlobal = true; variable.eslintExplicitGlobalComment = explicitGlobals[name].comment; globalScope.variables.push(variable); globalScope.set.set(name, variable); } variable.writeable = explicitGlobals[name].value; }); // mark all exported variables as such Object.keys(exportedGlobals).forEach(function (name) { var variable = globalScope.set.get(name); if (variable) { variable.eslintUsed = true; } }); /* * "through" contains all references which definitions cannot be found. * Since we augment the global scope using configuration, we need to update * references and remove the ones that were added by configuration. */ globalScope.through = globalScope.through.filter(function (reference) { var name = reference.identifier.name; var variable = globalScope.set.get(name); if (variable) { /* * Links the variable and the reference. * And this reference is removed from `Scope#through`. */ reference.resolved = variable; variable.references.push(reference); return false; } return true; }); } /** * Add data to reporting configuration to disable reporting for list of rules * starting from start location * @param {Object[]} reportingConfig Current reporting configuration * @param {Object} start Position to start * @param {string[]} rulesToDisable List of rules * @returns {void} */ function disableReporting(reportingConfig, start, rulesToDisable) { if (rulesToDisable.length) { rulesToDisable.forEach(function (rule) { reportingConfig.push({ start: start, end: null, rule: rule }); }); } else { reportingConfig.push({ start: start, end: null, rule: null }); } } /** * Add data to reporting configuration to enable reporting for list of rules * starting from start location * @param {Object[]} reportingConfig Current reporting configuration * @param {Object} start Position to start * @param {string[]} rulesToEnable List of rules * @returns {void} */ function enableReporting(reportingConfig, start, rulesToEnable) { var i = void 0; if (rulesToEnable.length) { rulesToEnable.forEach(function (rule) { for (i = reportingConfig.length - 1; i >= 0; i--) { if (!reportingConfig[i].end && reportingConfig[i].rule === rule) { reportingConfig[i].end = start; break; } } }); } else { // find all previous disabled locations if they was started as list of rules var prevStart = void 0; for (i = reportingConfig.length - 1; i >= 0; i--) { if (prevStart && prevStart !== reportingConfig[i].start) { break; } if (!reportingConfig[i].end) { reportingConfig[i].end = start; prevStart = reportingConfig[i].start; } } } } /** * Parses comments in file to extract file-specific config of rules, globals * and environments and merges them with global config; also code blocks * where reporting is disabled or enabled and merges them with reporting config. * @param {string} filename The file being checked. * @param {ASTNode} ast The top node of the AST. * @param {Object} config The existing configuration data. * @param {Linter} linterContext Linter context object * @returns {Object} Modified config object */ function modifyConfigsFromComments(filename, ast, config, linterContext) { var commentConfig = { exported: {}, astGlobals: {}, rules: {}, env: {} }; var commentRules = {}; var messages = linterContext.messages; var reportingConfig = linterContext.reportingConfig; ast.comments.forEach(function (comment) { var value = comment.value.trim(); var match = /^(eslint(-\w+){0,3}|exported|globals?)(\s|$)/.exec(value); if (match) { value = value.substring(match.index + match[1].length); if (comment.type === "Block") { switch (match[1]) { case "exported": Object.assign(commentConfig.exported, parseBooleanConfig(value, comment)); break; case "globals": case "global": Object.assign(commentConfig.astGlobals, parseBooleanConfig(value, comment)); break; case "eslint-env": Object.assign(commentConfig.env, parseListConfig(value)); break; case "eslint-disable": disableReporting(reportingConfig, comment.loc.start, Object.keys(parseListConfig(value))); break; case "eslint-enable": enableReporting(reportingConfig, comment.loc.start, Object.keys(parseListConfig(value))); break; case "eslint": { var items = parseJsonConfig(value, comment.loc, messages); Object.keys(items).forEach(function (name) { var ruleValue = items[name]; validator.validateRuleOptions(name, ruleValue, filename + " line " + comment.loc.start.line, linterContext.rules); commentRules[name] = ruleValue; }); break; } // no default } } else { // comment.type === "Line" if (match[1] === "eslint-disable-line") { disableReporting(reportingConfig, { line: comment.loc.start.line, column: 0 }, Object.keys(parseListConfig(value))); enableReporting(reportingConfig, comment.loc.end, Object.keys(parseListConfig(value))); } else if (match[1] === "eslint-disable-next-line") { disableReporting(reportingConfig, comment.loc.start, Object.keys(parseListConfig(value))); enableReporting(reportingConfig, { line: comment.loc.start.line + 2 }, Object.keys(parseListConfig(value))); } } } }); // apply environment configs Object.keys(commentConfig.env).forEach(function (name) { var env = linterContext.environments.get(name); if (env) { commentConfig = ConfigOps.merge(commentConfig, env); } }); Object.assign(commentConfig.rules, commentRules); return ConfigOps.merge(config, commentConfig); } /** * Check if message of rule with ruleId should be ignored in location * @param {Object[]} reportingConfig Collection of ignore records * @param {string} ruleId Id of rule * @param {Object} location Location of message * @returns {boolean} True if message should be ignored, false otherwise */ function isDisabledByReportingConfig(reportingConfig, ruleId, location) { for (var i = 0, c = reportingConfig.length; i < c; i++) { var ignore = reportingConfig[i]; if ((!ignore.rule || ignore.rule === ruleId) && (location.line > ignore.start.line || location.line === ignore.start.line && location.column >= ignore.start.column) && (!ignore.end || location.line < ignore.end.line || location.line === ignore.end.line && location.column <= ignore.end.column)) { return true; } } return false; } /** * Normalize ECMAScript version from the initial config * @param {number} ecmaVersion ECMAScript version from the initial config * @param {boolean} isModule Whether the source type is module or not * @returns {number} normalized ECMAScript version */ function normalizeEcmaVersion(ecmaVersion, isModule) { // Need at least ES6 for modules if (isModule && (!ecmaVersion || ecmaVersion < 6)) { ecmaVersion = 6; } // Calculate ECMAScript edition number from official year version starting with // ES2015, which corresponds with ES6 (or a difference of 2009). if (ecmaVersion >= 2015) { ecmaVersion -= 2009; } return ecmaVersion; } /** * Process initial config to make it safe to extend by file comment config * @param {Object} config Initial config * @param {Environments} envContext Env context * @returns {Object} Processed config */ function prepareConfig(config, envContext) { config.globals = config.globals || {}; var copiedRules = Object.assign({}, defaultConfig.rules); var parserOptions = Object.assign({}, defaultConfig.parserOptions); if (_typeof(config.rules) === "object") { Object.keys(config.rules).forEach(function (k) { var rule = config.rules[k]; if (rule === null) { throw new Error("Invalid config for rule '" + k + "'."); } if (Array.isArray(rule)) { copiedRules[k] = rule.slice(); } else { copiedRules[k] = rule; } }); } // merge in environment parserOptions if (_typeof(config.env) === "object") { Object.keys(config.env).forEach(function (envName) { var env = envContext.get(envName); if (config.env[envName] && env && env.parserOptions) { parserOptions = ConfigOps.merge(parserOptions, env.parserOptions); } }); } var preparedConfig = { rules: copiedRules, parser: config.parser || defaultConfig.parser, globals: ConfigOps.merge(defaultConfig.globals, config.globals), env: ConfigOps.merge(defaultConfig.env, config.env || {}), settings: ConfigOps.merge(defaultConfig.settings, config.settings || {}), parserOptions: ConfigOps.merge(parserOptions, config.parserOptions || {}) }; var isModule = preparedConfig.parserOptions.sourceType === "module"; if (isModule) { // can't have global return inside of modules preparedConfig.parserOptions.ecmaFeatures = Object.assign({}, preparedConfig.parserOptions.ecmaFeatures, { globalReturn: false }); } preparedConfig.parserOptions.ecmaVersion = normalizeEcmaVersion(preparedConfig.parserOptions.ecmaVersion, isModule); return preparedConfig; } /** * Provide a stub rule with a given message * @param {string} message The message to be displayed for the rule * @returns {Function} Stub rule function */ function createStubRule(message) { /** * Creates a fake rule object * @param {Object} context context object for each rule * @returns {Object} collection of node to listen on */ function createRuleModule(context) { return { Program: function Program(node) { context.report(node, message); } }; } if (message) { return createRuleModule; } throw new Error("No message passed to stub rule"); } /** * Provide a rule replacement message * @param {string} ruleId Name of the rule * @returns {string} Message detailing rule replacement */ function getRuleReplacementMessage(ruleId) { if (ruleId in replacements.rules) { var newRules = replacements.rules[ruleId]; return "Rule '" + ruleId + "' was removed and replaced by: " + newRules.join(", "); } return null; } var eslintEnvPattern = /\/\*\s*eslint-env\s(.+?)\*\//g; /** * Checks whether or not there is a comment which has "eslint-env *" in a given text. * @param {string} text - A source code text to check. * @returns {Object|null} A result of parseListConfig() with "eslint-env *" comment. */ function findEslintEnv(text) { var match = void 0, retv = void 0; eslintEnvPattern.lastIndex = 0; while (match = eslintEnvPattern.exec(text)) { retv = Object.assign(retv || {}, parseListConfig(match[1])); } return retv; } /** * Strips Unicode BOM from a given text. * * @param {string} text - A text to strip. * @returns {string} The stripped text. */ function stripUnicodeBOM(text) { /* * Check Unicode BOM. * In JavaScript, string data is stored as UTF-16, so BOM is 0xFEFF. * http://www.ecma-international.org/ecma-262/6.0/#sec-unicode-format-control-characters */ if (text.charCodeAt(0) === 0xFEFF) { return text.slice(1); } return text; } /** * Get the severity level of a rule (0 - none, 1 - warning, 2 - error) * Returns 0 if the rule config is not valid (an Array or a number) * @param {Array|number} ruleConfig rule configuration * @returns {number} 0, 1, or 2, indicating rule severity */ function getRuleSeverity(ruleConfig) { if (typeof ruleConfig === "number") { return ruleConfig; } else if (Array.isArray(ruleConfig)) { return ruleConfig[0]; } return 0; } /** * Get the options for a rule (not including severity), if any * @param {Array|number} ruleConfig rule configuration * @returns {Array} of rule options, empty Array if none */ function getRuleOptions(ruleConfig) { if (Array.isArray(ruleConfig)) { return ruleConfig.slice(1); } return []; } /** * Parses text into an AST. Moved out here because the try-catch prevents * optimization of functions, so it's best to keep the try-catch as isolated * as possible * @param {string} text The text to parse. * @param {Object} config The ESLint configuration object. * @param {string} filePath The path to the file being parsed. * @returns {ASTNode|CustomParseResult} The AST or parse result if successful, * or null if not. * @param {Array} messages Messages array for the linter object * @returns {*} parsed text if successful otherwise null * @private */ function parse(text, config, filePath, messages) { var parser = void 0, parserOptions = { loc: true, range: true, raw: true, tokens: true, comment: true, filePath: filePath }; try { parser = require(config.parser); } catch (ex) { messages.push({ ruleId: null, fatal: true, severity: 2, source: null, message: ex.message, line: 0, column: 0 }); return null; } // merge in any additional parser options if (config.parserOptions) { parserOptions = Object.assign({}, config.parserOptions, parserOptions); } /* * Check for parsing errors first. If there's a parsing error, nothing * else can happen. However, a parsing error does not throw an error * from this method - it's just considered a fatal error message, a * problem that ESLint identified just like any other. */ try { if (typeof parser.parseForESLint === "function") { return parser.parseForESLint(text, parserOptions); } return parser.parse(text, parserOptions); } catch (ex) { // If the message includes a leading line number, strip it: var message = ex.message.replace(/^line \d+:/i, "").trim(); var source = ex.lineNumber ? SourceCode.splitLines(text)[ex.lineNumber - 1] : null; messages.push({ ruleId: null, fatal: true, severity: 2, source: source, message: "Parsing error: " + message, line: ex.lineNumber, column: ex.column }); return null; } } //------------------------------------------------------------------------------ // Public Interface //------------------------------------------------------------------------------ /** * Object that is responsible for verifying JavaScript text * @name eslint */ var Linter = function (_EventEmitter) { _inherits(Linter, _EventEmitter); function Linter() { _classCallCheck(this, Linter); var _this = _possibleConstructorReturn(this, (Linter.__proto__ || Object.getPrototypeOf(Linter)).call(this)); _this.messages = []; _this.currentConfig = null; _this.currentScopes = null; _this.scopeManager = null; _this.currentFilename = null; _this.traverser = null; _this.reportingConfig = []; _this.sourceCode = null; _this.version = pkg.version; _this.rules = new Rules(); _this.environments = new Environments(); // set unlimited listeners (see https://github.com/eslint/eslint/issues/524) _this.setMaxListeners(0); return _this; } /** * Resets the internal state of the object. * @returns {void} */ _createClass(Linter, [{ key: "reset", value: function reset() { this.removeAllListeners(); this.messages = []; this.currentConfig = null; this.currentScopes = null; this.scopeManager = null; this.traverser = null; this.reportingConfig = []; this.sourceCode = null; } /** * Configuration object for the `verify` API. A JS representation of the eslintrc files. * @typedef {Object} ESLintConfig * @property {Object} rules The rule configuration to verify against. * @property {string} [parser] Parser to use when generatig the AST. * @property {Object} [parserOptions] Options for the parsed used. * @property {Object} [settings] Global settings passed to each rule. * @property {Object} [env] The environment to verify in. * @property {Object} [globals] Available globals to the code. */ /** * Verifies the text against the rules specified by the second argument. * @param {string|SourceCode} textOrSourceCode The text to parse or a SourceCode object. * @param {ESLintConfig} config An ESLintConfig instance to configure everything. * @param {(string|Object)} [filenameOrOptions] The optional filename of the file being checked. * If this is not set, the filename will default to '' in the rule context. If * an object, then it has "filename", "saveState", and "allowInlineConfig" properties. * @param {boolean} [saveState] Indicates if the state from the last run should be saved. * Mostly useful for testing purposes. * @param {boolean} [filenameOrOptions.allowInlineConfig] Allow/disallow inline comments' ability to change config once it is set. Defaults to true if not supplied. * Useful if you want to validate JS without comments overriding rules. * @returns {Object[]} The results as an array of messages or null if no messages. */ }, { key: "verify", value: function verify(textOrSourceCode, config, filenameOrOptions, saveState) { var _this2 = this; var text = typeof textOrSourceCode === "string" ? textOrSourceCode : null; var ast = void 0, parseResult = void 0, allowInlineConfig = void 0; // evaluate arguments if ((typeof filenameOrOptions === "undefined" ? "undefined" : _typeof(filenameOrOptions)) === "object") { this.currentFilename = filenameOrOptions.filename; allowInlineConfig = filenameOrOptions.allowInlineConfig; saveState = filenameOrOptions.saveState; } else { this.currentFilename = filenameOrOptions; } if (!saveState) { this.reset(); } // search and apply "eslint-env *". var envInFile = findEslintEnv(text || textOrSourceCode.text); config = Object.assign({}, config); if (envInFile) { if (config.env) { config.env = Object.assign({}, config.env, envInFile); } else { config.env = envInFile; } } // process initial config to make it safe to extend config = prepareConfig(config, this.environments); // only do this for text if (text !== null) { // there's no input, just exit here if (text.trim().length === 0) { this.sourceCode = new SourceCode(text, blankScriptAST); return this.messages; } parseResult = parse(stripUnicodeBOM(text).replace(astUtils.SHEBANG_MATCHER, function (match, captured) { return "//" + captured; }), config, this.currentFilename, this.messages); // if this result is from a parseForESLint() method, normalize if (parseResult && parseResult.ast) { ast = parseResult.ast; } else { ast = parseResult; parseResult = null; } if (ast) { this.sourceCode = new SourceCode(text, ast); } } else { this.sourceCode = textOrSourceCode; ast = this.sourceCode.ast; } // if espree failed to parse the file, there's no sense in setting up rules if (ast) { // parse global comments and modify config if (allowInlineConfig !== false) { config = modifyConfigsFromComments(this.currentFilename, ast, config, this); } // ensure that severities are normalized in the config ConfigOps.normalize(config); // enable appropriate rules Object.keys(config.rules).filter(function (key) { return getRuleSeverity(config.rules[key]) > 0; }).forEach(function (key) { var ruleCreator = void 0; ruleCreator = _this2.rules.get(key); if (!ruleCreator) { var replacementMsg = getRuleReplacementMessage(key); if (replacementMsg) { ruleCreator = createStubRule(replacementMsg); } else { ruleCreator = createStubRule("Definition for rule '" + key + "' was not found"); } _this2.rules.define(key, ruleCreator); } var severity = getRuleSeverity(config.rules[key]); var options = getRuleOptions(config.rules[key]); try { var ruleContext = new RuleContext(key, _this2, severity, options, config.settings, config.parserOptions, config.parser, ruleCreator.meta, parseResult && parseResult.services ? parseResult.services : {}); var rule = ruleCreator.create ? ruleCreator.create(ruleContext) : ruleCreator(ruleContext); // add all the selectors from the rule as listeners Object.keys(rule).forEach(function (selector) { _this2.on(selector, timing.enabled ? timing.time(key, rule[selector]) : rule[selector]); }); } catch (ex) { ex.message = "Error while loading rule '" + key + "': " + ex.message; throw ex; } }); // save config so rules can access as necessary this.currentConfig = config; this.traverser = new Traverser(); var ecmaFeatures = this.currentConfig.parserOptions.ecmaFeatures || {}; var ecmaVersion = this.currentConfig.parserOptions.ecmaVersion || 5; // gather scope data that may be needed by the rules this.scopeManager = eslintScope.analyze(ast, { ignoreEval: true, nodejsScope: ecmaFeatures.globalReturn, impliedStrict: ecmaFeatures.impliedStrict, ecmaVersion: ecmaVersion, sourceType: this.currentConfig.parserOptions.sourceType || "script", fallback: Traverser.getKeys }); this.currentScopes = this.scopeManager.scopes; // augment global scope with declared global variables addDeclaredGlobals(ast, this.currentScopes[0], this.currentConfig, this.environments); var eventGenerator = new NodeEventGenerator(this); eventGenerator = new CodePathAnalyzer(eventGenerator); /* * Each node has a type property. Whenever a particular type of * node is found, an event is fired. This allows any listeners to * automatically be informed that this type of node has been found * and react accordingly. */ this.traverser.traverse(ast, { enter: function enter(node, parent) { node.parent = parent; eventGenerator.enterNode(node); }, leave: function leave(node) { eventGenerator.leaveNode(node); } }); } // sort by line and column this.messages.sort(function (a, b) { var lineDiff = a.line - b.line; if (lineDiff === 0) { return a.column - b.column; } return lineDiff; }); return this.messages; } /** * Reports a message from one of the rules. * @param {string} ruleId The ID of the rule causing the message. * @param {number} severity The severity level of the rule as configured. * @param {ASTNode} node The AST node that the message relates to. * @param {Object=} location An object containing the error line and column * numbers. If location is not provided the node's start location will * be used. * @param {string} message The actual message. * @param {Object} opts Optional template data which produces a formatted message * with symbols being replaced by this object's values. * @param {Object} fix A fix command description. * @param {Object} meta Metadata of the rule * @returns {void} */ }, { key: "report", value: function report(ruleId, severity, node, location, message, opts, fix, meta) { if (node) { assert.strictEqual(typeof node === "undefined" ? "undefined" : _typeof(node), "object", "Node must be an object"); } var endLocation = void 0; if (typeof location === "string") { assert.ok(node, "Node must be provided when reporting error if location is not provided"); meta = fix; fix = opts; opts = message; message = location; location = node.loc.start; endLocation = node.loc.end; } else { endLocation = location.end; } location = location.start || location; if (isDisabledByReportingConfig(this.reportingConfig, ruleId, location)) { return; } if (opts) { message = message.replace(/\{\{\s*([^{}]+?)\s*\}\}/g, function (fullMatch, term) { if (term in opts) { return opts[term]; } // Preserve old behavior: If parameter name not provided, don't replace it. return fullMatch; }); } var problem = { ruleId: ruleId, severity: severity, message: message, line: location.line, column: location.column + 1, // switch to 1-base instead of 0-base nodeType: node && node.type, source: this.sourceCode.lines[location.line - 1] || "" }; // Define endLine and endColumn if exists. if (endLocation) { problem.endLine = endLocation.line; problem.endColumn = endLocation.column + 1; // switch to 1-base instead of 0-base } // ensure there's range and text properties, otherwise it's not a valid fix if (fix && Array.isArray(fix.range) && typeof fix.text === "string") { // If rule uses fix, has metadata, but has no metadata.fixable, we should throw if (meta && !meta.fixable) { throw new Error("Fixable rules should export a `meta.fixable` property."); } problem.fix = fix; } this.messages.push(problem); } /** * Gets the SourceCode object representing the parsed source. * @returns {SourceCode} The SourceCode object. */ }, { key: "getSourceCode", value: function getSourceCode() { return this.sourceCode; } /** * Gets nodes that are ancestors of current node. * @returns {ASTNode[]} Array of objects representing ancestors. */ }, { key: "getAncestors", value: function getAncestors() { return this.traverser.parents(); } /** * Gets the scope for the current node. * @returns {Object} An object representing the current node's scope. */ }, { key: "getScope", value: function getScope() { var parents = this.traverser.parents(); // Don't do this for Program nodes - they have no parents if (parents.length) { // if current node introduces a scope, add it to the list var current = this.traverser.current(); if (this.currentConfig.parserOptions.ecmaVersion >= 6) { if (["BlockStatement", "SwitchStatement", "CatchClause", "FunctionDeclaration", "FunctionExpression", "ArrowFunctionExpression"].indexOf(current.type) >= 0) { parents.push(current); } } else { if (["FunctionDeclaration", "FunctionExpression", "ArrowFunctionExpression"].indexOf(current.type) >= 0) { parents.push(current); } } // Ascend the current node's parents for (var i = parents.length - 1; i >= 0; --i) { // Get the innermost scope var scope = this.scopeManager.acquire(parents[i], true); if (scope) { if (scope.type === "function-expression-name") { return scope.childScopes[0]; } return scope; } } } return this.currentScopes[0]; } /** * Record that a particular variable has been used in code * @param {string} name The name of the variable to mark as used * @returns {boolean} True if the variable was found and marked as used, * false if not. */ }, { key: "markVariableAsUsed", value: function markVariableAsUsed(name) { var hasGlobalReturn = this.currentConfig.parserOptions.ecmaFeatures && this.currentConfig.parserOptions.ecmaFeatures.globalReturn, specialScope = hasGlobalReturn || this.currentConfig.parserOptions.sourceType === "module"; var scope = this.getScope(), i = void 0, len = void 0; // Special Node.js scope means we need to start one level deeper if (scope.type === "global" && specialScope) { scope = scope.childScopes[0]; } do { var variables = scope.variables; for (i = 0, len = variables.length; i < len; i++) { if (variables[i].name === name) { variables[i].eslintUsed = true; return true; } } } while (scope = scope.upper); return false; } /** * Gets the filename for the currently parsed source. * @returns {string} The filename associated with the source being parsed. * Defaults to "" if no filename info is present. */ }, { key: "getFilename", value: function getFilename() { if (typeof this.currentFilename === "string") { return this.currentFilename; } return ""; } /** * Defines a new linting rule. * @param {string} ruleId A unique rule identifier * @param {Function} ruleModule Function from context to object mapping AST node types to event handlers * @returns {void} */ }, { key: "defineRule", value: function defineRule(ruleId, ruleModule) { this.rules.define(ruleId, ruleModule); } /** * Defines many new linting rules. * @param {Object} rulesToDefine map from unique rule identifier to rule * @returns {void} */ }, { key: "defineRules", value: function defineRules(rulesToDefine) { var _this3 = this; Object.getOwnPropertyNames(rulesToDefine).forEach(function (ruleId) { _this3.defineRule(ruleId, rulesToDefine[ruleId]); }); } /** * Gets the default eslint configuration. * @returns {Object} Object mapping rule IDs to their default configurations */ }, { key: "defaults", value: function defaults() { // eslint-disable-line class-methods-use-this return defaultConfig; } /** * Gets an object with all loaded rules. * @returns {Map} All loaded rules */ }, { key: "getRules", value: function getRules() { return this.rules.getAllLoadedRules(); } /** * Gets variables that are declared by a specified node. * * The variables are its `defs[].node` or `defs[].parent` is same as the specified node. * Specifically, below: * * - `VariableDeclaration` - variables of its all declarators. * - `VariableDeclarator` - variables. * - `FunctionDeclaration`/`FunctionExpression` - its function name and parameters. * - `ArrowFunctionExpression` - its parameters. * - `ClassDeclaration`/`ClassExpression` - its class name. * - `CatchClause` - variables of its exception. * - `ImportDeclaration` - variables of its all specifiers. * - `ImportSpecifier`/`ImportDefaultSpecifier`/`ImportNamespaceSpecifier` - a variable. * - others - always an empty array. * * @param {ASTNode} node A node to get. * @returns {eslint-scope.Variable[]} Variables that are declared by the node. */ }, { key: "getDeclaredVariables", value: function getDeclaredVariables(node) { return this.scopeManager && this.scopeManager.getDeclaredVariables(node) || []; } }]); return Linter; }(EventEmitter); // methods that exist on SourceCode object var externalMethods = { getSource: "getText", getSourceLines: "getLines", getAllComments: "getAllComments", getNodeByRangeIndex: "getNodeByRangeIndex", getComments: "getComments", getCommentsBefore: "getCommentsBefore", getCommentsAfter: "getCommentsAfter", getCommentsInside: "getCommentsInside", getJSDocComment: "getJSDocComment", getFirstToken: "getFirstToken", getFirstTokens: "getFirstTokens", getLastToken: "getLastToken", getLastTokens: "getLastTokens", getTokenAfter: "getTokenAfter", getTokenBefore: "getTokenBefore", getTokenByRangeStart: "getTokenByRangeStart", getTokens: "getTokens", getTokensAfter: "getTokensAfter", getTokensBefore: "getTokensBefore", getTokensBetween: "getTokensBetween" }; // copy over methods Object.keys(externalMethods).forEach(function (methodName) { var exMethodName = externalMethods[methodName]; // All functions expected to have less arguments than 5. Linter.prototype[methodName] = function (a, b, c, d, e) { if (this.sourceCode) { return this.sourceCode[exMethodName](a, b, c, d, e); } return null; }; }); module.exports = Linter; },{"../conf/blank-script.json":1,"../conf/default-config-options.js":3,"../conf/replacements.json":5,"../package.json":66,"./ast-utils":67,"./code-path-analysis/code-path-analyzer":68,"./config/config-ops":75,"./config/config-validator":76,"./config/environments":77,"./rule-context":80,"./rules":81,"./timing":334,"./util/node-event-generator":350,"./util/source-code":353,"./util/traverser":354,"assert":6,"eslint-scope":14,"events":34,"levn":46}],79:[function(require,module,exports){ "use strict"; module.exports = function () { var rules = Object.create(null); rules["accessor-pairs"] = require("./rules/accessor-pairs"); rules["array-bracket-newline"] = require("./rules/array-bracket-newline"); rules["array-bracket-spacing"] = require("./rules/array-bracket-spacing"); rules["array-callback-return"] = require("./rules/array-callback-return"); rules["array-element-newline"] = require("./rules/array-element-newline"); rules["arrow-body-style"] = require("./rules/arrow-body-style"); rules["arrow-parens"] = require("./rules/arrow-parens"); rules["arrow-spacing"] = require("./rules/arrow-spacing"); rules["block-scoped-var"] = require("./rules/block-scoped-var"); rules["block-spacing"] = require("./rules/block-spacing"); rules["brace-style"] = require("./rules/brace-style"); rules["callback-return"] = require("./rules/callback-return"); rules["camelcase"] = require("./rules/camelcase"); rules["capitalized-comments"] = require("./rules/capitalized-comments"); rules["class-methods-use-this"] = require("./rules/class-methods-use-this"); rules["comma-dangle"] = require("./rules/comma-dangle"); rules["comma-spacing"] = require("./rules/comma-spacing"); rules["comma-style"] = require("./rules/comma-style"); rules["complexity"] = require("./rules/complexity"); rules["computed-property-spacing"] = require("./rules/computed-property-spacing"); rules["consistent-return"] = require("./rules/consistent-return"); rules["consistent-this"] = require("./rules/consistent-this"); rules["constructor-super"] = require("./rules/constructor-super"); rules["curly"] = require("./rules/curly"); rules["default-case"] = require("./rules/default-case"); rules["dot-location"] = require("./rules/dot-location"); rules["dot-notation"] = require("./rules/dot-notation"); rules["eol-last"] = require("./rules/eol-last"); rules["eqeqeq"] = require("./rules/eqeqeq"); rules["for-direction"] = require("./rules/for-direction"); rules["func-call-spacing"] = require("./rules/func-call-spacing"); rules["func-name-matching"] = require("./rules/func-name-matching"); rules["func-names"] = require("./rules/func-names"); rules["func-style"] = require("./rules/func-style"); rules["generator-star-spacing"] = require("./rules/generator-star-spacing"); rules["global-require"] = require("./rules/global-require"); rules["guard-for-in"] = require("./rules/guard-for-in"); rules["handle-callback-err"] = require("./rules/handle-callback-err"); rules["id-blacklist"] = require("./rules/id-blacklist"); rules["id-length"] = require("./rules/id-length"); rules["id-match"] = require("./rules/id-match"); rules["indent-legacy"] = require("./rules/indent-legacy"); rules["indent"] = require("./rules/indent"); rules["init-declarations"] = require("./rules/init-declarations"); rules["jsx-quotes"] = require("./rules/jsx-quotes"); rules["key-spacing"] = require("./rules/key-spacing"); rules["keyword-spacing"] = require("./rules/keyword-spacing"); rules["line-comment-position"] = require("./rules/line-comment-position"); rules["linebreak-style"] = require("./rules/linebreak-style"); rules["lines-around-comment"] = require("./rules/lines-around-comment"); rules["lines-around-directive"] = require("./rules/lines-around-directive"); rules["max-depth"] = require("./rules/max-depth"); rules["max-len"] = require("./rules/max-len"); rules["max-lines"] = require("./rules/max-lines"); rules["max-nested-callbacks"] = require("./rules/max-nested-callbacks"); rules["max-params"] = require("./rules/max-params"); rules["max-statements-per-line"] = require("./rules/max-statements-per-line"); rules["max-statements"] = require("./rules/max-statements"); rules["multiline-ternary"] = require("./rules/multiline-ternary"); rules["new-cap"] = require("./rules/new-cap"); rules["new-parens"] = require("./rules/new-parens"); rules["newline-after-var"] = require("./rules/newline-after-var"); rules["newline-before-return"] = require("./rules/newline-before-return"); rules["newline-per-chained-call"] = require("./rules/newline-per-chained-call"); rules["no-alert"] = require("./rules/no-alert"); rules["no-array-constructor"] = require("./rules/no-array-constructor"); rules["no-await-in-loop"] = require("./rules/no-await-in-loop"); rules["no-bitwise"] = require("./rules/no-bitwise"); rules["no-buffer-constructor"] = require("./rules/no-buffer-constructor"); rules["no-caller"] = require("./rules/no-caller"); rules["no-case-declarations"] = require("./rules/no-case-declarations"); rules["no-catch-shadow"] = require("./rules/no-catch-shadow"); rules["no-class-assign"] = require("./rules/no-class-assign"); rules["no-compare-neg-zero"] = require("./rules/no-compare-neg-zero"); rules["no-cond-assign"] = require("./rules/no-cond-assign"); rules["no-confusing-arrow"] = require("./rules/no-confusing-arrow"); rules["no-console"] = require("./rules/no-console"); rules["no-const-assign"] = require("./rules/no-const-assign"); rules["no-constant-condition"] = require("./rules/no-constant-condition"); rules["no-continue"] = require("./rules/no-continue"); rules["no-control-regex"] = require("./rules/no-control-regex"); rules["no-debugger"] = require("./rules/no-debugger"); rules["no-delete-var"] = require("./rules/no-delete-var"); rules["no-div-regex"] = require("./rules/no-div-regex"); rules["no-dupe-args"] = require("./rules/no-dupe-args"); rules["no-dupe-class-members"] = require("./rules/no-dupe-class-members"); rules["no-dupe-keys"] = require("./rules/no-dupe-keys"); rules["no-duplicate-case"] = require("./rules/no-duplicate-case"); rules["no-duplicate-imports"] = require("./rules/no-duplicate-imports"); rules["no-else-return"] = require("./rules/no-else-return"); rules["no-empty-character-class"] = require("./rules/no-empty-character-class"); rules["no-empty-function"] = require("./rules/no-empty-function"); rules["no-empty-pattern"] = require("./rules/no-empty-pattern"); rules["no-empty"] = require("./rules/no-empty"); rules["no-eq-null"] = require("./rules/no-eq-null"); rules["no-eval"] = require("./rules/no-eval"); rules["no-ex-assign"] = require("./rules/no-ex-assign"); rules["no-extend-native"] = require("./rules/no-extend-native"); rules["no-extra-bind"] = require("./rules/no-extra-bind"); rules["no-extra-boolean-cast"] = require("./rules/no-extra-boolean-cast"); rules["no-extra-label"] = require("./rules/no-extra-label"); rules["no-extra-parens"] = require("./rules/no-extra-parens"); rules["no-extra-semi"] = require("./rules/no-extra-semi"); rules["no-fallthrough"] = require("./rules/no-fallthrough"); rules["no-floating-decimal"] = require("./rules/no-floating-decimal"); rules["no-func-assign"] = require("./rules/no-func-assign"); rules["no-global-assign"] = require("./rules/no-global-assign"); rules["no-implicit-coercion"] = require("./rules/no-implicit-coercion"); rules["no-implicit-globals"] = require("./rules/no-implicit-globals"); rules["no-implied-eval"] = require("./rules/no-implied-eval"); rules["no-inline-comments"] = require("./rules/no-inline-comments"); rules["no-inner-declarations"] = require("./rules/no-inner-declarations"); rules["no-invalid-regexp"] = require("./rules/no-invalid-regexp"); rules["no-invalid-this"] = require("./rules/no-invalid-this"); rules["no-irregular-whitespace"] = require("./rules/no-irregular-whitespace"); rules["no-iterator"] = require("./rules/no-iterator"); rules["no-label-var"] = require("./rules/no-label-var"); rules["no-labels"] = require("./rules/no-labels"); rules["no-lone-blocks"] = require("./rules/no-lone-blocks"); rules["no-lonely-if"] = require("./rules/no-lonely-if"); rules["no-loop-func"] = require("./rules/no-loop-func"); rules["no-magic-numbers"] = require("./rules/no-magic-numbers"); rules["no-mixed-operators"] = require("./rules/no-mixed-operators"); rules["no-mixed-requires"] = require("./rules/no-mixed-requires"); rules["no-mixed-spaces-and-tabs"] = require("./rules/no-mixed-spaces-and-tabs"); rules["no-multi-assign"] = require("./rules/no-multi-assign"); rules["no-multi-spaces"] = require("./rules/no-multi-spaces"); rules["no-multi-str"] = require("./rules/no-multi-str"); rules["no-multiple-empty-lines"] = require("./rules/no-multiple-empty-lines"); rules["no-native-reassign"] = require("./rules/no-native-reassign"); rules["no-negated-condition"] = require("./rules/no-negated-condition"); rules["no-negated-in-lhs"] = require("./rules/no-negated-in-lhs"); rules["no-nested-ternary"] = require("./rules/no-nested-ternary"); rules["no-new-func"] = require("./rules/no-new-func"); rules["no-new-object"] = require("./rules/no-new-object"); rules["no-new-require"] = require("./rules/no-new-require"); rules["no-new-symbol"] = require("./rules/no-new-symbol"); rules["no-new-wrappers"] = require("./rules/no-new-wrappers"); rules["no-new"] = require("./rules/no-new"); rules["no-obj-calls"] = require("./rules/no-obj-calls"); rules["no-octal-escape"] = require("./rules/no-octal-escape"); rules["no-octal"] = require("./rules/no-octal"); rules["no-param-reassign"] = require("./rules/no-param-reassign"); rules["no-path-concat"] = require("./rules/no-path-concat"); rules["no-plusplus"] = require("./rules/no-plusplus"); rules["no-process-env"] = require("./rules/no-process-env"); rules["no-process-exit"] = require("./rules/no-process-exit"); rules["no-proto"] = require("./rules/no-proto"); rules["no-prototype-builtins"] = require("./rules/no-prototype-builtins"); rules["no-redeclare"] = require("./rules/no-redeclare"); rules["no-regex-spaces"] = require("./rules/no-regex-spaces"); rules["no-restricted-globals"] = require("./rules/no-restricted-globals"); rules["no-restricted-imports"] = require("./rules/no-restricted-imports"); rules["no-restricted-modules"] = require("./rules/no-restricted-modules"); rules["no-restricted-properties"] = require("./rules/no-restricted-properties"); rules["no-restricted-syntax"] = require("./rules/no-restricted-syntax"); rules["no-return-assign"] = require("./rules/no-return-assign"); rules["no-return-await"] = require("./rules/no-return-await"); rules["no-script-url"] = require("./rules/no-script-url"); rules["no-self-assign"] = require("./rules/no-self-assign"); rules["no-self-compare"] = require("./rules/no-self-compare"); rules["no-sequences"] = require("./rules/no-sequences"); rules["no-shadow-restricted-names"] = require("./rules/no-shadow-restricted-names"); rules["no-shadow"] = require("./rules/no-shadow"); rules["no-spaced-func"] = require("./rules/no-spaced-func"); rules["no-sparse-arrays"] = require("./rules/no-sparse-arrays"); rules["no-sync"] = require("./rules/no-sync"); rules["no-tabs"] = require("./rules/no-tabs"); rules["no-template-curly-in-string"] = require("./rules/no-template-curly-in-string"); rules["no-ternary"] = require("./rules/no-ternary"); rules["no-this-before-super"] = require("./rules/no-this-before-super"); rules["no-throw-literal"] = require("./rules/no-throw-literal"); rules["no-trailing-spaces"] = require("./rules/no-trailing-spaces"); rules["no-undef-init"] = require("./rules/no-undef-init"); rules["no-undef"] = require("./rules/no-undef"); rules["no-undefined"] = require("./rules/no-undefined"); rules["no-underscore-dangle"] = require("./rules/no-underscore-dangle"); rules["no-unexpected-multiline"] = require("./rules/no-unexpected-multiline"); rules["no-unmodified-loop-condition"] = require("./rules/no-unmodified-loop-condition"); rules["no-unneeded-ternary"] = require("./rules/no-unneeded-ternary"); rules["no-unreachable"] = require("./rules/no-unreachable"); rules["no-unsafe-finally"] = require("./rules/no-unsafe-finally"); rules["no-unsafe-negation"] = require("./rules/no-unsafe-negation"); rules["no-unused-expressions"] = require("./rules/no-unused-expressions"); rules["no-unused-labels"] = require("./rules/no-unused-labels"); rules["no-unused-vars"] = require("./rules/no-unused-vars"); rules["no-use-before-define"] = require("./rules/no-use-before-define"); rules["no-useless-call"] = require("./rules/no-useless-call"); rules["no-useless-computed-key"] = require("./rules/no-useless-computed-key"); rules["no-useless-concat"] = require("./rules/no-useless-concat"); rules["no-useless-constructor"] = require("./rules/no-useless-constructor"); rules["no-useless-escape"] = require("./rules/no-useless-escape"); rules["no-useless-rename"] = require("./rules/no-useless-rename"); rules["no-useless-return"] = require("./rules/no-useless-return"); rules["no-var"] = require("./rules/no-var"); rules["no-void"] = require("./rules/no-void"); rules["no-warning-comments"] = require("./rules/no-warning-comments"); rules["no-whitespace-before-property"] = require("./rules/no-whitespace-before-property"); rules["no-with"] = require("./rules/no-with"); rules["nonblock-statement-body-position"] = require("./rules/nonblock-statement-body-position"); rules["object-curly-newline"] = require("./rules/object-curly-newline"); rules["object-curly-spacing"] = require("./rules/object-curly-spacing"); rules["object-property-newline"] = require("./rules/object-property-newline"); rules["object-shorthand"] = require("./rules/object-shorthand"); rules["one-var-declaration-per-line"] = require("./rules/one-var-declaration-per-line"); rules["one-var"] = require("./rules/one-var"); rules["operator-assignment"] = require("./rules/operator-assignment"); rules["operator-linebreak"] = require("./rules/operator-linebreak"); rules["padded-blocks"] = require("./rules/padded-blocks"); rules["padding-line-between-statements"] = require("./rules/padding-line-between-statements"); rules["prefer-arrow-callback"] = require("./rules/prefer-arrow-callback"); rules["prefer-const"] = require("./rules/prefer-const"); rules["prefer-destructuring"] = require("./rules/prefer-destructuring"); rules["prefer-numeric-literals"] = require("./rules/prefer-numeric-literals"); rules["prefer-promise-reject-errors"] = require("./rules/prefer-promise-reject-errors"); rules["prefer-reflect"] = require("./rules/prefer-reflect"); rules["prefer-rest-params"] = require("./rules/prefer-rest-params"); rules["prefer-spread"] = require("./rules/prefer-spread"); rules["prefer-template"] = require("./rules/prefer-template"); rules["quote-props"] = require("./rules/quote-props"); rules["quotes"] = require("./rules/quotes"); rules["radix"] = require("./rules/radix"); rules["require-await"] = require("./rules/require-await"); rules["require-jsdoc"] = require("./rules/require-jsdoc"); rules["require-yield"] = require("./rules/require-yield"); rules["rest-spread-spacing"] = require("./rules/rest-spread-spacing"); rules["semi-spacing"] = require("./rules/semi-spacing"); rules["semi-style"] = require("./rules/semi-style"); rules["semi"] = require("./rules/semi"); rules["sort-imports"] = require("./rules/sort-imports"); rules["sort-keys"] = require("./rules/sort-keys"); rules["sort-vars"] = require("./rules/sort-vars"); rules["space-before-blocks"] = require("./rules/space-before-blocks"); rules["space-before-function-paren"] = require("./rules/space-before-function-paren"); rules["space-in-parens"] = require("./rules/space-in-parens"); rules["space-infix-ops"] = require("./rules/space-infix-ops"); rules["space-unary-ops"] = require("./rules/space-unary-ops"); rules["spaced-comment"] = require("./rules/spaced-comment"); rules["strict"] = require("./rules/strict"); rules["switch-colon-spacing"] = require("./rules/switch-colon-spacing"); rules["symbol-description"] = require("./rules/symbol-description"); rules["template-curly-spacing"] = require("./rules/template-curly-spacing"); rules["template-tag-spacing"] = require("./rules/template-tag-spacing"); rules["unicode-bom"] = require("./rules/unicode-bom"); rules["use-isnan"] = require("./rules/use-isnan"); rules["valid-jsdoc"] = require("./rules/valid-jsdoc"); rules["valid-typeof"] = require("./rules/valid-typeof"); rules["vars-on-top"] = require("./rules/vars-on-top"); rules["wrap-iife"] = require("./rules/wrap-iife"); rules["wrap-regex"] = require("./rules/wrap-regex"); rules["yield-star-spacing"] = require("./rules/yield-star-spacing"); rules["yoda"] = require("./rules/yoda"); return rules; }; },{"./rules/accessor-pairs":82,"./rules/array-bracket-newline":83,"./rules/array-bracket-spacing":84,"./rules/array-callback-return":85,"./rules/array-element-newline":86,"./rules/arrow-body-style":87,"./rules/arrow-parens":88,"./rules/arrow-spacing":89,"./rules/block-scoped-var":90,"./rules/block-spacing":91,"./rules/brace-style":92,"./rules/callback-return":93,"./rules/camelcase":94,"./rules/capitalized-comments":95,"./rules/class-methods-use-this":96,"./rules/comma-dangle":97,"./rules/comma-spacing":98,"./rules/comma-style":99,"./rules/complexity":100,"./rules/computed-property-spacing":101,"./rules/consistent-return":102,"./rules/consistent-this":103,"./rules/constructor-super":104,"./rules/curly":105,"./rules/default-case":106,"./rules/dot-location":107,"./rules/dot-notation":108,"./rules/eol-last":109,"./rules/eqeqeq":110,"./rules/for-direction":111,"./rules/func-call-spacing":112,"./rules/func-name-matching":113,"./rules/func-names":114,"./rules/func-style":115,"./rules/generator-star-spacing":116,"./rules/global-require":117,"./rules/guard-for-in":118,"./rules/handle-callback-err":119,"./rules/id-blacklist":120,"./rules/id-length":121,"./rules/id-match":122,"./rules/indent":124,"./rules/indent-legacy":123,"./rules/init-declarations":125,"./rules/jsx-quotes":126,"./rules/key-spacing":127,"./rules/keyword-spacing":128,"./rules/line-comment-position":129,"./rules/linebreak-style":130,"./rules/lines-around-comment":131,"./rules/lines-around-directive":132,"./rules/max-depth":133,"./rules/max-len":134,"./rules/max-lines":135,"./rules/max-nested-callbacks":136,"./rules/max-params":137,"./rules/max-statements":139,"./rules/max-statements-per-line":138,"./rules/multiline-ternary":140,"./rules/new-cap":141,"./rules/new-parens":142,"./rules/newline-after-var":143,"./rules/newline-before-return":144,"./rules/newline-per-chained-call":145,"./rules/no-alert":146,"./rules/no-array-constructor":147,"./rules/no-await-in-loop":148,"./rules/no-bitwise":149,"./rules/no-buffer-constructor":150,"./rules/no-caller":151,"./rules/no-case-declarations":152,"./rules/no-catch-shadow":153,"./rules/no-class-assign":154,"./rules/no-compare-neg-zero":155,"./rules/no-cond-assign":156,"./rules/no-confusing-arrow":157,"./rules/no-console":158,"./rules/no-const-assign":159,"./rules/no-constant-condition":160,"./rules/no-continue":161,"./rules/no-control-regex":162,"./rules/no-debugger":163,"./rules/no-delete-var":164,"./rules/no-div-regex":165,"./rules/no-dupe-args":166,"./rules/no-dupe-class-members":167,"./rules/no-dupe-keys":168,"./rules/no-duplicate-case":169,"./rules/no-duplicate-imports":170,"./rules/no-else-return":171,"./rules/no-empty":175,"./rules/no-empty-character-class":172,"./rules/no-empty-function":173,"./rules/no-empty-pattern":174,"./rules/no-eq-null":176,"./rules/no-eval":177,"./rules/no-ex-assign":178,"./rules/no-extend-native":179,"./rules/no-extra-bind":180,"./rules/no-extra-boolean-cast":181,"./rules/no-extra-label":182,"./rules/no-extra-parens":183,"./rules/no-extra-semi":184,"./rules/no-fallthrough":185,"./rules/no-floating-decimal":186,"./rules/no-func-assign":187,"./rules/no-global-assign":188,"./rules/no-implicit-coercion":189,"./rules/no-implicit-globals":190,"./rules/no-implied-eval":191,"./rules/no-inline-comments":192,"./rules/no-inner-declarations":193,"./rules/no-invalid-regexp":194,"./rules/no-invalid-this":195,"./rules/no-irregular-whitespace":196,"./rules/no-iterator":197,"./rules/no-label-var":198,"./rules/no-labels":199,"./rules/no-lone-blocks":200,"./rules/no-lonely-if":201,"./rules/no-loop-func":202,"./rules/no-magic-numbers":203,"./rules/no-mixed-operators":204,"./rules/no-mixed-requires":205,"./rules/no-mixed-spaces-and-tabs":206,"./rules/no-multi-assign":207,"./rules/no-multi-spaces":208,"./rules/no-multi-str":209,"./rules/no-multiple-empty-lines":210,"./rules/no-native-reassign":211,"./rules/no-negated-condition":212,"./rules/no-negated-in-lhs":213,"./rules/no-nested-ternary":214,"./rules/no-new":220,"./rules/no-new-func":215,"./rules/no-new-object":216,"./rules/no-new-require":217,"./rules/no-new-symbol":218,"./rules/no-new-wrappers":219,"./rules/no-obj-calls":221,"./rules/no-octal":223,"./rules/no-octal-escape":222,"./rules/no-param-reassign":224,"./rules/no-path-concat":225,"./rules/no-plusplus":226,"./rules/no-process-env":227,"./rules/no-process-exit":228,"./rules/no-proto":229,"./rules/no-prototype-builtins":230,"./rules/no-redeclare":231,"./rules/no-regex-spaces":232,"./rules/no-restricted-globals":233,"./rules/no-restricted-imports":234,"./rules/no-restricted-modules":235,"./rules/no-restricted-properties":236,"./rules/no-restricted-syntax":237,"./rules/no-return-assign":238,"./rules/no-return-await":239,"./rules/no-script-url":240,"./rules/no-self-assign":241,"./rules/no-self-compare":242,"./rules/no-sequences":243,"./rules/no-shadow":245,"./rules/no-shadow-restricted-names":244,"./rules/no-spaced-func":246,"./rules/no-sparse-arrays":247,"./rules/no-sync":248,"./rules/no-tabs":249,"./rules/no-template-curly-in-string":250,"./rules/no-ternary":251,"./rules/no-this-before-super":252,"./rules/no-throw-literal":253,"./rules/no-trailing-spaces":254,"./rules/no-undef":256,"./rules/no-undef-init":255,"./rules/no-undefined":257,"./rules/no-underscore-dangle":258,"./rules/no-unexpected-multiline":259,"./rules/no-unmodified-loop-condition":260,"./rules/no-unneeded-ternary":261,"./rules/no-unreachable":262,"./rules/no-unsafe-finally":263,"./rules/no-unsafe-negation":264,"./rules/no-unused-expressions":265,"./rules/no-unused-labels":266,"./rules/no-unused-vars":267,"./rules/no-use-before-define":268,"./rules/no-useless-call":269,"./rules/no-useless-computed-key":270,"./rules/no-useless-concat":271,"./rules/no-useless-constructor":272,"./rules/no-useless-escape":273,"./rules/no-useless-rename":274,"./rules/no-useless-return":275,"./rules/no-var":276,"./rules/no-void":277,"./rules/no-warning-comments":278,"./rules/no-whitespace-before-property":279,"./rules/no-with":280,"./rules/nonblock-statement-body-position":281,"./rules/object-curly-newline":282,"./rules/object-curly-spacing":283,"./rules/object-property-newline":284,"./rules/object-shorthand":285,"./rules/one-var":287,"./rules/one-var-declaration-per-line":286,"./rules/operator-assignment":288,"./rules/operator-linebreak":289,"./rules/padded-blocks":290,"./rules/padding-line-between-statements":291,"./rules/prefer-arrow-callback":292,"./rules/prefer-const":293,"./rules/prefer-destructuring":294,"./rules/prefer-numeric-literals":295,"./rules/prefer-promise-reject-errors":296,"./rules/prefer-reflect":297,"./rules/prefer-rest-params":298,"./rules/prefer-spread":299,"./rules/prefer-template":300,"./rules/quote-props":301,"./rules/quotes":302,"./rules/radix":303,"./rules/require-await":304,"./rules/require-jsdoc":305,"./rules/require-yield":306,"./rules/rest-spread-spacing":307,"./rules/semi":310,"./rules/semi-spacing":308,"./rules/semi-style":309,"./rules/sort-imports":311,"./rules/sort-keys":312,"./rules/sort-vars":313,"./rules/space-before-blocks":314,"./rules/space-before-function-paren":315,"./rules/space-in-parens":316,"./rules/space-infix-ops":317,"./rules/space-unary-ops":318,"./rules/spaced-comment":319,"./rules/strict":320,"./rules/switch-colon-spacing":321,"./rules/symbol-description":322,"./rules/template-curly-spacing":323,"./rules/template-tag-spacing":324,"./rules/unicode-bom":325,"./rules/use-isnan":326,"./rules/valid-jsdoc":327,"./rules/valid-typeof":328,"./rules/vars-on-top":329,"./rules/wrap-iife":330,"./rules/wrap-regex":331,"./rules/yield-star-spacing":332,"./rules/yoda":333}],80:[function(require,module,exports){ /** * @fileoverview RuleContext utility for rules * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } var ruleFixer = require("./util/rule-fixer"); //------------------------------------------------------------------------------ // Constants //------------------------------------------------------------------------------ var PASSTHROUGHS = ["getAncestors", "getDeclaredVariables", "getFilename", "getScope", "markVariableAsUsed", // DEPRECATED "getAllComments", "getComments", "getFirstToken", "getFirstTokens", "getJSDocComment", "getLastToken", "getLastTokens", "getNodeByRangeIndex", "getSource", "getSourceLines", "getTokenAfter", "getTokenBefore", "getTokenByRangeStart", "getTokens", "getTokensAfter", "getTokensBefore", "getTokensBetween"]; //------------------------------------------------------------------------------ // Typedefs //------------------------------------------------------------------------------ /** * An error message description * @typedef {Object} MessageDescriptor * @property {string} nodeType The type of node. * @property {Location} loc The location of the problem. * @property {string} message The problem message. * @property {Object} [data] Optional data to use to fill in placeholders in the * message. * @property {Function} fix The function to call that creates a fix command. */ //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ /** * Rule context class * Acts as an abstraction layer between rules and the main eslint object. */ var RuleContext = function () { /** * @param {string} ruleId The ID of the rule using this object. * @param {eslint} eslint The eslint object. * @param {number} severity The configured severity level of the rule. * @param {Array} options The configuration information to be added to the rule. * @param {Object} settings The configuration settings passed from the config file. * @param {Object} parserOptions The parserOptions settings passed from the config file. * @param {Object} parserPath The parser setting passed from the config file. * @param {Object} meta The metadata of the rule * @param {Object} parserServices The parser services for the rule. */ function RuleContext(ruleId, eslint, severity, options, settings, parserOptions, parserPath, meta, parserServices) { _classCallCheck(this, RuleContext); // public. this.id = ruleId; this.options = options; this.settings = settings; this.parserOptions = parserOptions; this.parserPath = parserPath; this.meta = meta; // create a separate copy and freeze it (it's not nice to freeze other people's objects) this.parserServices = Object.freeze(Object.assign({}, parserServices)); // private. this.eslint = eslint; this.severity = severity; Object.freeze(this); } /** * Passthrough to eslint.getSourceCode(). * @returns {SourceCode} The SourceCode object for the code. */ _createClass(RuleContext, [{ key: "getSourceCode", value: function getSourceCode() { return this.eslint.getSourceCode(); } /** * Passthrough to eslint.report() that automatically assigns the rule ID and severity. * @param {ASTNode|MessageDescriptor} nodeOrDescriptor The AST node related to the message or a message * descriptor. * @param {Object=} location The location of the error. * @param {string} message The message to display to the user. * @param {Object} opts Optional template data which produces a formatted message * with symbols being replaced by this object's values. * @returns {void} */ }, { key: "report", value: function report(nodeOrDescriptor, location, message, opts) { // check to see if it's a new style call if (arguments.length === 1) { var descriptor = nodeOrDescriptor; var fix = null; // if there's a fix specified, get it if (typeof descriptor.fix === "function") { fix = descriptor.fix(ruleFixer); } this.eslint.report(this.id, this.severity, descriptor.node, descriptor.loc || descriptor.node.loc.start, descriptor.message, descriptor.data, fix, this.meta); return; } // old style call this.eslint.report(this.id, this.severity, nodeOrDescriptor, location, message, opts, this.meta); } }]); return RuleContext; }(); // Copy over passthrough methods. All functions will have 5 or fewer parameters. PASSTHROUGHS.forEach(function (name) { this[name] = function (a, b, c, d, e) { return this.eslint[name](a, b, c, d, e); }; }, RuleContext.prototype); module.exports = RuleContext; },{"./util/rule-fixer":352}],81:[function(require,module,exports){ /** * @fileoverview Defines a storage for rules. * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } var loadRules = require("./load-rules"); //------------------------------------------------------------------------------ // Public Interface //------------------------------------------------------------------------------ var Rules = function () { function Rules() { _classCallCheck(this, Rules); this._rules = Object.create(null); this.load(); } /** * Registers a rule module for rule id in storage. * @param {string} ruleId Rule id (file name). * @param {Function} ruleModule Rule handler. * @returns {void} */ _createClass(Rules, [{ key: "define", value: function define(ruleId, ruleModule) { this._rules[ruleId] = ruleModule; } /** * Loads and registers all rules from passed rules directory. * @param {string} [rulesDir] Path to rules directory, may be relative. Defaults to `lib/rules`. * @param {string} cwd Current working directory * @returns {void} */ }, { key: "load", value: function load(rulesDir, cwd) { var _this = this; var newRules = loadRules(rulesDir, cwd); Object.keys(newRules).forEach(function (ruleId) { _this.define(ruleId, newRules[ruleId]); }); } /** * Registers all given rules of a plugin. * @param {Object} plugin The plugin object to import. * @param {string} pluginName The name of the plugin without prefix (`eslint-plugin-`). * @returns {void} */ }, { key: "importPlugin", value: function importPlugin(plugin, pluginName) { var _this2 = this; if (plugin.rules) { Object.keys(plugin.rules).forEach(function (ruleId) { var qualifiedRuleId = pluginName + "/" + ruleId, rule = plugin.rules[ruleId]; _this2.define(qualifiedRuleId, rule); }); } } /** * Access rule handler by id (file name). * @param {string} ruleId Rule id (file name). * @returns {Function} Rule handler. */ }, { key: "get", value: function get(ruleId) { if (typeof this._rules[ruleId] === "string") { return require(this._rules[ruleId]); } return this._rules[ruleId]; } /** * Get an object with all currently loaded rules * @returns {Map} All loaded rules */ }, { key: "getAllLoadedRules", value: function getAllLoadedRules() { var _this3 = this; var allRules = new Map(); Object.keys(this._rules).forEach(function (name) { var rule = _this3.get(name); allRules.set(name, rule); }); return allRules; } }]); return Rules; }(); module.exports = Rules; },{"./load-rules":79}],82:[function(require,module,exports){ /** * @fileoverview Rule to flag wrapping non-iife in parens * @author Gyandeep Singh */ "use strict"; //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Checks whether or not a given node is an `Identifier` node which was named a given name. * @param {ASTNode} node - A node to check. * @param {string} name - An expected name of the node. * @returns {boolean} `true` if the node is an `Identifier` node which was named as expected. */ function isIdentifier(node, name) { return node.type === "Identifier" && node.name === name; } /** * Checks whether or not a given node is an argument of a specified method call. * @param {ASTNode} node - A node to check. * @param {number} index - An expected index of the node in arguments. * @param {string} object - An expected name of the object of the method. * @param {string} property - An expected name of the method. * @returns {boolean} `true` if the node is an argument of the specified method call. */ function isArgumentOfMethodCall(node, index, object, property) { var parent = node.parent; return parent.type === "CallExpression" && parent.callee.type === "MemberExpression" && parent.callee.computed === false && isIdentifier(parent.callee.object, object) && isIdentifier(parent.callee.property, property) && parent.arguments[index] === node; } /** * Checks whether or not a given node is a property descriptor. * @param {ASTNode} node - A node to check. * @returns {boolean} `true` if the node is a property descriptor. */ function isPropertyDescriptor(node) { // Object.defineProperty(obj, "foo", {set: ...}) if (isArgumentOfMethodCall(node, 2, "Object", "defineProperty") || isArgumentOfMethodCall(node, 2, "Reflect", "defineProperty")) { return true; } /* * Object.defineProperties(obj, {foo: {set: ...}}) * Object.create(proto, {foo: {set: ...}}) */ node = node.parent.parent; return node.type === "ObjectExpression" && (isArgumentOfMethodCall(node, 1, "Object", "create") || isArgumentOfMethodCall(node, 1, "Object", "defineProperties")); } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce getter and setter pairs in objects", category: "Best Practices", recommended: false }, schema: [{ type: "object", properties: { getWithoutSet: { type: "boolean" }, setWithoutGet: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var config = context.options[0] || {}; var checkGetWithoutSet = config.getWithoutSet === true; var checkSetWithoutGet = config.setWithoutGet !== false; /** * Checks a object expression to see if it has setter and getter both present or none. * @param {ASTNode} node The node to check. * @returns {void} * @private */ function checkLonelySetGet(node) { var isSetPresent = false; var isGetPresent = false; var isDescriptor = isPropertyDescriptor(node); for (var i = 0, end = node.properties.length; i < end; i++) { var property = node.properties[i]; var propToCheck = ""; if (property.kind === "init") { if (isDescriptor && !property.computed) { propToCheck = property.key.name; } } else { propToCheck = property.kind; } switch (propToCheck) { case "set": isSetPresent = true; break; case "get": isGetPresent = true; break; default: // Do nothing } if (isSetPresent && isGetPresent) { break; } } if (checkSetWithoutGet && isSetPresent && !isGetPresent) { context.report({ node: node, message: "Getter is not present." }); } else if (checkGetWithoutSet && isGetPresent && !isSetPresent) { context.report({ node: node, message: "Setter is not present." }); } } return { ObjectExpression: function ObjectExpression(node) { if (checkSetWithoutGet || checkGetWithoutSet) { checkLonelySetGet(node); } } }; } }; },{}],83:[function(require,module,exports){ /** * @fileoverview Rule to enforce linebreaks after open and before close array brackets * @author Jan Peer Stöcklmair */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce linebreaks after opening and before closing array brackets", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ oneOf: [{ enum: ["always", "never"] }, { type: "object", properties: { multiline: { type: "boolean" }, minItems: { type: ["integer", "null"], minimum: 0 } }, additionalProperties: false }] }] }, create: function create(context) { var sourceCode = context.getSourceCode(); //---------------------------------------------------------------------- // Helpers //---------------------------------------------------------------------- /** * Normalizes a given option value. * * @param {string|Object|undefined} option - An option value to parse. * @returns {{multiline: boolean, minItems: number}} Normalized option object. */ function normalizeOptionValue(option) { var multiline = false; var minItems = 0; if (option) { if (option === "always" || option.minItems === 0) { minItems = 0; } else if (option === "never") { minItems = Number.POSITIVE_INFINITY; } else { multiline = Boolean(option.multiline); minItems = option.minItems || Number.POSITIVE_INFINITY; } } else { multiline = true; minItems = Number.POSITIVE_INFINITY; } return { multiline: multiline, minItems: minItems }; } /** * Normalizes a given option value. * * @param {string|Object|undefined} options - An option value to parse. * @returns {{ArrayExpression: {multiline: boolean, minItems: number}, ArrayPattern: {multiline: boolean, minItems: number}}} Normalized option object. */ function normalizeOptions(options) { var value = normalizeOptionValue(options); return { ArrayExpression: value, ArrayPattern: value }; } /** * Reports that there shouldn't be a linebreak after the first token * @param {ASTNode} node - The node to report in the event of an error. * @param {Token} token - The token to use for the report. * @returns {void} */ function reportNoBeginningLinebreak(node, token) { context.report({ node: node, loc: token.loc, message: "There should be no linebreak after '['.", fix: function fix(fixer) { var nextToken = sourceCode.getTokenAfter(token, { includeComments: true }); if (astUtils.isCommentToken(nextToken)) { return null; } return fixer.removeRange([token.range[1], nextToken.range[0]]); } }); } /** * Reports that there shouldn't be a linebreak before the last token * @param {ASTNode} node - The node to report in the event of an error. * @param {Token} token - The token to use for the report. * @returns {void} */ function reportNoEndingLinebreak(node, token) { context.report({ node: node, loc: token.loc, message: "There should be no linebreak before ']'.", fix: function fix(fixer) { var previousToken = sourceCode.getTokenBefore(token, { includeComments: true }); if (astUtils.isCommentToken(previousToken)) { return null; } return fixer.removeRange([previousToken.range[1], token.range[0]]); } }); } /** * Reports that there should be a linebreak after the first token * @param {ASTNode} node - The node to report in the event of an error. * @param {Token} token - The token to use for the report. * @returns {void} */ function reportRequiredBeginningLinebreak(node, token) { context.report({ node: node, loc: token.loc, message: "A linebreak is required after '['.", fix: function fix(fixer) { return fixer.insertTextAfter(token, "\n"); } }); } /** * Reports that there should be a linebreak before the last token * @param {ASTNode} node - The node to report in the event of an error. * @param {Token} token - The token to use for the report. * @returns {void} */ function reportRequiredEndingLinebreak(node, token) { context.report({ node: node, loc: token.loc, message: "A linebreak is required before ']'.", fix: function fix(fixer) { return fixer.insertTextBefore(token, "\n"); } }); } /** * Reports a given node if it violated this rule. * * @param {ASTNode} node - A node to check. This is an ObjectExpression node or an ObjectPattern node. * @param {{multiline: boolean, minItems: number}} options - An option object. * @returns {void} */ function check(node) { var elements = node.elements; var normalizedOptions = normalizeOptions(context.options[0]); var options = normalizedOptions[node.type]; var openBracket = sourceCode.getFirstToken(node); var closeBracket = sourceCode.getLastToken(node); var firstIncComment = sourceCode.getTokenAfter(openBracket, { includeComments: true }); var lastIncComment = sourceCode.getTokenBefore(closeBracket, { includeComments: true }); var first = sourceCode.getTokenAfter(openBracket); var last = sourceCode.getTokenBefore(closeBracket); var needsLinebreaks = elements.length >= options.minItems || options.multiline && elements.length > 0 && firstIncComment.loc.start.line !== lastIncComment.loc.end.line; /* * Use tokens or comments to check multiline or not. * But use only tokens to check whether linebreaks are needed. * This allows: * var arr = [ // eslint-disable-line foo * 'a' * ] */ if (needsLinebreaks) { if (astUtils.isTokenOnSameLine(openBracket, first)) { reportRequiredBeginningLinebreak(node, openBracket); } if (astUtils.isTokenOnSameLine(last, closeBracket)) { reportRequiredEndingLinebreak(node, closeBracket); } } else { if (!astUtils.isTokenOnSameLine(openBracket, first)) { reportNoBeginningLinebreak(node, openBracket); } if (!astUtils.isTokenOnSameLine(last, closeBracket)) { reportNoEndingLinebreak(node, closeBracket); } } } //---------------------------------------------------------------------- // Public //---------------------------------------------------------------------- return { ArrayPattern: check, ArrayExpression: check }; } }; },{"../ast-utils":67}],84:[function(require,module,exports){ /** * @fileoverview Disallows or enforces spaces inside of array brackets. * @author Jamund Ferguson */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce consistent spacing inside array brackets", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ enum: ["always", "never"] }, { type: "object", properties: { singleValue: { type: "boolean" }, objectsInArrays: { type: "boolean" }, arraysInArrays: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var spaced = context.options[0] === "always", sourceCode = context.getSourceCode(); /** * Determines whether an option is set, relative to the spacing option. * If spaced is "always", then check whether option is set to false. * If spaced is "never", then check whether option is set to true. * @param {Object} option - The option to exclude. * @returns {boolean} Whether or not the property is excluded. */ function isOptionSet(option) { return context.options[1] ? context.options[1][option] === !spaced : false; } var options = { spaced: spaced, singleElementException: isOptionSet("singleValue"), objectsInArraysException: isOptionSet("objectsInArrays"), arraysInArraysException: isOptionSet("arraysInArrays") }; //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Reports that there shouldn't be a space after the first token * @param {ASTNode} node - The node to report in the event of an error. * @param {Token} token - The token to use for the report. * @returns {void} */ function reportNoBeginningSpace(node, token) { context.report({ node: node, loc: token.loc.start, message: "There should be no space after '{{tokenValue}}'.", data: { tokenValue: token.value }, fix: function fix(fixer) { var nextToken = sourceCode.getTokenAfter(token); return fixer.removeRange([token.range[1], nextToken.range[0]]); } }); } /** * Reports that there shouldn't be a space before the last token * @param {ASTNode} node - The node to report in the event of an error. * @param {Token} token - The token to use for the report. * @returns {void} */ function reportNoEndingSpace(node, token) { context.report({ node: node, loc: token.loc.start, message: "There should be no space before '{{tokenValue}}'.", data: { tokenValue: token.value }, fix: function fix(fixer) { var previousToken = sourceCode.getTokenBefore(token); return fixer.removeRange([previousToken.range[1], token.range[0]]); } }); } /** * Reports that there should be a space after the first token * @param {ASTNode} node - The node to report in the event of an error. * @param {Token} token - The token to use for the report. * @returns {void} */ function reportRequiredBeginningSpace(node, token) { context.report({ node: node, loc: token.loc.start, message: "A space is required after '{{tokenValue}}'.", data: { tokenValue: token.value }, fix: function fix(fixer) { return fixer.insertTextAfter(token, " "); } }); } /** * Reports that there should be a space before the last token * @param {ASTNode} node - The node to report in the event of an error. * @param {Token} token - The token to use for the report. * @returns {void} */ function reportRequiredEndingSpace(node, token) { context.report({ node: node, loc: token.loc.start, message: "A space is required before '{{tokenValue}}'.", data: { tokenValue: token.value }, fix: function fix(fixer) { return fixer.insertTextBefore(token, " "); } }); } /** * Determines if a node is an object type * @param {ASTNode} node - The node to check. * @returns {boolean} Whether or not the node is an object type. */ function isObjectType(node) { return node && (node.type === "ObjectExpression" || node.type === "ObjectPattern"); } /** * Determines if a node is an array type * @param {ASTNode} node - The node to check. * @returns {boolean} Whether or not the node is an array type. */ function isArrayType(node) { return node && (node.type === "ArrayExpression" || node.type === "ArrayPattern"); } /** * Validates the spacing around array brackets * @param {ASTNode} node - The node we're checking for spacing * @returns {void} */ function validateArraySpacing(node) { if (options.spaced && node.elements.length === 0) { return; } var first = sourceCode.getFirstToken(node), second = sourceCode.getFirstToken(node, 1), last = node.typeAnnotation ? sourceCode.getTokenBefore(node.typeAnnotation) : sourceCode.getLastToken(node), penultimate = sourceCode.getTokenBefore(last), firstElement = node.elements[0], lastElement = node.elements[node.elements.length - 1]; var openingBracketMustBeSpaced = options.objectsInArraysException && isObjectType(firstElement) || options.arraysInArraysException && isArrayType(firstElement) || options.singleElementException && node.elements.length === 1 ? !options.spaced : options.spaced; var closingBracketMustBeSpaced = options.objectsInArraysException && isObjectType(lastElement) || options.arraysInArraysException && isArrayType(lastElement) || options.singleElementException && node.elements.length === 1 ? !options.spaced : options.spaced; if (astUtils.isTokenOnSameLine(first, second)) { if (openingBracketMustBeSpaced && !sourceCode.isSpaceBetweenTokens(first, second)) { reportRequiredBeginningSpace(node, first); } if (!openingBracketMustBeSpaced && sourceCode.isSpaceBetweenTokens(first, second)) { reportNoBeginningSpace(node, first); } } if (first !== penultimate && astUtils.isTokenOnSameLine(penultimate, last)) { if (closingBracketMustBeSpaced && !sourceCode.isSpaceBetweenTokens(penultimate, last)) { reportRequiredEndingSpace(node, last); } if (!closingBracketMustBeSpaced && sourceCode.isSpaceBetweenTokens(penultimate, last)) { reportNoEndingSpace(node, last); } } } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { ArrayPattern: validateArraySpacing, ArrayExpression: validateArraySpacing }; } }; },{"../ast-utils":67}],85:[function(require,module,exports){ /** * @fileoverview Rule to enforce return statements in callbacks of array's methods * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var lodash = require("lodash"); var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var TARGET_NODE_TYPE = /^(?:Arrow)?FunctionExpression$/; var TARGET_METHODS = /^(?:every|filter|find(?:Index)?|map|reduce(?:Right)?|some|sort)$/; /** * Checks a given code path segment is reachable. * * @param {CodePathSegment} segment - A segment to check. * @returns {boolean} `true` if the segment is reachable. */ function isReachable(segment) { return segment.reachable; } /** * Gets a readable location. * * - FunctionExpression -> the function name or `function` keyword. * - ArrowFunctionExpression -> `=>` token. * * @param {ASTNode} node - A function node to get. * @param {SourceCode} sourceCode - A source code to get tokens. * @returns {ASTNode|Token} The node or the token of a location. */ function getLocation(node, sourceCode) { if (node.type === "ArrowFunctionExpression") { return sourceCode.getTokenBefore(node.body); } return node.id || node; } /** * Checks a given node is a MemberExpression node which has the specified name's * property. * * @param {ASTNode} node - A node to check. * @returns {boolean} `true` if the node is a MemberExpression node which has * the specified name's property */ function isTargetMethod(node) { return node.type === "MemberExpression" && TARGET_METHODS.test(astUtils.getStaticPropertyName(node) || ""); } /** * Checks whether or not a given node is a function expression which is the * callback of an array method. * * @param {ASTNode} node - A node to check. This is one of * FunctionExpression or ArrowFunctionExpression. * @returns {boolean} `true` if the node is the callback of an array method. */ function isCallbackOfArrayMethod(node) { while (node) { var parent = node.parent; switch (parent.type) { /* * Looks up the destination. e.g., * foo.every(nativeFoo || function foo() { ... }); */ case "LogicalExpression": case "ConditionalExpression": node = parent; break; // If the upper function is IIFE, checks the destination of the return value. // e.g. // foo.every((function() { // // setup... // return function callback() { ... }; // })()); case "ReturnStatement": { var func = astUtils.getUpperFunction(parent); if (func === null || !astUtils.isCallee(func)) { return false; } node = func.parent; break; } // e.g. // Array.from([], function() {}); // list.every(function() {}); case "CallExpression": if (astUtils.isArrayFromMethod(parent.callee)) { return parent.arguments.length >= 2 && parent.arguments[1] === node; } if (isTargetMethod(parent.callee)) { return parent.arguments.length >= 1 && parent.arguments[0] === node; } return false; // Otherwise this node is not target. default: return false; } } /* istanbul ignore next: unreachable */ return false; } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce `return` statements in callbacks of array methods", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { var funcInfo = { upper: null, codePath: null, hasReturn: false, shouldCheck: false, node: null }; /** * Checks whether or not the last code path segment is reachable. * Then reports this function if the segment is reachable. * * If the last code path segment is reachable, there are paths which are not * returned or thrown. * * @param {ASTNode} node - A node to check. * @returns {void} */ function checkLastSegment(node) { if (funcInfo.shouldCheck && funcInfo.codePath.currentSegments.some(isReachable)) { context.report({ node: node, loc: getLocation(node, context.getSourceCode()).loc.start, message: funcInfo.hasReturn ? "Expected to return a value at the end of {{name}}." : "Expected to return a value in {{name}}.", data: { name: astUtils.getFunctionNameWithKind(funcInfo.node) } }); } } return { // Stacks this function's information. onCodePathStart: function onCodePathStart(codePath, node) { funcInfo = { upper: funcInfo, codePath: codePath, hasReturn: false, shouldCheck: TARGET_NODE_TYPE.test(node.type) && node.body.type === "BlockStatement" && isCallbackOfArrayMethod(node) && !node.async && !node.generator, node: node }; }, // Pops this function's information. onCodePathEnd: function onCodePathEnd() { funcInfo = funcInfo.upper; }, // Checks the return statement is valid. ReturnStatement: function ReturnStatement(node) { if (funcInfo.shouldCheck) { funcInfo.hasReturn = true; if (!node.argument) { context.report({ node: node, message: "{{name}} expected a return value.", data: { name: lodash.upperFirst(astUtils.getFunctionNameWithKind(funcInfo.node)) } }); } } }, // Reports a given function if the last path is reachable. "FunctionExpression:exit": checkLastSegment, "ArrowFunctionExpression:exit": checkLastSegment }; } }; },{"../ast-utils":67,"lodash":48}],86:[function(require,module,exports){ /** * @fileoverview Rule to enforce line breaks after each array element * @author Jan Peer Stöcklmair */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce line breaks after each array element", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ oneOf: [{ enum: ["always", "never"] }, { type: "object", properties: { multiline: { type: "boolean" }, minItems: { type: ["integer", "null"], minimum: 0 } }, additionalProperties: false }] }] }, create: function create(context) { var sourceCode = context.getSourceCode(); //---------------------------------------------------------------------- // Helpers //---------------------------------------------------------------------- /** * Normalizes a given option value. * * @param {string|Object|undefined} option - An option value to parse. * @returns {{multiline: boolean, minItems: number}} Normalized option object. */ function normalizeOptionValue(option) { var multiline = false; var minItems = void 0; option = option || "always"; if (option === "always" || option.minItems === 0) { minItems = 0; } else if (option === "never") { minItems = Number.POSITIVE_INFINITY; } else { multiline = Boolean(option.multiline); minItems = option.minItems || Number.POSITIVE_INFINITY; } return { multiline: multiline, minItems: minItems }; } /** * Normalizes a given option value. * * @param {string|Object|undefined} options - An option value to parse. * @returns {{ArrayExpression: {multiline: boolean, minItems: number}, ArrayPattern: {multiline: boolean, minItems: number}}} Normalized option object. */ function normalizeOptions(options) { var value = normalizeOptionValue(options); return { ArrayExpression: value, ArrayPattern: value }; } /** * Reports that there shouldn't be a line break after the first token * @param {Token} token - The token to use for the report. * @returns {void} */ function reportNoLineBreak(token) { var tokenBefore = sourceCode.getTokenBefore(token, { includeComments: true }); context.report({ loc: { start: tokenBefore.loc.end, end: token.loc.start }, message: "There should be no linebreak here.", fix: function fix(fixer) { if (astUtils.isCommentToken(tokenBefore)) { return null; } if (!astUtils.isTokenOnSameLine(tokenBefore, token)) { return fixer.replaceTextRange([tokenBefore.range[1], token.range[0]], " "); } /* * This will check if the comma is on the same line as the next element * Following array: * [ * 1 * , 2 * , 3 * ] * * will be fixed to: * [ * 1, 2, 3 * ] */ var twoTokensBefore = sourceCode.getTokenBefore(tokenBefore, { includeComments: true }); if (astUtils.isCommentToken(twoTokensBefore)) { return null; } return fixer.replaceTextRange([twoTokensBefore.range[1], tokenBefore.range[0]], ""); } }); } /** * Reports that there should be a line break after the first token * @param {Token} token - The token to use for the report. * @returns {void} */ function reportRequiredLineBreak(token) { var tokenBefore = sourceCode.getTokenBefore(token, { includeComments: true }); context.report({ loc: { start: tokenBefore.loc.end, end: token.loc.start }, message: "There should be a linebreak after this element.", fix: function fix(fixer) { return fixer.replaceTextRange([tokenBefore.range[1], token.range[0]], "\n"); } }); } /** * Reports a given node if it violated this rule. * * @param {ASTNode} node - A node to check. This is an ObjectExpression node or an ObjectPattern node. * @param {{multiline: boolean, minItems: number}} options - An option object. * @returns {void} */ function check(node) { var elements = node.elements; var normalizedOptions = normalizeOptions(context.options[0]); var options = normalizedOptions[node.type]; var elementBreak = false; /* * MULTILINE: true * loop through every element and check * if at least one element has linebreaks inside * this ensures that following is not valid (due to elements are on the same line): * * [ * 1, * 2, * 3 * ] */ if (options.multiline) { elementBreak = elements.filter(function (element) { return element !== null; }).some(function (element) { return element.loc.start.line !== element.loc.end.line; }); } var needsLinebreaks = elements.length >= options.minItems || options.multiline && elementBreak; elements.forEach(function (element, i) { var previousElement = elements[i - 1]; if (i === 0 || element === null || previousElement === null) { return; } var commaToken = sourceCode.getFirstTokenBetween(previousElement, element, astUtils.isCommaToken); var lastTokenOfPreviousElement = sourceCode.getTokenBefore(commaToken); var firstTokenOfCurrentElement = sourceCode.getTokenAfter(commaToken); if (needsLinebreaks) { if (astUtils.isTokenOnSameLine(lastTokenOfPreviousElement, firstTokenOfCurrentElement)) { reportRequiredLineBreak(firstTokenOfCurrentElement); } } else { if (!astUtils.isTokenOnSameLine(lastTokenOfPreviousElement, firstTokenOfCurrentElement)) { reportNoLineBreak(firstTokenOfCurrentElement); } } }); } //---------------------------------------------------------------------- // Public //---------------------------------------------------------------------- return { ArrayPattern: check, ArrayExpression: check }; } }; },{"../ast-utils":67}],87:[function(require,module,exports){ /** * @fileoverview Rule to require braces in arrow function body. * @author Alberto Rodríguez */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require braces around arrow function bodies", category: "ECMAScript 6", recommended: false }, schema: { anyOf: [{ type: "array", items: [{ enum: ["always", "never"] }], minItems: 0, maxItems: 1 }, { type: "array", items: [{ enum: ["as-needed"] }, { type: "object", properties: { requireReturnForObjectLiteral: { type: "boolean" } }, additionalProperties: false }], minItems: 0, maxItems: 2 }] }, fixable: "code" }, create: function create(context) { var options = context.options; var always = options[0] === "always"; var asNeeded = !options[0] || options[0] === "as-needed"; var never = options[0] === "never"; var requireReturnForObjectLiteral = options[1] && options[1].requireReturnForObjectLiteral; var sourceCode = context.getSourceCode(); /** * Determines whether a arrow function body needs braces * @param {ASTNode} node The arrow function node. * @returns {void} */ function validate(node) { var arrowBody = node.body; if (arrowBody.type === "BlockStatement") { var blockBody = arrowBody.body; if (blockBody.length !== 1 && !never) { return; } if (asNeeded && requireReturnForObjectLiteral && blockBody[0].type === "ReturnStatement" && blockBody[0].argument && blockBody[0].argument.type === "ObjectExpression") { return; } if (never || asNeeded && blockBody[0].type === "ReturnStatement") { context.report({ node: node, loc: arrowBody.loc.start, message: "Unexpected block statement surrounding arrow body.", fix: function fix(fixer) { if (blockBody.length !== 1 || blockBody[0].type !== "ReturnStatement" || !blockBody[0].argument) { return null; } var sourceText = sourceCode.getText(); var returnKeyword = sourceCode.getFirstToken(blockBody[0]); var firstValueToken = sourceCode.getTokenAfter(returnKeyword); var lastValueToken = sourceCode.getLastToken(blockBody[0]); if (astUtils.isSemicolonToken(lastValueToken)) { /* The last token of the returned value is the last token of the ReturnExpression (if * the ReturnExpression has no semicolon), or the second-to-last token (if the ReturnExpression * has a semicolon). */ lastValueToken = sourceCode.getTokenBefore(lastValueToken); } var tokenAfterArrowBody = sourceCode.getTokenAfter(arrowBody); if (tokenAfterArrowBody && tokenAfterArrowBody.type === "Punctuator" && /^[([/`+-]/.test(tokenAfterArrowBody.value)) { // Don't do a fix if the next token would cause ASI issues when preceded by the returned value. return null; } var textBeforeReturn = sourceText.slice(arrowBody.range[0] + 1, returnKeyword.range[0]); var textBetweenReturnAndValue = sourceText.slice(returnKeyword.range[1], firstValueToken.range[0]); var rawReturnValueText = sourceText.slice(firstValueToken.range[0], lastValueToken.range[1]); var returnValueText = astUtils.isOpeningBraceToken(firstValueToken) ? "(" + rawReturnValueText + ")" : rawReturnValueText; var textAfterValue = sourceText.slice(lastValueToken.range[1], blockBody[0].range[1] - 1); var textAfterReturnStatement = sourceText.slice(blockBody[0].range[1], arrowBody.range[1] - 1); /* * For fixes that only contain spaces around the return value, remove the extra spaces. * This avoids ugly fixes that end up with extra spaces after the arrow, e.g. `() => 0 ;` */ return fixer.replaceText(arrowBody, (textBeforeReturn + textBetweenReturnAndValue).replace(/^\s*$/, "") + returnValueText + (textAfterValue + textAfterReturnStatement).replace(/^\s*$/, "")); } }); } } else { if (always || asNeeded && requireReturnForObjectLiteral && arrowBody.type === "ObjectExpression") { context.report({ node: node, loc: arrowBody.loc.start, message: "Expected block statement surrounding arrow body.", fix: function fix(fixer) { var lastTokenBeforeBody = sourceCode.getLastTokenBetween(sourceCode.getFirstToken(node), arrowBody, astUtils.isNotOpeningParenToken); var firstBodyToken = sourceCode.getTokenAfter(lastTokenBeforeBody); return fixer.replaceTextRange([firstBodyToken.range[0], node.range[1]], "{return " + sourceCode.getText().slice(firstBodyToken.range[0], node.range[1]) + "}"); } }); } } } return { ArrowFunctionExpression: validate }; } }; },{"../ast-utils":67}],88:[function(require,module,exports){ /** * @fileoverview Rule to require parens in arrow function arguments. * @author Jxck */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require parentheses around arrow function arguments", category: "ECMAScript 6", recommended: false }, fixable: "code", schema: [{ enum: ["always", "as-needed"] }, { type: "object", properties: { requireForBlockBody: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var message = "Expected parentheses around arrow function argument."; var asNeededMessage = "Unexpected parentheses around single function argument."; var asNeeded = context.options[0] === "as-needed"; var requireForBlockBodyMessage = "Unexpected parentheses around single function argument having a body with no curly braces"; var requireForBlockBodyNoParensMessage = "Expected parentheses around arrow function argument having a body with curly braces."; var requireForBlockBody = asNeeded && context.options[1] && context.options[1].requireForBlockBody === true; var sourceCode = context.getSourceCode(); /** * Determines whether a arrow function argument end with `)` * @param {ASTNode} node The arrow function node. * @returns {void} */ function parens(node) { var isAsync = node.async; var firstTokenOfParam = sourceCode.getFirstToken(node, isAsync ? 1 : 0); /** * Remove the parenthesis around a parameter * @param {Fixer} fixer Fixer * @returns {string} fixed parameter */ function fixParamsWithParenthesis(fixer) { var paramToken = sourceCode.getTokenAfter(firstTokenOfParam); var closingParenToken = sourceCode.getTokenAfter(paramToken); var asyncToken = isAsync ? sourceCode.getTokenBefore(firstTokenOfParam) : null; var shouldAddSpaceForAsync = asyncToken && asyncToken.end === firstTokenOfParam.start; return fixer.replaceTextRange([firstTokenOfParam.range[0], closingParenToken.range[1]], "" + (shouldAddSpaceForAsync ? " " : "") + paramToken.value); } // "as-needed", { "requireForBlockBody": true }: x => x if (requireForBlockBody && node.params.length === 1 && node.params[0].type === "Identifier" && !node.params[0].typeAnnotation && node.body.type !== "BlockStatement" && !node.returnType) { if (astUtils.isOpeningParenToken(firstTokenOfParam)) { context.report({ node: node, message: requireForBlockBodyMessage, fix: fixParamsWithParenthesis }); } return; } if (requireForBlockBody && node.body.type === "BlockStatement") { if (!astUtils.isOpeningParenToken(firstTokenOfParam)) { context.report({ node: node, message: requireForBlockBodyNoParensMessage, fix: function fix(fixer) { return fixer.replaceText(firstTokenOfParam, "(" + firstTokenOfParam.value + ")"); } }); } return; } // "as-needed": x => x if (asNeeded && node.params.length === 1 && node.params[0].type === "Identifier" && !node.params[0].typeAnnotation && !node.returnType) { if (astUtils.isOpeningParenToken(firstTokenOfParam)) { context.report({ node: node, message: asNeededMessage, fix: fixParamsWithParenthesis }); } return; } if (firstTokenOfParam.type === "Identifier") { var after = sourceCode.getTokenAfter(firstTokenOfParam); // (x) => x if (after.value !== ")") { context.report({ node: node, message: message, fix: function fix(fixer) { return fixer.replaceText(firstTokenOfParam, "(" + firstTokenOfParam.value + ")"); } }); } } } return { ArrowFunctionExpression: parens }; } }; },{"../ast-utils":67}],89:[function(require,module,exports){ /** * @fileoverview Rule to define spacing before/after arrow function's arrow. * @author Jxck */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce consistent spacing before and after the arrow in arrow functions", category: "ECMAScript 6", recommended: false }, fixable: "whitespace", schema: [{ type: "object", properties: { before: { type: "boolean" }, after: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { // merge rules with default var rule = { before: true, after: true }, option = context.options[0] || {}; rule.before = option.before !== false; rule.after = option.after !== false; var sourceCode = context.getSourceCode(); /** * Get tokens of arrow(`=>`) and before/after arrow. * @param {ASTNode} node The arrow function node. * @returns {Object} Tokens of arrow and before/after arrow. */ function getTokens(node) { var arrow = sourceCode.getTokenBefore(node.body, astUtils.isArrowToken); return { before: sourceCode.getTokenBefore(arrow), arrow: arrow, after: sourceCode.getTokenAfter(arrow) }; } /** * Count spaces before/after arrow(`=>`) token. * @param {Object} tokens Tokens before/after arrow. * @returns {Object} count of space before/after arrow. */ function countSpaces(tokens) { var before = tokens.arrow.range[0] - tokens.before.range[1]; var after = tokens.after.range[0] - tokens.arrow.range[1]; return { before: before, after: after }; } /** * Determines whether space(s) before after arrow(`=>`) is satisfy rule. * if before/after value is `true`, there should be space(s). * if before/after value is `false`, there should be no space. * @param {ASTNode} node The arrow function node. * @returns {void} */ function spaces(node) { var tokens = getTokens(node); var countSpace = countSpaces(tokens); if (rule.before) { // should be space(s) before arrow if (countSpace.before === 0) { context.report({ node: tokens.before, message: "Missing space before =>.", fix: function fix(fixer) { return fixer.insertTextBefore(tokens.arrow, " "); } }); } } else { // should be no space before arrow if (countSpace.before > 0) { context.report({ node: tokens.before, message: "Unexpected space before =>.", fix: function fix(fixer) { return fixer.removeRange([tokens.before.range[1], tokens.arrow.range[0]]); } }); } } if (rule.after) { // should be space(s) after arrow if (countSpace.after === 0) { context.report({ node: tokens.after, message: "Missing space after =>.", fix: function fix(fixer) { return fixer.insertTextAfter(tokens.arrow, " "); } }); } } else { // should be no space after arrow if (countSpace.after > 0) { context.report({ node: tokens.after, message: "Unexpected space after =>.", fix: function fix(fixer) { return fixer.removeRange([tokens.arrow.range[1], tokens.after.range[0]]); } }); } } } return { ArrowFunctionExpression: spaces }; } }; },{"../ast-utils":67}],90:[function(require,module,exports){ /** * @fileoverview Rule to check for "block scoped" variables by binding context * @author Matt DuVall */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce the use of variables within the scope they are defined", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { var stack = []; /** * Makes a block scope. * @param {ASTNode} node - A node of a scope. * @returns {void} */ function enterScope(node) { stack.push(node.range); } /** * Pops the last block scope. * @returns {void} */ function exitScope() { stack.pop(); } /** * Reports a given reference. * @param {eslint-scope.Reference} reference - A reference to report. * @returns {void} */ function report(reference) { var identifier = reference.identifier; context.report({ node: identifier, message: "'{{name}}' used outside of binding context.", data: { name: identifier.name } }); } /** * Finds and reports references which are outside of valid scopes. * @param {ASTNode} node - A node to get variables. * @returns {void} */ function checkForVariables(node) { if (node.kind !== "var") { return; } // Defines a predicate to check whether or not a given reference is outside of valid scope. var scopeRange = stack[stack.length - 1]; /** * Check if a reference is out of scope * @param {ASTNode} reference node to examine * @returns {boolean} True is its outside the scope * @private */ function isOutsideOfScope(reference) { var idRange = reference.identifier.range; return idRange[0] < scopeRange[0] || idRange[1] > scopeRange[1]; } // Gets declared variables, and checks its references. var variables = context.getDeclaredVariables(node); for (var i = 0; i < variables.length; ++i) { // Reports. variables[i].references.filter(isOutsideOfScope).forEach(report); } } return { Program: function Program(node) { stack = [node.range]; }, // Manages scopes. BlockStatement: enterScope, "BlockStatement:exit": exitScope, ForStatement: enterScope, "ForStatement:exit": exitScope, ForInStatement: enterScope, "ForInStatement:exit": exitScope, ForOfStatement: enterScope, "ForOfStatement:exit": exitScope, SwitchStatement: enterScope, "SwitchStatement:exit": exitScope, CatchClause: enterScope, "CatchClause:exit": exitScope, // Finds and reports references which are outside of valid scope. VariableDeclaration: checkForVariables }; } }; },{}],91:[function(require,module,exports){ /** * @fileoverview A rule to disallow or enforce spaces inside of single line blocks. * @author Toru Nagashima */ "use strict"; var util = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce consistent spacing inside single-line blocks", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ enum: ["always", "never"] }] }, create: function create(context) { var always = context.options[0] !== "never", message = always ? "Requires a space" : "Unexpected space(s)", sourceCode = context.getSourceCode(); /** * Gets the open brace token from a given node. * @param {ASTNode} node - A BlockStatement/SwitchStatement node to get. * @returns {Token} The token of the open brace. */ function getOpenBrace(node) { if (node.type === "SwitchStatement") { if (node.cases.length > 0) { return sourceCode.getTokenBefore(node.cases[0]); } return sourceCode.getLastToken(node, 1); } return sourceCode.getFirstToken(node); } /** * Checks whether or not: * - given tokens are on same line. * - there is/isn't a space between given tokens. * @param {Token} left - A token to check. * @param {Token} right - The token which is next to `left`. * @returns {boolean} * When the option is `"always"`, `true` if there are one or more spaces between given tokens. * When the option is `"never"`, `true` if there are not any spaces between given tokens. * If given tokens are not on same line, it's always `true`. */ function isValid(left, right) { return !util.isTokenOnSameLine(left, right) || sourceCode.isSpaceBetweenTokens(left, right) === always; } /** * Reports invalid spacing style inside braces. * @param {ASTNode} node - A BlockStatement/SwitchStatement node to get. * @returns {void} */ function checkSpacingInsideBraces(node) { // Gets braces and the first/last token of content. var openBrace = getOpenBrace(node); var closeBrace = sourceCode.getLastToken(node); var firstToken = sourceCode.getTokenAfter(openBrace, { includeComments: true }); var lastToken = sourceCode.getTokenBefore(closeBrace, { includeComments: true }); // Skip if the node is invalid or empty. if (openBrace.type !== "Punctuator" || openBrace.value !== "{" || closeBrace.type !== "Punctuator" || closeBrace.value !== "}" || firstToken === closeBrace) { return; } // Skip line comments for option never if (!always && firstToken.type === "Line") { return; } // Check. if (!isValid(openBrace, firstToken)) { context.report({ node: node, loc: openBrace.loc.start, message: "{{message}} after '{'.", data: { message: message }, fix: function fix(fixer) { if (always) { return fixer.insertTextBefore(firstToken, " "); } return fixer.removeRange([openBrace.range[1], firstToken.range[0]]); } }); } if (!isValid(lastToken, closeBrace)) { context.report({ node: node, loc: closeBrace.loc.start, message: "{{message}} before '}'.", data: { message: message }, fix: function fix(fixer) { if (always) { return fixer.insertTextAfter(lastToken, " "); } return fixer.removeRange([lastToken.range[1], closeBrace.range[0]]); } }); } } return { BlockStatement: checkSpacingInsideBraces, SwitchStatement: checkSpacingInsideBraces }; } }; },{"../ast-utils":67}],92:[function(require,module,exports){ /** * @fileoverview Rule to flag block statements that do not use the one true brace style * @author Ian Christian Myers */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce consistent brace style for blocks", category: "Stylistic Issues", recommended: false }, schema: [{ enum: ["1tbs", "stroustrup", "allman"] }, { type: "object", properties: { allowSingleLine: { type: "boolean" } }, additionalProperties: false }], fixable: "whitespace" }, create: function create(context) { var style = context.options[0] || "1tbs", params = context.options[1] || {}, sourceCode = context.getSourceCode(); var OPEN_MESSAGE = "Opening curly brace does not appear on the same line as controlling statement.", OPEN_MESSAGE_ALLMAN = "Opening curly brace appears on the same line as controlling statement.", BODY_MESSAGE = "Statement inside of curly braces should be on next line.", CLOSE_MESSAGE = "Closing curly brace does not appear on the same line as the subsequent block.", CLOSE_MESSAGE_SINGLE = "Closing curly brace should be on the same line as opening curly brace or on the line after the previous block.", CLOSE_MESSAGE_STROUSTRUP_ALLMAN = "Closing curly brace appears on the same line as the subsequent block."; //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Fixes a place where a newline unexpectedly appears * @param {Token} firstToken The token before the unexpected newline * @param {Token} secondToken The token after the unexpected newline * @returns {Function} A fixer function to remove the newlines between the tokens */ function removeNewlineBetween(firstToken, secondToken) { var textRange = [firstToken.range[1], secondToken.range[0]]; var textBetween = sourceCode.text.slice(textRange[0], textRange[1]); // Don't do a fix if there is a comment between the tokens if (textBetween.trim()) { return null; } return function (fixer) { return fixer.replaceTextRange(textRange, " "); }; } /** * Validates a pair of curly brackets based on the user's config * @param {Token} openingCurly The opening curly bracket * @param {Token} closingCurly The closing curly bracket * @returns {void} */ function validateCurlyPair(openingCurly, closingCurly) { var tokenBeforeOpeningCurly = sourceCode.getTokenBefore(openingCurly); var tokenAfterOpeningCurly = sourceCode.getTokenAfter(openingCurly); var tokenBeforeClosingCurly = sourceCode.getTokenBefore(closingCurly); var singleLineException = params.allowSingleLine && astUtils.isTokenOnSameLine(openingCurly, closingCurly); if (style !== "allman" && !astUtils.isTokenOnSameLine(tokenBeforeOpeningCurly, openingCurly)) { context.report({ node: openingCurly, message: OPEN_MESSAGE, fix: removeNewlineBetween(tokenBeforeOpeningCurly, openingCurly) }); } if (style === "allman" && astUtils.isTokenOnSameLine(tokenBeforeOpeningCurly, openingCurly) && !singleLineException) { context.report({ node: openingCurly, message: OPEN_MESSAGE_ALLMAN, fix: function fix(fixer) { return fixer.insertTextBefore(openingCurly, "\n"); } }); } if (astUtils.isTokenOnSameLine(openingCurly, tokenAfterOpeningCurly) && tokenAfterOpeningCurly !== closingCurly && !singleLineException) { context.report({ node: openingCurly, message: BODY_MESSAGE, fix: function fix(fixer) { return fixer.insertTextAfter(openingCurly, "\n"); } }); } if (tokenBeforeClosingCurly !== openingCurly && !singleLineException && astUtils.isTokenOnSameLine(tokenBeforeClosingCurly, closingCurly)) { context.report({ node: closingCurly, message: CLOSE_MESSAGE_SINGLE, fix: function fix(fixer) { return fixer.insertTextBefore(closingCurly, "\n"); } }); } } /** * Validates the location of a token that appears before a keyword (e.g. a newline before `else`) * @param {Token} curlyToken The closing curly token. This is assumed to precede a keyword token (such as `else` or `finally`). * @returns {void} */ function validateCurlyBeforeKeyword(curlyToken) { var keywordToken = sourceCode.getTokenAfter(curlyToken); if (style === "1tbs" && !astUtils.isTokenOnSameLine(curlyToken, keywordToken)) { context.report({ node: curlyToken, message: CLOSE_MESSAGE, fix: removeNewlineBetween(curlyToken, keywordToken) }); } if (style !== "1tbs" && astUtils.isTokenOnSameLine(curlyToken, keywordToken)) { context.report({ node: curlyToken, message: CLOSE_MESSAGE_STROUSTRUP_ALLMAN, fix: function fix(fixer) { return fixer.insertTextAfter(curlyToken, "\n"); } }); } } //-------------------------------------------------------------------------- // Public API //-------------------------------------------------------------------------- return { BlockStatement: function BlockStatement(node) { if (!astUtils.STATEMENT_LIST_PARENTS.has(node.parent.type)) { validateCurlyPair(sourceCode.getFirstToken(node), sourceCode.getLastToken(node)); } }, ClassBody: function ClassBody(node) { validateCurlyPair(sourceCode.getFirstToken(node), sourceCode.getLastToken(node)); }, SwitchStatement: function SwitchStatement(node) { var closingCurly = sourceCode.getLastToken(node); var openingCurly = sourceCode.getTokenBefore(node.cases.length ? node.cases[0] : closingCurly); validateCurlyPair(openingCurly, closingCurly); }, IfStatement: function IfStatement(node) { if (node.consequent.type === "BlockStatement" && node.alternate) { // Handle the keyword after the `if` block (before `else`) validateCurlyBeforeKeyword(sourceCode.getLastToken(node.consequent)); } }, TryStatement: function TryStatement(node) { // Handle the keyword after the `try` block (before `catch` or `finally`) validateCurlyBeforeKeyword(sourceCode.getLastToken(node.block)); if (node.handler && node.finalizer) { // Handle the keyword after the `catch` block (before `finally`) validateCurlyBeforeKeyword(sourceCode.getLastToken(node.handler.body)); } } }; } }; },{"../ast-utils":67}],93:[function(require,module,exports){ /** * @fileoverview Enforce return after a callback. * @author Jamund Ferguson */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require `return` statements after callbacks", category: "Node.js and CommonJS", recommended: false }, schema: [{ type: "array", items: { type: "string" } }] }, create: function create(context) { var callbacks = context.options[0] || ["callback", "cb", "next"], sourceCode = context.getSourceCode(); //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Find the closest parent matching a list of types. * @param {ASTNode} node The node whose parents we are searching * @param {Array} types The node types to match * @returns {ASTNode} The matched node or undefined. */ function findClosestParentOfType(node, types) { if (!node.parent) { return null; } if (types.indexOf(node.parent.type) === -1) { return findClosestParentOfType(node.parent, types); } return node.parent; } /** * Check to see if a node contains only identifers * @param {ASTNode} node The node to check * @returns {boolean} Whether or not the node contains only identifers */ function containsOnlyIdentifiers(node) { if (node.type === "Identifier") { return true; } if (node.type === "MemberExpression") { if (node.object.type === "Identifier") { return true; } else if (node.object.type === "MemberExpression") { return containsOnlyIdentifiers(node.object); } } return false; } /** * Check to see if a CallExpression is in our callback list. * @param {ASTNode} node The node to check against our callback names list. * @returns {boolean} Whether or not this function matches our callback name. */ function isCallback(node) { return containsOnlyIdentifiers(node.callee) && callbacks.indexOf(sourceCode.getText(node.callee)) > -1; } /** * Determines whether or not the callback is part of a callback expression. * @param {ASTNode} node The callback node * @param {ASTNode} parentNode The expression node * @returns {boolean} Whether or not this is part of a callback expression */ function isCallbackExpression(node, parentNode) { // ensure the parent node exists and is an expression if (!parentNode || parentNode.type !== "ExpressionStatement") { return false; } // cb() if (parentNode.expression === node) { return true; } // special case for cb && cb() and similar if (parentNode.expression.type === "BinaryExpression" || parentNode.expression.type === "LogicalExpression") { if (parentNode.expression.right === node) { return true; } } return false; } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { CallExpression: function CallExpression(node) { // if we're not a callback we can return if (!isCallback(node)) { return; } // find the closest block, return or loop var closestBlock = findClosestParentOfType(node, ["BlockStatement", "ReturnStatement", "ArrowFunctionExpression"]) || {}; // if our parent is a return we know we're ok if (closestBlock.type === "ReturnStatement") { return; } // arrow functions don't always have blocks and implicitly return if (closestBlock.type === "ArrowFunctionExpression") { return; } // block statements are part of functions and most if statements if (closestBlock.type === "BlockStatement") { // find the last item in the block var lastItem = closestBlock.body[closestBlock.body.length - 1]; // if the callback is the last thing in a block that might be ok if (isCallbackExpression(node, lastItem)) { var parentType = closestBlock.parent.type; // but only if the block is part of a function if (parentType === "FunctionExpression" || parentType === "FunctionDeclaration" || parentType === "ArrowFunctionExpression") { return; } } // ending a block with a return is also ok if (lastItem.type === "ReturnStatement") { // but only if the callback is immediately before if (isCallbackExpression(node, closestBlock.body[closestBlock.body.length - 2])) { return; } } } // as long as you're the child of a function at this point you should be asked to return if (findClosestParentOfType(node, ["FunctionDeclaration", "FunctionExpression", "ArrowFunctionExpression"])) { context.report({ node: node, message: "Expected return with your callback function." }); } } }; } }; },{}],94:[function(require,module,exports){ /** * @fileoverview Rule to flag non-camelcased identifiers * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce camelcase naming convention", category: "Stylistic Issues", recommended: false }, schema: [{ type: "object", properties: { properties: { enum: ["always", "never"] } }, additionalProperties: false }] }, create: function create(context) { //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- // contains reported nodes to avoid reporting twice on destructuring with shorthand notation var reported = []; var ALLOWED_PARENT_TYPES = new Set(["CallExpression", "NewExpression"]); /** * Checks if a string contains an underscore and isn't all upper-case * @param {string} name The string to check. * @returns {boolean} if the string is underscored * @private */ function isUnderscored(name) { // if there's an underscore, it might be A_CONSTANT, which is okay return name.indexOf("_") > -1 && name !== name.toUpperCase(); } /** * Reports an AST node as a rule violation. * @param {ASTNode} node The node to report. * @returns {void} * @private */ function report(node) { if (reported.indexOf(node) < 0) { reported.push(node); context.report({ node: node, message: "Identifier '{{name}}' is not in camel case.", data: { name: node.name } }); } } var options = context.options[0] || {}; var properties = options.properties || ""; if (properties !== "always" && properties !== "never") { properties = "always"; } return { Identifier: function Identifier(node) { /* * Leading and trailing underscores are commonly used to flag * private/protected identifiers, strip them */ var name = node.name.replace(/^_+|_+$/g, ""), effectiveParent = node.parent.type === "MemberExpression" ? node.parent.parent : node.parent; // MemberExpressions get special rules if (node.parent.type === "MemberExpression") { // "never" check properties if (properties === "never") { return; } // Always report underscored object names if (node.parent.object.type === "Identifier" && node.parent.object.name === node.name && isUnderscored(name)) { report(node); // Report AssignmentExpressions only if they are the left side of the assignment } else if (effectiveParent.type === "AssignmentExpression" && isUnderscored(name) && (effectiveParent.right.type !== "MemberExpression" || effectiveParent.left.type === "MemberExpression" && effectiveParent.left.property.name === node.name)) { report(node); } // Properties have their own rules } else if (node.parent.type === "Property") { // "never" check properties if (properties === "never") { return; } if (node.parent.parent && node.parent.parent.type === "ObjectPattern" && node.parent.key === node && node.parent.value !== node) { return; } if (isUnderscored(name) && !ALLOWED_PARENT_TYPES.has(effectiveParent.type)) { report(node); } // Check if it's an import specifier } else if (["ImportSpecifier", "ImportNamespaceSpecifier", "ImportDefaultSpecifier"].indexOf(node.parent.type) >= 0) { // Report only if the local imported identifier is underscored if (node.parent.local && node.parent.local.name === node.name && isUnderscored(name)) { report(node); } // Report anything that is underscored that isn't a CallExpression } else if (isUnderscored(name) && !ALLOWED_PARENT_TYPES.has(effectiveParent.type)) { report(node); } } }; } }; },{}],95:[function(require,module,exports){ /** * @fileoverview enforce or disallow capitalization of the first letter of a comment * @author Kevin Partington */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var LETTER_PATTERN = require("../util/patterns/letters"); var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var ALWAYS_MESSAGE = "Comments should not begin with a lowercase character", NEVER_MESSAGE = "Comments should not begin with an uppercase character", DEFAULT_IGNORE_PATTERN = astUtils.COMMENTS_IGNORE_PATTERN, WHITESPACE = /\s/g, MAYBE_URL = /^\s*[^:/?#\s]+:\/\/[^?#]/, // TODO: Combine w/ max-len pattern? DEFAULTS = { ignorePattern: null, ignoreInlineComments: false, ignoreConsecutiveComments: false }; /* * Base schema body for defining the basic capitalization rule, ignorePattern, * and ignoreInlineComments values. * This can be used in a few different ways in the actual schema. */ var SCHEMA_BODY = { type: "object", properties: { ignorePattern: { type: "string" }, ignoreInlineComments: { type: "boolean" }, ignoreConsecutiveComments: { type: "boolean" } }, additionalProperties: false }; /** * Get normalized options for either block or line comments from the given * user-provided options. * - If the user-provided options is just a string, returns a normalized * set of options using default values for all other options. * - If the user-provided options is an object, then a normalized option * set is returned. Options specified in overrides will take priority * over options specified in the main options object, which will in * turn take priority over the rule's defaults. * * @param {Object|string} rawOptions The user-provided options. * @param {string} which Either "line" or "block". * @returns {Object} The normalized options. */ function getNormalizedOptions(rawOptions, which) { if (!rawOptions) { return Object.assign({}, DEFAULTS); } return Object.assign({}, DEFAULTS, rawOptions[which] || rawOptions); } /** * Get normalized options for block and line comments. * * @param {Object|string} rawOptions The user-provided options. * @returns {Object} An object with "Line" and "Block" keys and corresponding * normalized options objects. */ function getAllNormalizedOptions(rawOptions) { return { Line: getNormalizedOptions(rawOptions, "line"), Block: getNormalizedOptions(rawOptions, "block") }; } /** * Creates a regular expression for each ignorePattern defined in the rule * options. * * This is done in order to avoid invoking the RegExp constructor repeatedly. * * @param {Object} normalizedOptions The normalized rule options. * @returns {void} */ function createRegExpForIgnorePatterns(normalizedOptions) { Object.keys(normalizedOptions).forEach(function (key) { var ignorePatternStr = normalizedOptions[key].ignorePattern; if (ignorePatternStr) { var regExp = RegExp("^\\s*(?:" + ignorePatternStr + ")"); normalizedOptions[key].ignorePatternRegExp = regExp; } }); } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce or disallow capitalization of the first letter of a comment", category: "Stylistic Issues", recommended: false }, fixable: "code", schema: [{ enum: ["always", "never"] }, { oneOf: [SCHEMA_BODY, { type: "object", properties: { line: SCHEMA_BODY, block: SCHEMA_BODY }, additionalProperties: false }] }] }, create: function create(context) { var capitalize = context.options[0] || "always", normalizedOptions = getAllNormalizedOptions(context.options[1]), sourceCode = context.getSourceCode(); createRegExpForIgnorePatterns(normalizedOptions); //---------------------------------------------------------------------- // Helpers //---------------------------------------------------------------------- /** * Checks whether a comment is an inline comment. * * For the purpose of this rule, a comment is inline if: * 1. The comment is preceded by a token on the same line; and * 2. The command is followed by a token on the same line. * * Note that the comment itself need not be single-line! * * Also, it follows from this definition that only block comments can * be considered as possibly inline. This is because line comments * would consume any following tokens on the same line as the comment. * * @param {ASTNode} comment The comment node to check. * @returns {boolean} True if the comment is an inline comment, false * otherwise. */ function isInlineComment(comment) { var previousToken = sourceCode.getTokenBefore(comment, { includeComments: true }), nextToken = sourceCode.getTokenAfter(comment, { includeComments: true }); return Boolean(previousToken && nextToken && comment.loc.start.line === previousToken.loc.end.line && comment.loc.end.line === nextToken.loc.start.line); } /** * Determine if a comment follows another comment. * * @param {ASTNode} comment The comment to check. * @returns {boolean} True if the comment follows a valid comment. */ function isConsecutiveComment(comment) { var previousTokenOrComment = sourceCode.getTokenBefore(comment, { includeComments: true }); return Boolean(previousTokenOrComment && ["Block", "Line"].indexOf(previousTokenOrComment.type) !== -1); } /** * Check a comment to determine if it is valid for this rule. * * @param {ASTNode} comment The comment node to process. * @param {Object} options The options for checking this comment. * @returns {boolean} True if the comment is valid, false otherwise. */ function isCommentValid(comment, options) { // 1. Check for default ignore pattern. if (DEFAULT_IGNORE_PATTERN.test(comment.value)) { return true; } // 2. Check for custom ignore pattern. var commentWithoutAsterisks = comment.value.replace(/\*/g, ""); if (options.ignorePatternRegExp && options.ignorePatternRegExp.test(commentWithoutAsterisks)) { return true; } // 3. Check for inline comments. if (options.ignoreInlineComments && isInlineComment(comment)) { return true; } // 4. Is this a consecutive comment (and are we tolerating those)? if (options.ignoreConsecutiveComments && isConsecutiveComment(comment)) { return true; } // 5. Does the comment start with a possible URL? if (MAYBE_URL.test(commentWithoutAsterisks)) { return true; } // 6. Is the initial word character a letter? var commentWordCharsOnly = commentWithoutAsterisks.replace(WHITESPACE, ""); if (commentWordCharsOnly.length === 0) { return true; } var firstWordChar = commentWordCharsOnly[0]; if (!LETTER_PATTERN.test(firstWordChar)) { return true; } // 7. Check the case of the initial word character. var isUppercase = firstWordChar !== firstWordChar.toLocaleLowerCase(), isLowercase = firstWordChar !== firstWordChar.toLocaleUpperCase(); if (capitalize === "always" && isLowercase) { return false; } else if (capitalize === "never" && isUppercase) { return false; } return true; } /** * Process a comment to determine if it needs to be reported. * * @param {ASTNode} comment The comment node to process. * @returns {void} */ function processComment(comment) { var options = normalizedOptions[comment.type], commentValid = isCommentValid(comment, options); if (!commentValid) { var message = capitalize === "always" ? ALWAYS_MESSAGE : NEVER_MESSAGE; context.report({ node: null, // Intentionally using loc instead loc: comment.loc, message: message, fix: function fix(fixer) { var match = comment.value.match(LETTER_PATTERN); return fixer.replaceTextRange( // Offset match.index by 2 to account for the first 2 characters that start the comment (// or /*) [comment.range[0] + match.index + 2, comment.range[0] + match.index + 3], capitalize === "always" ? match[0].toLocaleUpperCase() : match[0].toLocaleLowerCase()); } }); } } //---------------------------------------------------------------------- // Public //---------------------------------------------------------------------- return { Program: function Program() { var comments = sourceCode.getAllComments(); comments.filter(function (token) { return token.type !== "Shebang"; }).forEach(processComment); } }; } }; },{"../ast-utils":67,"../util/patterns/letters":351}],96:[function(require,module,exports){ /** * @fileoverview Rule to enforce that all class methods use 'this'. * @author Patrick Williams */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce that class methods utilize `this`", category: "Best Practices", recommended: false }, schema: [{ type: "object", properties: { exceptMethods: { type: "array", items: { type: "string" } } }, additionalProperties: false }] }, create: function create(context) { var config = context.options[0] ? Object.assign({}, context.options[0]) : {}; var exceptMethods = new Set(config.exceptMethods || []); var stack = []; /** * Initializes the current context to false and pushes it onto the stack. * These booleans represent whether 'this' has been used in the context. * @returns {void} * @private */ function enterFunction() { stack.push(false); } /** * Check if the node is an instance method * @param {ASTNode} node - node to check * @returns {boolean} True if its an instance method * @private */ function isInstanceMethod(node) { return !node.static && node.kind !== "constructor" && node.type === "MethodDefinition"; } /** * Check if the node is an instance method not excluded by config * @param {ASTNode} node - node to check * @returns {boolean} True if it is an instance method, and not excluded by config * @private */ function isIncludedInstanceMethod(node) { return isInstanceMethod(node) && !exceptMethods.has(node.key.name); } /** * Checks if we are leaving a function that is a method, and reports if 'this' has not been used. * Static methods and the constructor are exempt. * Then pops the context off the stack. * @param {ASTNode} node - A function node that was entered. * @returns {void} * @private */ function exitFunction(node) { var methodUsesThis = stack.pop(); if (isIncludedInstanceMethod(node.parent) && !methodUsesThis) { context.report({ node: node, message: "Expected 'this' to be used by class method '{{classMethod}}'.", data: { classMethod: node.parent.key.name } }); } } /** * Mark the current context as having used 'this'. * @returns {void} * @private */ function markThisUsed() { if (stack.length) { stack[stack.length - 1] = true; } } return { FunctionDeclaration: enterFunction, "FunctionDeclaration:exit": exitFunction, FunctionExpression: enterFunction, "FunctionExpression:exit": exitFunction, ThisExpression: markThisUsed, Super: markThisUsed }; } }; },{}],97:[function(require,module,exports){ /** * @fileoverview Rule to forbid or enforce dangling commas. * @author Ian Christian Myers */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; var lodash = require("lodash"); var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var DEFAULT_OPTIONS = Object.freeze({ arrays: "never", objects: "never", imports: "never", exports: "never", functions: "ignore" }); /** * Checks whether or not a trailing comma is allowed in a given node. * If the `lastItem` is `RestElement` or `RestProperty`, it disallows trailing commas. * * @param {ASTNode} lastItem - The node of the last element in the given node. * @returns {boolean} `true` if a trailing comma is allowed. */ function isTrailingCommaAllowed(lastItem) { return !(lastItem.type === "RestElement" || lastItem.type === "RestProperty" || lastItem.type === "ExperimentalRestProperty"); } /** * Normalize option value. * * @param {string|Object|undefined} optionValue - The 1st option value to normalize. * @returns {Object} The normalized option value. */ function normalizeOptions(optionValue) { if (typeof optionValue === "string") { return { arrays: optionValue, objects: optionValue, imports: optionValue, exports: optionValue, // For backward compatibility, always ignore functions. functions: "ignore" }; } if ((typeof optionValue === "undefined" ? "undefined" : _typeof(optionValue)) === "object" && optionValue !== null) { return { arrays: optionValue.arrays || DEFAULT_OPTIONS.arrays, objects: optionValue.objects || DEFAULT_OPTIONS.objects, imports: optionValue.imports || DEFAULT_OPTIONS.imports, exports: optionValue.exports || DEFAULT_OPTIONS.exports, functions: optionValue.functions || DEFAULT_OPTIONS.functions }; } return DEFAULT_OPTIONS; } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require or disallow trailing commas", category: "Stylistic Issues", recommended: false }, fixable: "code", schema: [{ defs: { value: { enum: ["always", "always-multiline", "only-multiline", "never"] }, valueWithIgnore: { anyOf: [{ $ref: "#/defs/value" }, { enum: ["ignore"] }] } }, anyOf: [{ $ref: "#/defs/value" }, { type: "object", properties: { arrays: { $refs: "#/defs/valueWithIgnore" }, objects: { $refs: "#/defs/valueWithIgnore" }, imports: { $refs: "#/defs/valueWithIgnore" }, exports: { $refs: "#/defs/valueWithIgnore" }, functions: { $refs: "#/defs/valueWithIgnore" } }, additionalProperties: false }] }] }, create: function create(context) { var options = normalizeOptions(context.options[0]); var sourceCode = context.getSourceCode(); var UNEXPECTED_MESSAGE = "Unexpected trailing comma."; var MISSING_MESSAGE = "Missing trailing comma."; /** * Gets the last item of the given node. * @param {ASTNode} node - The node to get. * @returns {ASTNode|null} The last node or null. */ function getLastItem(node) { switch (node.type) { case "ObjectExpression": case "ObjectPattern": return lodash.last(node.properties); case "ArrayExpression": case "ArrayPattern": return lodash.last(node.elements); case "ImportDeclaration": case "ExportNamedDeclaration": return lodash.last(node.specifiers); case "FunctionDeclaration": case "FunctionExpression": case "ArrowFunctionExpression": return lodash.last(node.params); case "CallExpression": case "NewExpression": return lodash.last(node.arguments); default: return null; } } /** * Gets the trailing comma token of the given node. * If the trailing comma does not exist, this returns the token which is * the insertion point of the trailing comma token. * * @param {ASTNode} node - The node to get. * @param {ASTNode} lastItem - The last item of the node. * @returns {Token} The trailing comma token or the insertion point. */ function getTrailingToken(node, lastItem) { switch (node.type) { case "ObjectExpression": case "ArrayExpression": case "CallExpression": case "NewExpression": return sourceCode.getLastToken(node, 1); default: { var nextToken = sourceCode.getTokenAfter(lastItem); if (astUtils.isCommaToken(nextToken)) { return nextToken; } return sourceCode.getLastToken(lastItem); } } } /** * Checks whether or not a given node is multiline. * This rule handles a given node as multiline when the closing parenthesis * and the last element are not on the same line. * * @param {ASTNode} node - A node to check. * @returns {boolean} `true` if the node is multiline. */ function isMultiline(node) { var lastItem = getLastItem(node); if (!lastItem) { return false; } var penultimateToken = getTrailingToken(node, lastItem); var lastToken = sourceCode.getTokenAfter(penultimateToken); return lastToken.loc.end.line !== penultimateToken.loc.end.line; } /** * Reports a trailing comma if it exists. * * @param {ASTNode} node - A node to check. Its type is one of * ObjectExpression, ObjectPattern, ArrayExpression, ArrayPattern, * ImportDeclaration, and ExportNamedDeclaration. * @returns {void} */ function forbidTrailingComma(node) { var lastItem = getLastItem(node); if (!lastItem || node.type === "ImportDeclaration" && lastItem.type !== "ImportSpecifier") { return; } var trailingToken = getTrailingToken(node, lastItem); if (astUtils.isCommaToken(trailingToken)) { context.report({ node: lastItem, loc: trailingToken.loc.start, message: UNEXPECTED_MESSAGE, fix: function fix(fixer) { return fixer.remove(trailingToken); } }); } } /** * Reports the last element of a given node if it does not have a trailing * comma. * * If a given node is `ArrayPattern` which has `RestElement`, the trailing * comma is disallowed, so report if it exists. * * @param {ASTNode} node - A node to check. Its type is one of * ObjectExpression, ObjectPattern, ArrayExpression, ArrayPattern, * ImportDeclaration, and ExportNamedDeclaration. * @returns {void} */ function forceTrailingComma(node) { var lastItem = getLastItem(node); if (!lastItem || node.type === "ImportDeclaration" && lastItem.type !== "ImportSpecifier") { return; } if (!isTrailingCommaAllowed(lastItem)) { forbidTrailingComma(node); return; } var trailingToken = getTrailingToken(node, lastItem); if (trailingToken.value !== ",") { context.report({ node: lastItem, loc: trailingToken.loc.end, message: MISSING_MESSAGE, fix: function fix(fixer) { return fixer.insertTextAfter(trailingToken, ","); } }); } } /** * If a given node is multiline, reports the last element of a given node * when it does not have a trailing comma. * Otherwise, reports a trailing comma if it exists. * * @param {ASTNode} node - A node to check. Its type is one of * ObjectExpression, ObjectPattern, ArrayExpression, ArrayPattern, * ImportDeclaration, and ExportNamedDeclaration. * @returns {void} */ function forceTrailingCommaIfMultiline(node) { if (isMultiline(node)) { forceTrailingComma(node); } else { forbidTrailingComma(node); } } /** * Only if a given node is not multiline, reports the last element of a given node * when it does not have a trailing comma. * Otherwise, reports a trailing comma if it exists. * * @param {ASTNode} node - A node to check. Its type is one of * ObjectExpression, ObjectPattern, ArrayExpression, ArrayPattern, * ImportDeclaration, and ExportNamedDeclaration. * @returns {void} */ function allowTrailingCommaIfMultiline(node) { if (!isMultiline(node)) { forbidTrailingComma(node); } } var predicate = { always: forceTrailingComma, "always-multiline": forceTrailingCommaIfMultiline, "only-multiline": allowTrailingCommaIfMultiline, never: forbidTrailingComma, ignore: lodash.noop }; return { ObjectExpression: predicate[options.objects], ObjectPattern: predicate[options.objects], ArrayExpression: predicate[options.arrays], ArrayPattern: predicate[options.arrays], ImportDeclaration: predicate[options.imports], ExportNamedDeclaration: predicate[options.exports], FunctionDeclaration: predicate[options.functions], FunctionExpression: predicate[options.functions], ArrowFunctionExpression: predicate[options.functions], CallExpression: predicate[options.functions], NewExpression: predicate[options.functions] }; } }; },{"../ast-utils":67,"lodash":48}],98:[function(require,module,exports){ /** * @fileoverview Comma spacing - validates spacing before and after comma * @author Vignesh Anand aka vegetableman. */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce consistent spacing before and after commas", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ type: "object", properties: { before: { type: "boolean" }, after: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var sourceCode = context.getSourceCode(); var tokensAndComments = sourceCode.tokensAndComments; var options = { before: context.options[0] ? !!context.options[0].before : false, after: context.options[0] ? !!context.options[0].after : true }; //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- // list of comma tokens to ignore for the check of leading whitespace var commaTokensToIgnore = []; /** * Reports a spacing error with an appropriate message. * @param {ASTNode} node The binary expression node to report. * @param {string} dir Is the error "before" or "after" the comma? * @param {ASTNode} otherNode The node at the left or right of `node` * @returns {void} * @private */ function report(node, dir, otherNode) { context.report({ node: node, fix: function fix(fixer) { if (options[dir]) { if (dir === "before") { return fixer.insertTextBefore(node, " "); } return fixer.insertTextAfter(node, " "); } var start = void 0, end = void 0; var newText = ""; if (dir === "before") { start = otherNode.range[1]; end = node.range[0]; } else { start = node.range[1]; end = otherNode.range[0]; } return fixer.replaceTextRange([start, end], newText); }, message: options[dir] ? "A space is required {{dir}} ','." : "There should be no space {{dir}} ','.", data: { dir: dir } }); } /** * Validates the spacing around a comma token. * @param {Object} tokens - The tokens to be validated. * @param {Token} tokens.comma The token representing the comma. * @param {Token} [tokens.left] The last token before the comma. * @param {Token} [tokens.right] The first token after the comma. * @param {Token|ASTNode} reportItem The item to use when reporting an error. * @returns {void} * @private */ function validateCommaItemSpacing(tokens, reportItem) { if (tokens.left && astUtils.isTokenOnSameLine(tokens.left, tokens.comma) && options.before !== sourceCode.isSpaceBetweenTokens(tokens.left, tokens.comma)) { report(reportItem, "before", tokens.left); } if (tokens.right && !options.after && tokens.right.type === "Line") { return; } if (tokens.right && astUtils.isTokenOnSameLine(tokens.comma, tokens.right) && options.after !== sourceCode.isSpaceBetweenTokens(tokens.comma, tokens.right)) { report(reportItem, "after", tokens.right); } } /** * Adds null elements of the given ArrayExpression or ArrayPattern node to the ignore list. * @param {ASTNode} node An ArrayExpression or ArrayPattern node. * @returns {void} */ function addNullElementsToIgnoreList(node) { var previousToken = sourceCode.getFirstToken(node); node.elements.forEach(function (element) { var token = void 0; if (element === null) { token = sourceCode.getTokenAfter(previousToken); if (astUtils.isCommaToken(token)) { commaTokensToIgnore.push(token); } } else { token = sourceCode.getTokenAfter(element); } previousToken = token; }); } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { "Program:exit": function ProgramExit() { tokensAndComments.forEach(function (token, i) { if (!astUtils.isCommaToken(token)) { return; } if (token && token.type === "JSXText") { return; } var previousToken = tokensAndComments[i - 1]; var nextToken = tokensAndComments[i + 1]; validateCommaItemSpacing({ comma: token, left: astUtils.isCommaToken(previousToken) || commaTokensToIgnore.indexOf(token) > -1 ? null : previousToken, right: astUtils.isCommaToken(nextToken) ? null : nextToken }, token); }); }, ArrayExpression: addNullElementsToIgnoreList, ArrayPattern: addNullElementsToIgnoreList }; } }; },{"../ast-utils":67}],99:[function(require,module,exports){ /** * @fileoverview Comma style - enforces comma styles of two types: last and first * @author Vignesh Anand aka vegetableman */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce consistent comma style", category: "Stylistic Issues", recommended: false }, fixable: "code", schema: [{ enum: ["first", "last"] }, { type: "object", properties: { exceptions: { type: "object", additionalProperties: { type: "boolean" } } }, additionalProperties: false }] }, create: function create(context) { var style = context.options[0] || "last", sourceCode = context.getSourceCode(); var exceptions = { ArrayPattern: true, ArrowFunctionExpression: true, CallExpression: true, FunctionDeclaration: true, FunctionExpression: true, ImportDeclaration: true, ObjectPattern: true }; if (context.options.length === 2 && context.options[1].hasOwnProperty("exceptions")) { var keys = Object.keys(context.options[1].exceptions); for (var i = 0; i < keys.length; i++) { exceptions[keys[i]] = context.options[1].exceptions[keys[i]]; } } //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Modified text based on the style * @param {string} styleType Style type * @param {string} text Source code text * @returns {string} modified text * @private */ function getReplacedText(styleType, text) { switch (styleType) { case "between": return "," + text.replace("\n", ""); case "first": return text + ","; case "last": return "," + text; default: return ""; } } /** * Determines the fixer function for a given style. * @param {string} styleType comma style * @param {ASTNode} previousItemToken The token to check. * @param {ASTNode} commaToken The token to check. * @param {ASTNode} currentItemToken The token to check. * @returns {Function} Fixer function * @private */ function getFixerFunction(styleType, previousItemToken, commaToken, currentItemToken) { var text = sourceCode.text.slice(previousItemToken.range[1], commaToken.range[0]) + sourceCode.text.slice(commaToken.range[1], currentItemToken.range[0]); var range = [previousItemToken.range[1], currentItemToken.range[0]]; return function (fixer) { return fixer.replaceTextRange(range, getReplacedText(styleType, text)); }; } /** * Validates the spacing around single items in lists. * @param {Token} previousItemToken The last token from the previous item. * @param {Token} commaToken The token representing the comma. * @param {Token} currentItemToken The first token of the current item. * @param {Token} reportItem The item to use when reporting an error. * @returns {void} * @private */ function validateCommaItemSpacing(previousItemToken, commaToken, currentItemToken, reportItem) { // if single line if (astUtils.isTokenOnSameLine(commaToken, currentItemToken) && astUtils.isTokenOnSameLine(previousItemToken, commaToken)) { // do nothing. } else if (!astUtils.isTokenOnSameLine(commaToken, currentItemToken) && !astUtils.isTokenOnSameLine(previousItemToken, commaToken)) { // lone comma context.report({ node: reportItem, loc: { line: commaToken.loc.end.line, column: commaToken.loc.start.column }, message: "Bad line breaking before and after ','.", fix: getFixerFunction("between", previousItemToken, commaToken, currentItemToken) }); } else if (style === "first" && !astUtils.isTokenOnSameLine(commaToken, currentItemToken)) { context.report({ node: reportItem, message: "',' should be placed first.", fix: getFixerFunction(style, previousItemToken, commaToken, currentItemToken) }); } else if (style === "last" && astUtils.isTokenOnSameLine(commaToken, currentItemToken)) { context.report({ node: reportItem, loc: { line: commaToken.loc.end.line, column: commaToken.loc.end.column }, message: "',' should be placed last.", fix: getFixerFunction(style, previousItemToken, commaToken, currentItemToken) }); } } /** * Checks the comma placement with regards to a declaration/property/element * @param {ASTNode} node The binary expression node to check * @param {string} property The property of the node containing child nodes. * @private * @returns {void} */ function validateComma(node, property) { var items = node[property], arrayLiteral = node.type === "ArrayExpression" || node.type === "ArrayPattern"; if (items.length > 1 || arrayLiteral) { // seed as opening [ var previousItemToken = sourceCode.getFirstToken(node); items.forEach(function (item) { var commaToken = item ? sourceCode.getTokenBefore(item) : previousItemToken, currentItemToken = item ? sourceCode.getFirstToken(item) : sourceCode.getTokenAfter(commaToken), reportItem = item || currentItemToken, tokenBeforeComma = sourceCode.getTokenBefore(commaToken); // Check if previous token is wrapped in parentheses if (tokenBeforeComma && astUtils.isClosingParenToken(tokenBeforeComma)) { previousItemToken = tokenBeforeComma; } /* * This works by comparing three token locations: * - previousItemToken is the last token of the previous item * - commaToken is the location of the comma before the current item * - currentItemToken is the first token of the current item * * These values get switched around if item is undefined. * previousItemToken will refer to the last token not belonging * to the current item, which could be a comma or an opening * square bracket. currentItemToken could be a comma. * * All comparisons are done based on these tokens directly, so * they are always valid regardless of an undefined item. */ if (astUtils.isCommaToken(commaToken)) { validateCommaItemSpacing(previousItemToken, commaToken, currentItemToken, reportItem); } if (item) { var tokenAfterItem = sourceCode.getTokenAfter(item, astUtils.isNotClosingParenToken); previousItemToken = tokenAfterItem ? sourceCode.getTokenBefore(tokenAfterItem) : sourceCode.ast.tokens[sourceCode.ast.tokens.length - 1]; } }); /* * Special case for array literals that have empty last items, such * as [ 1, 2, ]. These arrays only have two items show up in the * AST, so we need to look at the token to verify that there's no * dangling comma. */ if (arrayLiteral) { var lastToken = sourceCode.getLastToken(node), nextToLastToken = sourceCode.getTokenBefore(lastToken); if (astUtils.isCommaToken(nextToLastToken)) { validateCommaItemSpacing(sourceCode.getTokenBefore(nextToLastToken), nextToLastToken, lastToken, lastToken); } } } } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- var nodes = {}; if (!exceptions.VariableDeclaration) { nodes.VariableDeclaration = function (node) { validateComma(node, "declarations"); }; } if (!exceptions.ObjectExpression) { nodes.ObjectExpression = function (node) { validateComma(node, "properties"); }; } if (!exceptions.ObjectPattern) { nodes.ObjectPattern = function (node) { validateComma(node, "properties"); }; } if (!exceptions.ArrayExpression) { nodes.ArrayExpression = function (node) { validateComma(node, "elements"); }; } if (!exceptions.ArrayPattern) { nodes.ArrayPattern = function (node) { validateComma(node, "elements"); }; } if (!exceptions.FunctionDeclaration) { nodes.FunctionDeclaration = function (node) { validateComma(node, "params"); }; } if (!exceptions.FunctionExpression) { nodes.FunctionExpression = function (node) { validateComma(node, "params"); }; } if (!exceptions.ArrowFunctionExpression) { nodes.ArrowFunctionExpression = function (node) { validateComma(node, "params"); }; } if (!exceptions.CallExpression) { nodes.CallExpression = function (node) { validateComma(node, "arguments"); }; } if (!exceptions.ImportDeclaration) { nodes.ImportDeclaration = function (node) { validateComma(node, "specifiers"); }; } return nodes; } }; },{"../ast-utils":67}],100:[function(require,module,exports){ /** * @fileoverview Counts the cyclomatic complexity of each function of the script. See http://en.wikipedia.org/wiki/Cyclomatic_complexity. * Counts the number of if, conditional, for, whilte, try, switch/case, * @author Patrick Brosset */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; var lodash = require("lodash"); var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce a maximum cyclomatic complexity allowed in a program", category: "Best Practices", recommended: false }, schema: [{ oneOf: [{ type: "integer", minimum: 0 }, { type: "object", properties: { maximum: { type: "integer", minimum: 0 }, max: { type: "integer", minimum: 0 } }, additionalProperties: false }] }] }, create: function create(context) { var option = context.options[0]; var THRESHOLD = 20; if ((typeof option === "undefined" ? "undefined" : _typeof(option)) === "object" && option.hasOwnProperty("maximum") && typeof option.maximum === "number") { THRESHOLD = option.maximum; } if ((typeof option === "undefined" ? "undefined" : _typeof(option)) === "object" && option.hasOwnProperty("max") && typeof option.max === "number") { THRESHOLD = option.max; } if (typeof option === "number") { THRESHOLD = option; } //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- // Using a stack to store complexity (handling nested functions) var fns = []; /** * When parsing a new function, store it in our function stack * @returns {void} * @private */ function startFunction() { fns.push(1); } /** * Evaluate the node at the end of function * @param {ASTNode} node node to evaluate * @returns {void} * @private */ function endFunction(node) { var name = lodash.upperFirst(astUtils.getFunctionNameWithKind(node)); var complexity = fns.pop(); if (complexity > THRESHOLD) { context.report({ node: node, message: "{{name}} has a complexity of {{complexity}}.", data: { name: name, complexity: complexity } }); } } /** * Increase the complexity of the function in context * @returns {void} * @private */ function increaseComplexity() { if (fns.length) { fns[fns.length - 1]++; } } /** * Increase the switch complexity in context * @param {ASTNode} node node to evaluate * @returns {void} * @private */ function increaseSwitchComplexity(node) { // Avoiding `default` if (node.test) { increaseComplexity(); } } /** * Increase the logical path complexity in context * @param {ASTNode} node node to evaluate * @returns {void} * @private */ function increaseLogicalComplexity(node) { // Avoiding && if (node.operator === "||") { increaseComplexity(); } } //-------------------------------------------------------------------------- // Public API //-------------------------------------------------------------------------- return { FunctionDeclaration: startFunction, FunctionExpression: startFunction, ArrowFunctionExpression: startFunction, "FunctionDeclaration:exit": endFunction, "FunctionExpression:exit": endFunction, "ArrowFunctionExpression:exit": endFunction, CatchClause: increaseComplexity, ConditionalExpression: increaseComplexity, LogicalExpression: increaseLogicalComplexity, ForStatement: increaseComplexity, ForInStatement: increaseComplexity, ForOfStatement: increaseComplexity, IfStatement: increaseComplexity, SwitchCase: increaseSwitchComplexity, WhileStatement: increaseComplexity, DoWhileStatement: increaseComplexity }; } }; },{"../ast-utils":67,"lodash":48}],101:[function(require,module,exports){ /** * @fileoverview Disallows or enforces spaces inside computed properties. * @author Jamund Ferguson */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce consistent spacing inside computed property brackets", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ enum: ["always", "never"] }] }, create: function create(context) { var sourceCode = context.getSourceCode(); var propertyNameMustBeSpaced = context.options[0] === "always"; // default is "never" //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Reports that there shouldn't be a space after the first token * @param {ASTNode} node - The node to report in the event of an error. * @param {Token} token - The token to use for the report. * @param {Token} tokenAfter - The token after `token`. * @returns {void} */ function reportNoBeginningSpace(node, token, tokenAfter) { context.report({ node: node, loc: token.loc.start, message: "There should be no space after '{{tokenValue}}'.", data: { tokenValue: token.value }, fix: function fix(fixer) { return fixer.removeRange([token.range[1], tokenAfter.range[0]]); } }); } /** * Reports that there shouldn't be a space before the last token * @param {ASTNode} node - The node to report in the event of an error. * @param {Token} token - The token to use for the report. * @param {Token} tokenBefore - The token before `token`. * @returns {void} */ function reportNoEndingSpace(node, token, tokenBefore) { context.report({ node: node, loc: token.loc.start, message: "There should be no space before '{{tokenValue}}'.", data: { tokenValue: token.value }, fix: function fix(fixer) { return fixer.removeRange([tokenBefore.range[1], token.range[0]]); } }); } /** * Reports that there should be a space after the first token * @param {ASTNode} node - The node to report in the event of an error. * @param {Token} token - The token to use for the report. * @returns {void} */ function reportRequiredBeginningSpace(node, token) { context.report({ node: node, loc: token.loc.start, message: "A space is required after '{{tokenValue}}'.", data: { tokenValue: token.value }, fix: function fix(fixer) { return fixer.insertTextAfter(token, " "); } }); } /** * Reports that there should be a space before the last token * @param {ASTNode} node - The node to report in the event of an error. * @param {Token} token - The token to use for the report. * @returns {void} */ function reportRequiredEndingSpace(node, token) { context.report({ node: node, loc: token.loc.start, message: "A space is required before '{{tokenValue}}'.", data: { tokenValue: token.value }, fix: function fix(fixer) { return fixer.insertTextBefore(token, " "); } }); } /** * Returns a function that checks the spacing of a node on the property name * that was passed in. * @param {string} propertyName The property on the node to check for spacing * @returns {Function} A function that will check spacing on a node */ function checkSpacing(propertyName) { return function (node) { if (!node.computed) { return; } var property = node[propertyName]; var before = sourceCode.getTokenBefore(property), first = sourceCode.getFirstToken(property), last = sourceCode.getLastToken(property), after = sourceCode.getTokenAfter(property); if (astUtils.isTokenOnSameLine(before, first)) { if (propertyNameMustBeSpaced) { if (!sourceCode.isSpaceBetweenTokens(before, first) && astUtils.isTokenOnSameLine(before, first)) { reportRequiredBeginningSpace(node, before); } } else { if (sourceCode.isSpaceBetweenTokens(before, first)) { reportNoBeginningSpace(node, before, first); } } } if (astUtils.isTokenOnSameLine(last, after)) { if (propertyNameMustBeSpaced) { if (!sourceCode.isSpaceBetweenTokens(last, after) && astUtils.isTokenOnSameLine(last, after)) { reportRequiredEndingSpace(node, after); } } else { if (sourceCode.isSpaceBetweenTokens(last, after)) { reportNoEndingSpace(node, after, last); } } } }; } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { Property: checkSpacing("key"), MemberExpression: checkSpacing("property") }; } }; },{"../ast-utils":67}],102:[function(require,module,exports){ /** * @fileoverview Rule to flag consistent return values * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var lodash = require("lodash"); var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Checks whether or not a given node is an `Identifier` node which was named a given name. * @param {ASTNode} node - A node to check. * @param {string} name - An expected name of the node. * @returns {boolean} `true` if the node is an `Identifier` node which was named as expected. */ function isIdentifier(node, name) { return node.type === "Identifier" && node.name === name; } /** * Checks whether or not a given code path segment is unreachable. * @param {CodePathSegment} segment - A CodePathSegment to check. * @returns {boolean} `true` if the segment is unreachable. */ function isUnreachable(segment) { return !segment.reachable; } /** * Checks whether a given node is a `constructor` method in an ES6 class * @param {ASTNode} node A node to check * @returns {boolean} `true` if the node is a `constructor` method */ function isClassConstructor(node) { return node.type === "FunctionExpression" && node.parent && node.parent.type === "MethodDefinition" && node.parent.kind === "constructor"; } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require `return` statements to either always or never specify values", category: "Best Practices", recommended: false }, schema: [{ type: "object", properties: { treatUndefinedAsUnspecified: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var options = context.options[0] || {}; var treatUndefinedAsUnspecified = options.treatUndefinedAsUnspecified === true; var funcInfo = null; /** * Checks whether of not the implicit returning is consistent if the last * code path segment is reachable. * * @param {ASTNode} node - A program/function node to check. * @returns {void} */ function checkLastSegment(node) { var loc = void 0, name = void 0; /* * Skip if it expected no return value or unreachable. * When unreachable, all paths are returned or thrown. */ if (!funcInfo.hasReturnValue || funcInfo.codePath.currentSegments.every(isUnreachable) || astUtils.isES5Constructor(node) || isClassConstructor(node)) { return; } // Adjust a location and a message. if (node.type === "Program") { // The head of program. loc = { line: 1, column: 0 }; name = "program"; } else if (node.type === "ArrowFunctionExpression") { // `=>` token loc = context.getSourceCode().getTokenBefore(node.body, astUtils.isArrowToken).loc.start; } else if (node.parent.type === "MethodDefinition" || node.parent.type === "Property" && node.parent.method) { // Method name. loc = node.parent.key.loc.start; } else { // Function name or `function` keyword. loc = (node.id || node).loc.start; } if (!name) { name = astUtils.getFunctionNameWithKind(node); } // Reports. context.report({ node: node, loc: loc, message: "Expected to return a value at the end of {{name}}.", data: { name: name } }); } return { // Initializes/Disposes state of each code path. onCodePathStart: function onCodePathStart(codePath, node) { funcInfo = { upper: funcInfo, codePath: codePath, hasReturn: false, hasReturnValue: false, message: "", node: node }; }, onCodePathEnd: function onCodePathEnd() { funcInfo = funcInfo.upper; }, // Reports a given return statement if it's inconsistent. ReturnStatement: function ReturnStatement(node) { var argument = node.argument; var hasReturnValue = Boolean(argument); if (treatUndefinedAsUnspecified && hasReturnValue) { hasReturnValue = !isIdentifier(argument, "undefined") && argument.operator !== "void"; } if (!funcInfo.hasReturn) { funcInfo.hasReturn = true; funcInfo.hasReturnValue = hasReturnValue; funcInfo.message = "{{name}} expected {{which}} return value."; funcInfo.data = { name: funcInfo.node.type === "Program" ? "Program" : lodash.upperFirst(astUtils.getFunctionNameWithKind(funcInfo.node)), which: hasReturnValue ? "a" : "no" }; } else if (funcInfo.hasReturnValue !== hasReturnValue) { context.report({ node: node, message: funcInfo.message, data: funcInfo.data }); } }, // Reports a given program/function if the implicit returning is not consistent. "Program:exit": checkLastSegment, "FunctionDeclaration:exit": checkLastSegment, "FunctionExpression:exit": checkLastSegment, "ArrowFunctionExpression:exit": checkLastSegment }; } }; },{"../ast-utils":67,"lodash":48}],103:[function(require,module,exports){ /** * @fileoverview Rule to enforce consistent naming of "this" context variables * @author Raphael Pigulla */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce consistent naming when capturing the current execution context", category: "Stylistic Issues", recommended: false }, schema: { type: "array", items: { type: "string", minLength: 1 }, uniqueItems: true } }, create: function create(context) { var aliases = []; if (context.options.length === 0) { aliases.push("that"); } else { aliases = context.options; } /** * Reports that a variable declarator or assignment expression is assigning * a non-'this' value to the specified alias. * @param {ASTNode} node - The assigning node. * @param {string} alias - the name of the alias that was incorrectly used. * @returns {void} */ function reportBadAssignment(node, alias) { context.report({ node: node, message: "Designated alias '{{alias}}' is not assigned to 'this'.", data: { alias: alias } }); } /** * Checks that an assignment to an identifier only assigns 'this' to the * appropriate alias, and the alias is only assigned to 'this'. * @param {ASTNode} node - The assigning node. * @param {Identifier} name - The name of the variable assigned to. * @param {Expression} value - The value of the assignment. * @returns {void} */ function checkAssignment(node, name, value) { var isThis = value.type === "ThisExpression"; if (aliases.indexOf(name) !== -1) { if (!isThis || node.operator && node.operator !== "=") { reportBadAssignment(node, name); } } else if (isThis) { context.report({ node: node, message: "Unexpected alias '{{name}}' for 'this'.", data: { name: name } }); } } /** * Ensures that a variable declaration of the alias in a program or function * is assigned to the correct value. * @param {string} alias alias the check the assignment of. * @param {Object} scope scope of the current code we are checking. * @private * @returns {void} */ function checkWasAssigned(alias, scope) { var variable = scope.set.get(alias); if (!variable) { return; } if (variable.defs.some(function (def) { return def.node.type === "VariableDeclarator" && def.node.init !== null; })) { return; } // The alias has been declared and not assigned: check it was // assigned later in the same scope. if (!variable.references.some(function (reference) { var write = reference.writeExpr; return reference.from === scope && write && write.type === "ThisExpression" && write.parent.operator === "="; })) { variable.defs.map(function (def) { return def.node; }).forEach(function (node) { reportBadAssignment(node, alias); }); } } /** * Check each alias to ensure that is was assinged to the correct value. * @returns {void} */ function ensureWasAssigned() { var scope = context.getScope(); aliases.forEach(function (alias) { checkWasAssigned(alias, scope); }); } return { "Program:exit": ensureWasAssigned, "FunctionExpression:exit": ensureWasAssigned, "FunctionDeclaration:exit": ensureWasAssigned, VariableDeclarator: function VariableDeclarator(node) { var id = node.id; var isDestructuring = id.type === "ArrayPattern" || id.type === "ObjectPattern"; if (node.init !== null && !isDestructuring) { checkAssignment(node, id.name, node.init); } }, AssignmentExpression: function AssignmentExpression(node) { if (node.left.type === "Identifier") { checkAssignment(node, node.left.name, node.right); } } }; } }; },{}],104:[function(require,module,exports){ /** * @fileoverview A rule to verify `super()` callings in constructor. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Checks whether a given code path segment is reachable or not. * * @param {CodePathSegment} segment - A code path segment to check. * @returns {boolean} `true` if the segment is reachable. */ function isReachable(segment) { return segment.reachable; } /** * Checks whether or not a given node is a constructor. * @param {ASTNode} node - A node to check. This node type is one of * `Program`, `FunctionDeclaration`, `FunctionExpression`, and * `ArrowFunctionExpression`. * @returns {boolean} `true` if the node is a constructor. */ function isConstructorFunction(node) { return node.type === "FunctionExpression" && node.parent.type === "MethodDefinition" && node.parent.kind === "constructor"; } /** * Checks whether a given node can be a constructor or not. * * @param {ASTNode} node - A node to check. * @returns {boolean} `true` if the node can be a constructor. */ function isPossibleConstructor(node) { if (!node) { return false; } switch (node.type) { case "ClassExpression": case "FunctionExpression": case "ThisExpression": case "MemberExpression": case "CallExpression": case "NewExpression": case "YieldExpression": case "TaggedTemplateExpression": case "MetaProperty": return true; case "Identifier": return node.name !== "undefined"; case "AssignmentExpression": return isPossibleConstructor(node.right); case "LogicalExpression": return isPossibleConstructor(node.left) || isPossibleConstructor(node.right); case "ConditionalExpression": return isPossibleConstructor(node.alternate) || isPossibleConstructor(node.consequent); case "SequenceExpression": { var lastExpression = node.expressions[node.expressions.length - 1]; return isPossibleConstructor(lastExpression); } default: return false; } } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require `super()` calls in constructors", category: "ECMAScript 6", recommended: true }, schema: [] }, create: function create(context) { /* * {{hasExtends: boolean, scope: Scope, codePath: CodePath}[]} * Information for each constructor. * - upper: Information of the upper constructor. * - hasExtends: A flag which shows whether own class has a valid `extends` * part. * - scope: The scope of own class. * - codePath: The code path object of the constructor. */ var funcInfo = null; /* * {Map} * Information for each code path segment. * - calledInSomePaths: A flag of be called `super()` in some code paths. * - calledInEveryPaths: A flag of be called `super()` in all code paths. * - validNodes: */ var segInfoMap = Object.create(null); /** * Gets the flag which shows `super()` is called in some paths. * @param {CodePathSegment} segment - A code path segment to get. * @returns {boolean} The flag which shows `super()` is called in some paths */ function isCalledInSomePath(segment) { return segment.reachable && segInfoMap[segment.id].calledInSomePaths; } /** * Gets the flag which shows `super()` is called in all paths. * @param {CodePathSegment} segment - A code path segment to get. * @returns {boolean} The flag which shows `super()` is called in all paths. */ function isCalledInEveryPath(segment) { /* * If specific segment is the looped segment of the current segment, * skip the segment. * If not skipped, this never becomes true after a loop. */ if (segment.nextSegments.length === 1 && segment.nextSegments[0].isLoopedPrevSegment(segment)) { return true; } return segment.reachable && segInfoMap[segment.id].calledInEveryPaths; } return { /** * Stacks a constructor information. * @param {CodePath} codePath - A code path which was started. * @param {ASTNode} node - The current node. * @returns {void} */ onCodePathStart: function onCodePathStart(codePath, node) { if (isConstructorFunction(node)) { // Class > ClassBody > MethodDefinition > FunctionExpression var classNode = node.parent.parent.parent; var superClass = classNode.superClass; funcInfo = { upper: funcInfo, isConstructor: true, hasExtends: Boolean(superClass), superIsConstructor: isPossibleConstructor(superClass), codePath: codePath }; } else { funcInfo = { upper: funcInfo, isConstructor: false, hasExtends: false, superIsConstructor: false, codePath: codePath }; } }, /** * Pops a constructor information. * And reports if `super()` lacked. * @param {CodePath} codePath - A code path which was ended. * @param {ASTNode} node - The current node. * @returns {void} */ onCodePathEnd: function onCodePathEnd(codePath, node) { var hasExtends = funcInfo.hasExtends; // Pop. funcInfo = funcInfo.upper; if (!hasExtends) { return; } // Reports if `super()` lacked. var segments = codePath.returnedSegments; var calledInEveryPaths = segments.every(isCalledInEveryPath); var calledInSomePaths = segments.some(isCalledInSomePath); if (!calledInEveryPaths) { context.report({ message: calledInSomePaths ? "Lacked a call of 'super()' in some code paths." : "Expected to call 'super()'.", node: node.parent }); } }, /** * Initialize information of a given code path segment. * @param {CodePathSegment} segment - A code path segment to initialize. * @returns {void} */ onCodePathSegmentStart: function onCodePathSegmentStart(segment) { if (!(funcInfo && funcInfo.isConstructor && funcInfo.hasExtends)) { return; } // Initialize info. var info = segInfoMap[segment.id] = { calledInSomePaths: false, calledInEveryPaths: false, validNodes: [] }; // When there are previous segments, aggregates these. var prevSegments = segment.prevSegments; if (prevSegments.length > 0) { info.calledInSomePaths = prevSegments.some(isCalledInSomePath); info.calledInEveryPaths = prevSegments.every(isCalledInEveryPath); } }, /** * Update information of the code path segment when a code path was * looped. * @param {CodePathSegment} fromSegment - The code path segment of the * end of a loop. * @param {CodePathSegment} toSegment - A code path segment of the head * of a loop. * @returns {void} */ onCodePathSegmentLoop: function onCodePathSegmentLoop(fromSegment, toSegment) { if (!(funcInfo && funcInfo.isConstructor && funcInfo.hasExtends)) { return; } // Update information inside of the loop. var isRealLoop = toSegment.prevSegments.length >= 2; funcInfo.codePath.traverseSegments({ first: toSegment, last: fromSegment }, function (segment) { var info = segInfoMap[segment.id]; var prevSegments = segment.prevSegments; // Updates flags. info.calledInSomePaths = prevSegments.some(isCalledInSomePath); info.calledInEveryPaths = prevSegments.every(isCalledInEveryPath); // If flags become true anew, reports the valid nodes. if (info.calledInSomePaths || isRealLoop) { var nodes = info.validNodes; info.validNodes = []; for (var i = 0; i < nodes.length; ++i) { var node = nodes[i]; context.report({ message: "Unexpected duplicate 'super()'.", node: node }); } } }); }, /** * Checks for a call of `super()`. * @param {ASTNode} node - A CallExpression node to check. * @returns {void} */ "CallExpression:exit": function CallExpressionExit(node) { if (!(funcInfo && funcInfo.isConstructor)) { return; } // Skips except `super()`. if (node.callee.type !== "Super") { return; } // Reports if needed. if (funcInfo.hasExtends) { var segments = funcInfo.codePath.currentSegments; var duplicate = false; var info = null; for (var i = 0; i < segments.length; ++i) { var segment = segments[i]; if (segment.reachable) { info = segInfoMap[segment.id]; duplicate = duplicate || info.calledInSomePaths; info.calledInSomePaths = info.calledInEveryPaths = true; } } if (info) { if (duplicate) { context.report({ message: "Unexpected duplicate 'super()'.", node: node }); } else if (!funcInfo.superIsConstructor) { context.report({ message: "Unexpected 'super()' because 'super' is not a constructor.", node: node }); } else { info.validNodes.push(node); } } } else if (funcInfo.codePath.currentSegments.some(isReachable)) { context.report({ message: "Unexpected 'super()'.", node: node }); } }, /** * Set the mark to the returned path as `super()` was called. * @param {ASTNode} node - A ReturnStatement node to check. * @returns {void} */ ReturnStatement: function ReturnStatement(node) { if (!(funcInfo && funcInfo.isConstructor && funcInfo.hasExtends)) { return; } // Skips if no argument. if (!node.argument) { return; } // Returning argument is a substitute of 'super()'. var segments = funcInfo.codePath.currentSegments; for (var i = 0; i < segments.length; ++i) { var segment = segments[i]; if (segment.reachable) { var info = segInfoMap[segment.id]; info.calledInSomePaths = info.calledInEveryPaths = true; } } }, /** * Resets state. * @returns {void} */ "Program:exit": function ProgramExit() { segInfoMap = Object.create(null); } }; } }; },{}],105:[function(require,module,exports){ /** * @fileoverview Rule to flag statements without curly braces * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce consistent brace style for all control statements", category: "Best Practices", recommended: false }, schema: { anyOf: [{ type: "array", items: [{ enum: ["all"] }], minItems: 0, maxItems: 1 }, { type: "array", items: [{ enum: ["multi", "multi-line", "multi-or-nest"] }, { enum: ["consistent"] }], minItems: 0, maxItems: 2 }] }, fixable: "code" }, create: function create(context) { var multiOnly = context.options[0] === "multi"; var multiLine = context.options[0] === "multi-line"; var multiOrNest = context.options[0] === "multi-or-nest"; var consistent = context.options[1] === "consistent"; var sourceCode = context.getSourceCode(); //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Determines if a given node is a one-liner that's on the same line as it's preceding code. * @param {ASTNode} node The node to check. * @returns {boolean} True if the node is a one-liner that's on the same line as it's preceding code. * @private */ function isCollapsedOneLiner(node) { var before = sourceCode.getTokenBefore(node); var last = sourceCode.getLastToken(node); var lastExcludingSemicolon = astUtils.isSemicolonToken(last) ? sourceCode.getTokenBefore(last) : last; return before.loc.start.line === lastExcludingSemicolon.loc.end.line; } /** * Determines if a given node is a one-liner. * @param {ASTNode} node The node to check. * @returns {boolean} True if the node is a one-liner. * @private */ function isOneLiner(node) { var first = sourceCode.getFirstToken(node), last = sourceCode.getLastToken(node); return first.loc.start.line === last.loc.end.line; } /** * Checks if the given token is an `else` token or not. * * @param {Token} token - The token to check. * @returns {boolean} `true` if the token is an `else` token. */ function isElseKeywordToken(token) { return token.value === "else" && token.type === "Keyword"; } /** * Gets the `else` keyword token of a given `IfStatement` node. * @param {ASTNode} node - A `IfStatement` node to get. * @returns {Token} The `else` keyword token. */ function getElseKeyword(node) { return node.alternate && sourceCode.getFirstTokenBetween(node.consequent, node.alternate, isElseKeywordToken); } /** * Checks a given IfStatement node requires braces of the consequent chunk. * This returns `true` when below: * * 1. The given node has the `alternate` node. * 2. There is a `IfStatement` which doesn't have `alternate` node in the * trailing statement chain of the `consequent` node. * * @param {ASTNode} node - A IfStatement node to check. * @returns {boolean} `true` if the node requires braces of the consequent chunk. */ function requiresBraceOfConsequent(node) { if (node.alternate && node.consequent.type === "BlockStatement") { if (node.consequent.body.length >= 2) { return true; } node = node.consequent.body[0]; while (node) { if (node.type === "IfStatement" && !node.alternate) { return true; } node = astUtils.getTrailingStatement(node); } } return false; } /** * Reports "Expected { after ..." error * @param {ASTNode} node The node to report. * @param {ASTNode} bodyNode The body node that is incorrectly missing curly brackets * @param {string} name The name to report. * @param {string} suffix Additional string to add to the end of a report. * @returns {void} * @private */ function reportExpectedBraceError(node, bodyNode, name, suffix) { context.report({ node: node, loc: (name !== "else" ? node : getElseKeyword(node)).loc.start, message: "Expected { after '{{name}}'{{suffix}}.", data: { name: name, suffix: suffix ? " " + suffix : "" }, fix: function fix(fixer) { return fixer.replaceText(bodyNode, "{" + sourceCode.getText(bodyNode) + "}"); } }); } /** * Determines if a semicolon needs to be inserted after removing a set of curly brackets, in order to avoid a SyntaxError. * @param {Token} closingBracket The } token * @returns {boolean} `true` if a semicolon needs to be inserted after the last statement in the block. */ function needsSemicolon(closingBracket) { var tokenBefore = sourceCode.getTokenBefore(closingBracket); var tokenAfter = sourceCode.getTokenAfter(closingBracket); var lastBlockNode = sourceCode.getNodeByRangeIndex(tokenBefore.range[0]); if (astUtils.isSemicolonToken(tokenBefore)) { // If the last statement already has a semicolon, don't add another one. return false; } if (!tokenAfter) { // If there are no statements after this block, there is no need to add a semicolon. return false; } if (lastBlockNode.type === "BlockStatement" && lastBlockNode.parent.type !== "FunctionExpression" && lastBlockNode.parent.type !== "ArrowFunctionExpression") { // If the last node surrounded by curly brackets is a BlockStatement (other than a FunctionExpression or an ArrowFunctionExpression), // don't insert a semicolon. Otherwise, the semicolon would be parsed as a separate statement, which would cause // a SyntaxError if it was followed by `else`. return false; } if (tokenBefore.loc.end.line === tokenAfter.loc.start.line) { // If the next token is on the same line, insert a semicolon. return true; } if (/^[([/`+-]/.test(tokenAfter.value)) { // If the next token starts with a character that would disrupt ASI, insert a semicolon. return true; } if (tokenBefore.type === "Punctuator" && (tokenBefore.value === "++" || tokenBefore.value === "--")) { // If the last token is ++ or --, insert a semicolon to avoid disrupting ASI. return true; } // Otherwise, do not insert a semicolon. return false; } /** * Reports "Unnecessary { after ..." error * @param {ASTNode} node The node to report. * @param {ASTNode} bodyNode The block statement that is incorrectly surrounded by parens * @param {string} name The name to report. * @param {string} suffix Additional string to add to the end of a report. * @returns {void} * @private */ function reportUnnecessaryBraceError(node, bodyNode, name, suffix) { context.report({ node: node, loc: (name !== "else" ? node : getElseKeyword(node)).loc.start, message: "Unnecessary { after '{{name}}'{{suffix}}.", data: { name: name, suffix: suffix ? " " + suffix : "" }, fix: function fix(fixer) { // `do while` expressions sometimes need a space to be inserted after `do`. // e.g. `do{foo()} while (bar)` should be corrected to `do foo() while (bar)` var needsPrecedingSpace = node.type === "DoWhileStatement" && sourceCode.getTokenBefore(bodyNode).end === bodyNode.start && !astUtils.canTokensBeAdjacent("do", sourceCode.getFirstToken(bodyNode, { skip: 1 })); var openingBracket = sourceCode.getFirstToken(bodyNode); var closingBracket = sourceCode.getLastToken(bodyNode); var lastTokenInBlock = sourceCode.getTokenBefore(closingBracket); if (needsSemicolon(closingBracket)) { /* * If removing braces would cause a SyntaxError due to multiple statements on the same line (or * change the semantics of the code due to ASI), don't perform a fix. */ return null; } var resultingBodyText = sourceCode.getText().slice(openingBracket.range[1], lastTokenInBlock.range[0]) + sourceCode.getText(lastTokenInBlock) + sourceCode.getText().slice(lastTokenInBlock.range[1], closingBracket.range[0]); return fixer.replaceText(bodyNode, (needsPrecedingSpace ? " " : "") + resultingBodyText); } }); } /** * Prepares to check the body of a node to see if it's a block statement. * @param {ASTNode} node The node to report if there's a problem. * @param {ASTNode} body The body node to check for blocks. * @param {string} name The name to report if there's a problem. * @param {string} suffix Additional string to add to the end of a report. * @returns {Object} a prepared check object, with "actual", "expected", "check" properties. * "actual" will be `true` or `false` whether the body is already a block statement. * "expected" will be `true` or `false` if the body should be a block statement or not, or * `null` if it doesn't matter, depending on the rule options. It can be modified to change * the final behavior of "check". * "check" will be a function reporting appropriate problems depending on the other * properties. */ function prepareCheck(node, body, name, suffix) { var hasBlock = body.type === "BlockStatement"; var expected = null; if (node.type === "IfStatement" && node.consequent === body && requiresBraceOfConsequent(node)) { expected = true; } else if (multiOnly) { if (hasBlock && body.body.length === 1) { expected = false; } } else if (multiLine) { if (!isCollapsedOneLiner(body)) { expected = true; } } else if (multiOrNest) { if (hasBlock && body.body.length === 1 && isOneLiner(body.body[0])) { var leadingComments = sourceCode.getCommentsBefore(body.body[0]); expected = leadingComments.length > 0; } else if (!isOneLiner(body)) { expected = true; } } else { expected = true; } return { actual: hasBlock, expected: expected, check: function check() { if (this.expected !== null && this.expected !== this.actual) { if (this.expected) { reportExpectedBraceError(node, body, name, suffix); } else { reportUnnecessaryBraceError(node, body, name, suffix); } } } }; } /** * Prepares to check the bodies of a "if", "else if" and "else" chain. * @param {ASTNode} node The first IfStatement node of the chain. * @returns {Object[]} prepared checks for each body of the chain. See `prepareCheck` for more * information. */ function prepareIfChecks(node) { var preparedChecks = []; do { preparedChecks.push(prepareCheck(node, node.consequent, "if", "condition")); if (node.alternate && node.alternate.type !== "IfStatement") { preparedChecks.push(prepareCheck(node, node.alternate, "else")); break; } node = node.alternate; } while (node); if (consistent) { /* * If any node should have or already have braces, make sure they * all have braces. * If all nodes shouldn't have braces, make sure they don't. */ var expected = preparedChecks.some(function (preparedCheck) { if (preparedCheck.expected !== null) { return preparedCheck.expected; } return preparedCheck.actual; }); preparedChecks.forEach(function (preparedCheck) { preparedCheck.expected = expected; }); } return preparedChecks; } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { IfStatement: function IfStatement(node) { if (node.parent.type !== "IfStatement") { prepareIfChecks(node).forEach(function (preparedCheck) { preparedCheck.check(); }); } }, WhileStatement: function WhileStatement(node) { prepareCheck(node, node.body, "while", "condition").check(); }, DoWhileStatement: function DoWhileStatement(node) { prepareCheck(node, node.body, "do").check(); }, ForStatement: function ForStatement(node) { prepareCheck(node, node.body, "for", "condition").check(); }, ForInStatement: function ForInStatement(node) { prepareCheck(node, node.body, "for-in").check(); }, ForOfStatement: function ForOfStatement(node) { prepareCheck(node, node.body, "for-of").check(); } }; } }; },{"../ast-utils":67}],106:[function(require,module,exports){ /** * @fileoverview require default case in switch statements * @author Aliaksei Shytkin */ "use strict"; var DEFAULT_COMMENT_PATTERN = /^no default$/i; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require `default` cases in `switch` statements", category: "Best Practices", recommended: false }, schema: [{ type: "object", properties: { commentPattern: { type: "string" } }, additionalProperties: false }] }, create: function create(context) { var options = context.options[0] || {}; var commentPattern = options.commentPattern ? new RegExp(options.commentPattern) : DEFAULT_COMMENT_PATTERN; var sourceCode = context.getSourceCode(); //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Shortcut to get last element of array * @param {*[]} collection Array * @returns {*} Last element */ function last(collection) { return collection[collection.length - 1]; } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { SwitchStatement: function SwitchStatement(node) { if (!node.cases.length) { /* * skip check of empty switch because there is no easy way * to extract comments inside it now */ return; } var hasDefault = node.cases.some(function (v) { return v.test === null; }); if (!hasDefault) { var comment = void 0; var lastCase = last(node.cases); var comments = sourceCode.getCommentsAfter(lastCase); if (comments.length) { comment = last(comments); } if (!comment || !commentPattern.test(comment.value.trim())) { context.report({ node: node, message: "Expected a default case." }); } } } }; } }; },{}],107:[function(require,module,exports){ /** * @fileoverview Validates newlines before and after dots * @author Greg Cochard */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce consistent newlines before and after dots", category: "Best Practices", recommended: false }, schema: [{ enum: ["object", "property"] }], fixable: "code" }, create: function create(context) { var config = context.options[0]; // default to onObject if no preference is passed var onObject = config === "object" || !config; var sourceCode = context.getSourceCode(); /** * Reports if the dot between object and property is on the correct loccation. * @param {ASTNode} obj The object owning the property. * @param {ASTNode} prop The property of the object. * @param {ASTNode} node The corresponding node of the token. * @returns {void} */ function checkDotLocation(obj, prop, node) { var dot = sourceCode.getTokenBefore(prop); var textBeforeDot = sourceCode.getText().slice(obj.range[1], dot.range[0]); var textAfterDot = sourceCode.getText().slice(dot.range[1], prop.range[0]); if (dot.type === "Punctuator" && dot.value === ".") { if (onObject) { if (!astUtils.isTokenOnSameLine(obj, dot)) { var neededTextAfterObj = astUtils.isDecimalInteger(obj) ? " " : ""; context.report({ node: node, loc: dot.loc.start, message: "Expected dot to be on same line as object.", fix: function fix(fixer) { return fixer.replaceTextRange([obj.range[1], prop.range[0]], neededTextAfterObj + "." + textBeforeDot + textAfterDot); } }); } } else if (!astUtils.isTokenOnSameLine(dot, prop)) { context.report({ node: node, loc: dot.loc.start, message: "Expected dot to be on same line as property.", fix: function fix(fixer) { return fixer.replaceTextRange([obj.range[1], prop.range[0]], "" + textBeforeDot + textAfterDot + "."); } }); } } } /** * Checks the spacing of the dot within a member expression. * @param {ASTNode} node The node to check. * @returns {void} */ function checkNode(node) { checkDotLocation(node.object, node.property, node); } return { MemberExpression: checkNode }; } }; },{"../ast-utils":67}],108:[function(require,module,exports){ /** * @fileoverview Rule to warn about using dot notation instead of square bracket notation when possible. * @author Josh Perez */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ var validIdentifier = /^[a-zA-Z_$][a-zA-Z0-9_$]*$/; var keywords = require("../util/keywords"); module.exports = { meta: { docs: { description: "enforce dot notation whenever possible", category: "Best Practices", recommended: false }, schema: [{ type: "object", properties: { allowKeywords: { type: "boolean" }, allowPattern: { type: "string" } }, additionalProperties: false }], fixable: "code" }, create: function create(context) { var options = context.options[0] || {}; var allowKeywords = options.allowKeywords === void 0 || !!options.allowKeywords; var sourceCode = context.getSourceCode(); var allowPattern = void 0; if (options.allowPattern) { allowPattern = new RegExp(options.allowPattern); } return { MemberExpression: function MemberExpression(node) { if (node.computed && node.property.type === "Literal" && validIdentifier.test(node.property.value) && (allowKeywords || keywords.indexOf(String(node.property.value)) === -1)) { if (!(allowPattern && allowPattern.test(node.property.value))) { context.report({ node: node.property, message: "[{{propertyValue}}] is better written in dot notation.", data: { propertyValue: JSON.stringify(node.property.value) }, fix: function fix(fixer) { var leftBracket = sourceCode.getTokenAfter(node.object, astUtils.isOpeningBracketToken); var rightBracket = sourceCode.getLastToken(node); if (sourceCode.getFirstTokenBetween(leftBracket, rightBracket, { includeComments: true, filter: astUtils.isCommentToken })) { // Don't perform any fixes if there are comments inside the brackets. return null; } var tokenAfterProperty = sourceCode.getTokenAfter(rightBracket); var needsSpaceAfterProperty = tokenAfterProperty && rightBracket.range[1] === tokenAfterProperty.range[0] && !astUtils.canTokensBeAdjacent(String(node.property.value), tokenAfterProperty); var textBeforeDot = astUtils.isDecimalInteger(node.object) ? " " : ""; var textAfterProperty = needsSpaceAfterProperty ? " " : ""; return fixer.replaceTextRange([leftBracket.range[0], rightBracket.range[1]], textBeforeDot + "." + node.property.value + textAfterProperty); } }); } } if (!allowKeywords && !node.computed && keywords.indexOf(String(node.property.name)) !== -1) { context.report({ node: node.property, message: ".{{propertyName}} is a syntax error.", data: { propertyName: node.property.name }, fix: function fix(fixer) { var dot = sourceCode.getTokenBefore(node.property); var textAfterDot = sourceCode.text.slice(dot.range[1], node.property.range[0]); if (textAfterDot.trim()) { // Don't perform any fixes if there are comments between the dot and the property name. return null; } return fixer.replaceTextRange([dot.range[0], node.property.range[1]], "[" + textAfterDot + "\"" + node.property.name + "\"]"); } }); } } }; } }; },{"../ast-utils":67,"../util/keywords":349}],109:[function(require,module,exports){ /** * @fileoverview Require or disallow newline at the end of files * @author Nodeca Team */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var lodash = require("lodash"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require or disallow newline at the end of files", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ enum: ["always", "never", "unix", "windows"] }] }, create: function create(context) { //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { Program: function checkBadEOF(node) { var sourceCode = context.getSourceCode(), src = sourceCode.getText(), location = { column: lodash.last(sourceCode.lines).length, line: sourceCode.lines.length }, LF = "\n", CRLF = "\r" + LF, endsWithNewline = lodash.endsWith(src, LF); var mode = context.options[0] || "always", appendCRLF = false; if (mode === "unix") { // `"unix"` should behave exactly as `"always"` mode = "always"; } if (mode === "windows") { // `"windows"` should behave exactly as `"always"`, but append CRLF in the fixer for backwards compatibility mode = "always"; appendCRLF = true; } if (mode === "always" && !endsWithNewline) { // File is not newline-terminated, but should be context.report({ node: node, loc: location, message: "Newline required at end of file but not found.", fix: function fix(fixer) { return fixer.insertTextAfterRange([0, src.length], appendCRLF ? CRLF : LF); } }); } else if (mode === "never" && endsWithNewline) { // File is newline-terminated, but shouldn't be context.report({ node: node, loc: location, message: "Newline not allowed at end of file.", fix: function fix(fixer) { var finalEOLs = /(?:\r?\n)+$/, match = finalEOLs.exec(sourceCode.text), start = match.index, end = sourceCode.text.length; return fixer.replaceTextRange([start, end], ""); } }); } } }; } }; },{"lodash":48}],110:[function(require,module,exports){ /** * @fileoverview Rule to flag statements that use != and == instead of !== and === * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require the use of `===` and `!==`", category: "Best Practices", recommended: false }, schema: { anyOf: [{ type: "array", items: [{ enum: ["always"] }, { type: "object", properties: { null: { enum: ["always", "never", "ignore"] } }, additionalProperties: false }], additionalItems: false }, { type: "array", items: [{ enum: ["smart", "allow-null"] }], additionalItems: false }] }, fixable: "code" }, create: function create(context) { var config = context.options[0] || "always"; var options = context.options[1] || {}; var sourceCode = context.getSourceCode(); var nullOption = config === "always" ? options.null || "always" : "ignore"; var enforceRuleForNull = nullOption === "always"; var enforceInverseRuleForNull = nullOption === "never"; /** * Checks if an expression is a typeof expression * @param {ASTNode} node The node to check * @returns {boolean} if the node is a typeof expression */ function isTypeOf(node) { return node.type === "UnaryExpression" && node.operator === "typeof"; } /** * Checks if either operand of a binary expression is a typeof operation * @param {ASTNode} node The node to check * @returns {boolean} if one of the operands is typeof * @private */ function isTypeOfBinary(node) { return isTypeOf(node.left) || isTypeOf(node.right); } /** * Checks if operands are literals of the same type (via typeof) * @param {ASTNode} node The node to check * @returns {boolean} if operands are of same type * @private */ function areLiteralsAndSameType(node) { return node.left.type === "Literal" && node.right.type === "Literal" && _typeof(node.left.value) === _typeof(node.right.value); } /** * Checks if one of the operands is a literal null * @param {ASTNode} node The node to check * @returns {boolean} if operands are null * @private */ function isNullCheck(node) { return astUtils.isNullLiteral(node.right) || astUtils.isNullLiteral(node.left); } /** * Gets the location (line and column) of the binary expression's operator * @param {ASTNode} node The binary expression node to check * @param {string} operator The operator to find * @returns {Object} { line, column } location of operator * @private */ function getOperatorLocation(node) { var opToken = sourceCode.getTokenAfter(node.left); return { line: opToken.loc.start.line, column: opToken.loc.start.column }; } /** * Reports a message for this rule. * @param {ASTNode} node The binary expression node that was checked * @param {string} expectedOperator The operator that was expected (either '==', '!=', '===', or '!==') * @returns {void} * @private */ function report(node, expectedOperator) { context.report({ node: node, loc: getOperatorLocation(node), message: "Expected '{{expectedOperator}}' and instead saw '{{actualOperator}}'.", data: { expectedOperator: expectedOperator, actualOperator: node.operator }, fix: function fix(fixer) { // If the comparison is a `typeof` comparison or both sides are literals with the same type, then it's safe to fix. if (isTypeOfBinary(node) || areLiteralsAndSameType(node)) { var operatorToken = sourceCode.getFirstTokenBetween(node.left, node.right, function (token) { return token.value === node.operator; }); return fixer.replaceText(operatorToken, expectedOperator); } return null; } }); } return { BinaryExpression: function BinaryExpression(node) { var isNull = isNullCheck(node); if (node.operator !== "==" && node.operator !== "!=") { if (enforceInverseRuleForNull && isNull) { report(node, node.operator.slice(0, -1)); } return; } if (config === "smart" && (isTypeOfBinary(node) || areLiteralsAndSameType(node) || isNull)) { return; } if (!enforceRuleForNull && isNull) { return; } report(node, node.operator + "="); } }; } }; },{"../ast-utils":67}],111:[function(require,module,exports){ /** * @fileoverview enforce "for" loop update clause moving the counter in the right direction.(for-direction) * @author Aladdin-ADD */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce \"for\" loop update clause moving the counter in the right direction.", category: "Possible Errors", recommended: false }, fixable: null, schema: [] }, create: function create(context) { /** * report an error. * @param {ASTNode} node the node to report. * @returns {void} */ function report(node) { context.report({ node: node, message: "The update clause in this loop moves the variable in the wrong direction." }); } /** * check UpdateExpression add/sub the counter * @param {ASTNode} update UpdateExpression to check * @param {string} counter variable name to check * @returns {int} if add return 1, if sub return -1, if nochange, return 0 */ function getUpdateDirection(update, counter) { if (update.argument.type === "Identifier" && update.argument.name === counter) { if (update.operator === "++") { return 1; } if (update.operator === "--") { return -1; } } return 0; } /** * check AssignmentExpression add/sub the counter * @param {ASTNode} update AssignmentExpression to check * @param {string} counter variable name to check * @returns {int} if add return 1, if sub return -1, if nochange, return 0 */ function getAssignmentDirection(update, counter) { if (update.left.name === counter) { if (update.operator === "+=") { return 1; } if (update.operator === "-=") { return -1; } } return 0; } return { ForStatement: function ForStatement(node) { if (node.test && node.test.type === "BinaryExpression" && node.test.left.type === "Identifier" && node.update) { var counter = node.test.left.name; var operator = node.test.operator; var update = node.update; if (operator === "<" || operator === "<=") { // report error if update sub the counter (--, -=) if (update.type === "UpdateExpression" && getUpdateDirection(update, counter) < 0) { report(node); } if (update.type === "AssignmentExpression" && getAssignmentDirection(update, counter) < 0) { report(node); } } else if (operator === ">" || operator === ">=") { // report error if update add the counter (++, +=) if (update.type === "UpdateExpression" && getUpdateDirection(update, counter) > 0) { report(node); } if (update.type === "AssignmentExpression" && getAssignmentDirection(update, counter) > 0) { report(node); } } } } }; } }; },{}],112:[function(require,module,exports){ /** * @fileoverview Rule to control spacing within function calls * @author Matt DuVall */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require or disallow spacing between function identifiers and their invocations", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: { anyOf: [{ type: "array", items: [{ enum: ["never"] }], minItems: 0, maxItems: 1 }, { type: "array", items: [{ enum: ["always"] }, { type: "object", properties: { allowNewlines: { type: "boolean" } }, additionalProperties: false }], minItems: 0, maxItems: 2 }] } }, create: function create(context) { var never = context.options[0] !== "always"; var allowNewlines = !never && context.options[1] && context.options[1].allowNewlines; var sourceCode = context.getSourceCode(); var text = sourceCode.getText(); /** * Check if open space is present in a function name * @param {ASTNode} node node to evaluate * @returns {void} * @private */ function checkSpacing(node) { var lastToken = sourceCode.getLastToken(node); var lastCalleeToken = sourceCode.getLastToken(node.callee); var parenToken = sourceCode.getFirstTokenBetween(lastCalleeToken, lastToken, astUtils.isOpeningParenToken); var prevToken = parenToken && sourceCode.getTokenBefore(parenToken); // Parens in NewExpression are optional if (!(parenToken && parenToken.range[1] < node.range[1])) { return; } var textBetweenTokens = text.slice(prevToken.range[1], parenToken.range[0]).replace(/\/\*.*?\*\//g, ""); var hasWhitespace = /\s/.test(textBetweenTokens); var hasNewline = hasWhitespace && astUtils.LINEBREAK_MATCHER.test(textBetweenTokens); /* * never allowNewlines hasWhitespace hasNewline message * F F F F Missing space between function name and paren. * F F F T (Invalid `!hasWhitespace && hasNewline`) * F F T T Unexpected newline between function name and paren. * F F T F (OK) * F T T F (OK) * F T T T (OK) * F T F T (Invalid `!hasWhitespace && hasNewline`) * F T F F Missing space between function name and paren. * T T F F (Invalid `never && allowNewlines`) * T T F T (Invalid `!hasWhitespace && hasNewline`) * T T T T (Invalid `never && allowNewlines`) * T T T F (Invalid `never && allowNewlines`) * T F T F Unexpected space between function name and paren. * T F T T Unexpected space between function name and paren. * T F F T (Invalid `!hasWhitespace && hasNewline`) * T F F F (OK) * * T T Unexpected space between function name and paren. * F F Missing space between function name and paren. * F F T Unexpected newline between function name and paren. */ if (never && hasWhitespace) { context.report({ node: node, loc: lastCalleeToken.loc.start, message: "Unexpected space between function name and paren.", fix: function fix(fixer) { // Only autofix if there is no newline // https://github.com/eslint/eslint/issues/7787 if (!hasNewline) { return fixer.removeRange([prevToken.range[1], parenToken.range[0]]); } return null; } }); } else if (!never && !hasWhitespace) { context.report({ node: node, loc: lastCalleeToken.loc.start, message: "Missing space between function name and paren.", fix: function fix(fixer) { return fixer.insertTextBefore(parenToken, " "); } }); } else if (!never && !allowNewlines && hasNewline) { context.report({ node: node, loc: lastCalleeToken.loc.start, message: "Unexpected newline between function name and paren.", fix: function fix(fixer) { return fixer.replaceTextRange([prevToken.range[1], parenToken.range[0]], " "); } }); } } return { CallExpression: checkSpacing, NewExpression: checkSpacing }; } }; },{"../ast-utils":67}],113:[function(require,module,exports){ /** * @fileoverview Rule to require function names to match the name of the variable or property to which they are assigned. * @author Annie Zhang, Pavel Strashkin */ "use strict"; //-------------------------------------------------------------------------- // Requirements //-------------------------------------------------------------------------- var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; var astUtils = require("../ast-utils"); var esutils = require("esutils"); //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Determines if a pattern is `module.exports` or `module["exports"]` * @param {ASTNode} pattern The left side of the AssignmentExpression * @returns {boolean} True if the pattern is `module.exports` or `module["exports"]` */ function isModuleExports(pattern) { if (pattern.type === "MemberExpression" && pattern.object.type === "Identifier" && pattern.object.name === "module") { // module.exports if (pattern.property.type === "Identifier" && pattern.property.name === "exports") { return true; } // module["exports"] if (pattern.property.type === "Literal" && pattern.property.value === "exports") { return true; } } return false; } /** * Determines if a string name is a valid identifier * @param {string} name The string to be checked * @param {int} ecmaVersion The ECMAScript version if specified in the parserOptions config * @returns {boolean} True if the string is a valid identifier */ function isIdentifier(name, ecmaVersion) { if (ecmaVersion >= 6) { return esutils.keyword.isIdentifierES6(name); } return esutils.keyword.isIdentifierES5(name); } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ var alwaysOrNever = { enum: ["always", "never"] }; var optionsObject = { type: "object", properties: { includeCommonJSModuleExports: { type: "boolean" } }, additionalProperties: false }; module.exports = { meta: { docs: { description: "require function names to match the name of the variable or property to which they are assigned", category: "Stylistic Issues", recommended: false }, schema: { anyOf: [{ type: "array", additionalItems: false, items: [alwaysOrNever, optionsObject] }, { type: "array", additionalItems: false, items: [optionsObject] }] } }, create: function create(context) { var options = (_typeof(context.options[0]) === "object" ? context.options[0] : context.options[1]) || {}; var nameMatches = typeof context.options[0] === "string" ? context.options[0] : "always"; var includeModuleExports = options.includeCommonJSModuleExports; var ecmaVersion = context.parserOptions && context.parserOptions.ecmaVersion ? context.parserOptions.ecmaVersion : 5; /** * Compares identifiers based on the nameMatches option * @param {string} x the first identifier * @param {string} y the second identifier * @returns {boolean} whether the two identifiers should warn. */ function shouldWarn(x, y) { return nameMatches === "always" && x !== y || nameMatches === "never" && x === y; } /** * Reports * @param {ASTNode} node The node to report * @param {string} name The variable or property name * @param {string} funcName The function name * @param {boolean} isProp True if the reported node is a property assignment * @returns {void} */ function report(node, name, funcName, isProp) { var message = void 0; if (nameMatches === "always" && isProp) { message = "Function name `{{funcName}}` should match property name `{{name}}`"; } else if (nameMatches === "always") { message = "Function name `{{funcName}}` should match variable name `{{name}}`"; } else if (isProp) { message = "Function name `{{funcName}}` should not match property name `{{name}}`"; } else { message = "Function name `{{funcName}}` should not match variable name `{{name}}`"; } context.report({ node: node, message: message, data: { name: name, funcName: funcName } }); } /** * Determines whether a given node is a string literal * @param {ASTNode} node The node to check * @returns {boolean} `true` if the node is a string literal */ function isStringLiteral(node) { return node.type === "Literal" && typeof node.value === "string"; } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { VariableDeclarator: function VariableDeclarator(node) { if (!node.init || node.init.type !== "FunctionExpression" || node.id.type !== "Identifier") { return; } if (node.init.id && shouldWarn(node.id.name, node.init.id.name)) { report(node, node.id.name, node.init.id.name, false); } }, AssignmentExpression: function AssignmentExpression(node) { if (node.right.type !== "FunctionExpression" || node.left.computed && node.left.property.type !== "Literal" || !includeModuleExports && isModuleExports(node.left) || node.left.type !== "Identifier" && node.left.type !== "MemberExpression") { return; } var isProp = node.left.type === "MemberExpression"; var name = isProp ? astUtils.getStaticPropertyName(node.left) : node.left.name; if (node.right.id && isIdentifier(name) && shouldWarn(name, node.right.id.name)) { report(node, name, node.right.id.name, isProp); } }, Property: function Property(node) { if (node.value.type !== "FunctionExpression" || !node.value.id || node.computed && !isStringLiteral(node.key)) { return; } if (node.key.type === "Identifier" && shouldWarn(node.key.name, node.value.id.name)) { report(node, node.key.name, node.value.id.name, true); } else if (isStringLiteral(node.key) && isIdentifier(node.key.value, ecmaVersion) && shouldWarn(node.key.value, node.value.id.name)) { report(node, node.key.value, node.value.id.name, true); } } }; } }; },{"../ast-utils":67,"esutils":33}],114:[function(require,module,exports){ /** * @fileoverview Rule to warn when a function expression does not have a name. * @author Kyle T. Nunery */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); /** * Checks whether or not a given variable is a function name. * @param {eslint-scope.Variable} variable - A variable to check. * @returns {boolean} `true` if the variable is a function name. */ function isFunctionName(variable) { return variable && variable.defs[0].type === "FunctionName"; } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require or disallow named `function` expressions", category: "Stylistic Issues", recommended: false }, schema: [{ enum: ["always", "as-needed", "never"] }] }, create: function create(context) { var never = context.options[0] === "never"; var asNeeded = context.options[0] === "as-needed"; /** * Determines whether the current FunctionExpression node is a get, set, or * shorthand method in an object literal or a class. * @param {ASTNode} node - A node to check. * @returns {boolean} True if the node is a get, set, or shorthand method. */ function isObjectOrClassMethod(node) { var parent = node.parent; return parent.type === "MethodDefinition" || parent.type === "Property" && (parent.method || parent.kind === "get" || parent.kind === "set"); } /** * Determines whether the current FunctionExpression node has a name that would be * inferred from context in a conforming ES6 environment. * @param {ASTNode} node - A node to check. * @returns {boolean} True if the node would have a name assigned automatically. */ function hasInferredName(node) { var parent = node.parent; return isObjectOrClassMethod(node) || parent.type === "VariableDeclarator" && parent.id.type === "Identifier" && parent.init === node || parent.type === "Property" && parent.value === node || parent.type === "AssignmentExpression" && parent.left.type === "Identifier" && parent.right === node || parent.type === "ExportDefaultDeclaration" && parent.declaration === node || parent.type === "AssignmentPattern" && parent.right === node; } return { "FunctionExpression:exit": function FunctionExpressionExit(node) { // Skip recursive functions. var nameVar = context.getDeclaredVariables(node)[0]; if (isFunctionName(nameVar) && nameVar.references.length > 0) { return; } var hasName = Boolean(node.id && node.id.name); var name = astUtils.getFunctionNameWithKind(node); if (never) { if (hasName) { context.report({ node: node, message: "Unexpected named {{name}}.", data: { name: name } }); } } else { if (!hasName && (asNeeded ? !hasInferredName(node) : !isObjectOrClassMethod(node))) { context.report({ node: node, message: "Unexpected unnamed {{name}}.", data: { name: name } }); } } } }; } }; },{"../ast-utils":67}],115:[function(require,module,exports){ /** * @fileoverview Rule to enforce a particular function style * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce the consistent use of either `function` declarations or expressions", category: "Stylistic Issues", recommended: false }, schema: [{ enum: ["declaration", "expression"] }, { type: "object", properties: { allowArrowFunctions: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var style = context.options[0], allowArrowFunctions = context.options[1] && context.options[1].allowArrowFunctions === true, enforceDeclarations = style === "declaration", stack = []; var nodesToCheck = { FunctionDeclaration: function FunctionDeclaration(node) { stack.push(false); if (!enforceDeclarations && node.parent.type !== "ExportDefaultDeclaration") { context.report({ node: node, message: "Expected a function expression." }); } }, "FunctionDeclaration:exit": function FunctionDeclarationExit() { stack.pop(); }, FunctionExpression: function FunctionExpression(node) { stack.push(false); if (enforceDeclarations && node.parent.type === "VariableDeclarator") { context.report({ node: node.parent, message: "Expected a function declaration." }); } }, "FunctionExpression:exit": function FunctionExpressionExit() { stack.pop(); }, ThisExpression: function ThisExpression() { if (stack.length > 0) { stack[stack.length - 1] = true; } } }; if (!allowArrowFunctions) { nodesToCheck.ArrowFunctionExpression = function () { stack.push(false); }; nodesToCheck["ArrowFunctionExpression:exit"] = function (node) { var hasThisExpr = stack.pop(); if (enforceDeclarations && !hasThisExpr && node.parent.type === "VariableDeclarator") { context.report({ node: node.parent, message: "Expected a function declaration." }); } }; } return nodesToCheck; } }; },{}],116:[function(require,module,exports){ /** * @fileoverview Rule to check the spacing around the * in generator functions. * @author Jamund Ferguson */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce consistent spacing around `*` operators in generator functions", category: "ECMAScript 6", recommended: false }, fixable: "whitespace", schema: [{ oneOf: [{ enum: ["before", "after", "both", "neither"] }, { type: "object", properties: { before: { type: "boolean" }, after: { type: "boolean" } }, additionalProperties: false }] }] }, create: function create(context) { var mode = function (option) { if (!option || typeof option === "string") { return { before: { before: true, after: false }, after: { before: false, after: true }, both: { before: true, after: true }, neither: { before: false, after: false } }[option || "before"]; } return option; }(context.options[0]); var sourceCode = context.getSourceCode(); /** * Checks if the given token is a star token or not. * * @param {Token} token - The token to check. * @returns {boolean} `true` if the token is a star token. */ function isStarToken(token) { return token.value === "*" && token.type === "Punctuator"; } /** * Gets the generator star token of the given function node. * * @param {ASTNode} node - The function node to get. * @returns {Token} Found star token. */ function getStarToken(node) { return sourceCode.getFirstToken(node.parent.method || node.parent.type === "MethodDefinition" ? node.parent : node, isStarToken); } /** * Checks the spacing between two tokens before or after the star token. * @param {string} side Either "before" or "after". * @param {Token} leftToken `function` keyword token if side is "before", or * star token if side is "after". * @param {Token} rightToken Star token if side is "before", or identifier * token if side is "after". * @returns {void} */ function checkSpacing(side, leftToken, rightToken) { if (!!(rightToken.range[0] - leftToken.range[1]) !== mode[side]) { var after = leftToken.value === "*"; var spaceRequired = mode[side]; var node = after ? leftToken : rightToken; var type = spaceRequired ? "Missing" : "Unexpected"; var message = "{{type}} space {{side}} *."; var data = { type: type, side: side }; context.report({ node: node, message: message, data: data, fix: function fix(fixer) { if (spaceRequired) { if (after) { return fixer.insertTextAfter(node, " "); } return fixer.insertTextBefore(node, " "); } return fixer.removeRange([leftToken.range[1], rightToken.range[0]]); } }); } } /** * Enforces the spacing around the star if node is a generator function. * @param {ASTNode} node A function expression or declaration node. * @returns {void} */ function checkFunction(node) { if (!node.generator) { return; } var starToken = getStarToken(node); // Only check before when preceded by `function`|`static` keyword var prevToken = sourceCode.getTokenBefore(starToken); if (prevToken.value === "function" || prevToken.value === "static") { checkSpacing("before", prevToken, starToken); } var nextToken = sourceCode.getTokenAfter(starToken); checkSpacing("after", starToken, nextToken); } return { FunctionDeclaration: checkFunction, FunctionExpression: checkFunction }; } }; },{}],117:[function(require,module,exports){ /** * @fileoverview Rule for disallowing require() outside of the top-level module context * @author Jamund Ferguson */ "use strict"; var ACCEPTABLE_PARENTS = ["AssignmentExpression", "VariableDeclarator", "MemberExpression", "ExpressionStatement", "CallExpression", "ConditionalExpression", "Program", "VariableDeclaration"]; /** * Finds the eslint-scope reference in the given scope. * @param {Object} scope The scope to search. * @param {ASTNode} node The identifier node. * @returns {Reference|null} Returns the found reference or null if none were found. */ function findReference(scope, node) { var references = scope.references.filter(function (reference) { return reference.identifier.range[0] === node.range[0] && reference.identifier.range[1] === node.range[1]; }); /* istanbul ignore else: correctly returns null */ if (references.length === 1) { return references[0]; } return null; } /** * Checks if the given identifier node is shadowed in the given scope. * @param {Object} scope The current scope. * @param {ASTNode} node The identifier node to check. * @returns {boolean} Whether or not the name is shadowed. */ function isShadowed(scope, node) { var reference = findReference(scope, node); return reference && reference.resolved && reference.resolved.defs.length > 0; } module.exports = { meta: { docs: { description: "require `require()` calls to be placed at top-level module scope", category: "Node.js and CommonJS", recommended: false }, schema: [] }, create: function create(context) { return { CallExpression: function CallExpression(node) { var currentScope = context.getScope(); if (node.callee.name === "require" && !isShadowed(currentScope, node.callee)) { var isGoodRequire = context.getAncestors().every(function (parent) { return ACCEPTABLE_PARENTS.indexOf(parent.type) > -1; }); if (!isGoodRequire) { context.report({ node: node, message: "Unexpected require()." }); } } } }; } }; },{}],118:[function(require,module,exports){ /** * @fileoverview Rule to flag for-in loops without if statements inside * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require `for-in` loops to include an `if` statement", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { return { ForInStatement: function ForInStatement(node) { /* * If the for-in statement has {}, then the real body is the body * of the BlockStatement. Otherwise, just use body as provided. */ var body = node.body.type === "BlockStatement" ? node.body.body[0] : node.body; if (body && body.type !== "IfStatement") { context.report({ node: node, message: "The body of a for-in should be wrapped in an if statement to filter unwanted properties from the prototype." }); } } }; } }; },{}],119:[function(require,module,exports){ /** * @fileoverview Ensure handling of errors when we know they exist. * @author Jamund Ferguson */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require error handling in callbacks", category: "Node.js and CommonJS", recommended: false }, schema: [{ type: "string" }] }, create: function create(context) { var errorArgument = context.options[0] || "err"; /** * Checks if the given argument should be interpreted as a regexp pattern. * @param {string} stringToCheck The string which should be checked. * @returns {boolean} Whether or not the string should be interpreted as a pattern. */ function isPattern(stringToCheck) { var firstChar = stringToCheck[0]; return firstChar === "^"; } /** * Checks if the given name matches the configured error argument. * @param {string} name The name which should be compared. * @returns {boolean} Whether or not the given name matches the configured error variable name. */ function matchesConfiguredErrorName(name) { if (isPattern(errorArgument)) { var regexp = new RegExp(errorArgument); return regexp.test(name); } return name === errorArgument; } /** * Get the parameters of a given function scope. * @param {Object} scope The function scope. * @returns {array} All parameters of the given scope. */ function getParameters(scope) { return scope.variables.filter(function (variable) { return variable.defs[0] && variable.defs[0].type === "Parameter"; }); } /** * Check to see if we're handling the error object properly. * @param {ASTNode} node The AST node to check. * @returns {void} */ function checkForError(node) { var scope = context.getScope(), parameters = getParameters(scope), firstParameter = parameters[0]; if (firstParameter && matchesConfiguredErrorName(firstParameter.name)) { if (firstParameter.references.length === 0) { context.report({ node: node, message: "Expected error to be handled." }); } } } return { FunctionDeclaration: checkForError, FunctionExpression: checkForError, ArrowFunctionExpression: checkForError }; } }; },{}],120:[function(require,module,exports){ /** * @fileoverview Rule that warns when identifier names that are * blacklisted in the configuration are used. * @author Keith Cirkel (http://keithcirkel.co.uk) */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow specified identifiers", category: "Stylistic Issues", recommended: false }, schema: { type: "array", items: { type: "string" }, uniqueItems: true } }, create: function create(context) { //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- var blacklist = context.options; /** * Checks if a string matches the provided pattern * @param {string} name The string to check. * @returns {boolean} if the string is a match * @private */ function isInvalid(name) { return blacklist.indexOf(name) !== -1; } /** * Verifies if we should report an error or not based on the effective * parent node and the identifier name. * @param {ASTNode} effectiveParent The effective parent node of the node to be reported * @param {string} name The identifier name of the identifier node * @returns {boolean} whether an error should be reported or not */ function shouldReport(effectiveParent, name) { return effectiveParent.type !== "CallExpression" && effectiveParent.type !== "NewExpression" && isInvalid(name); } /** * Reports an AST node as a rule violation. * @param {ASTNode} node The node to report. * @returns {void} * @private */ function report(node) { context.report({ node: node, message: "Identifier '{{name}}' is blacklisted.", data: { name: node.name } }); } return { Identifier: function Identifier(node) { var name = node.name, effectiveParent = node.parent.type === "MemberExpression" ? node.parent.parent : node.parent; // MemberExpressions get special rules if (node.parent.type === "MemberExpression") { // Always check object names if (node.parent.object.type === "Identifier" && node.parent.object.name === node.name) { if (isInvalid(name)) { report(node); } // Report AssignmentExpressions only if they are the left side of the assignment } else if (effectiveParent.type === "AssignmentExpression" && (effectiveParent.right.type !== "MemberExpression" || effectiveParent.left.type === "MemberExpression" && effectiveParent.left.property.name === node.name)) { if (isInvalid(name)) { report(node); } } // Properties have their own rules } else if (node.parent.type === "Property") { if (shouldReport(effectiveParent, name)) { report(node); } // Report anything that is a match and not a CallExpression } else if (shouldReport(effectiveParent, name)) { report(node); } } }; } }; },{}],121:[function(require,module,exports){ /** * @fileoverview Rule that warns when identifier names are shorter or longer * than the values provided in configuration. * @author Burak Yigit Kaya aka BYK */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce minimum and maximum identifier lengths", category: "Stylistic Issues", recommended: false }, schema: [{ type: "object", properties: { min: { type: "number" }, max: { type: "number" }, exceptions: { type: "array", uniqueItems: true, items: { type: "string" } }, properties: { enum: ["always", "never"] } }, additionalProperties: false }] }, create: function create(context) { var options = context.options[0] || {}; var minLength = typeof options.min !== "undefined" ? options.min : 2; var maxLength = typeof options.max !== "undefined" ? options.max : Infinity; var properties = options.properties !== "never"; var exceptions = (options.exceptions ? options.exceptions : []).reduce(function (obj, item) { obj[item] = true; return obj; }, {}); var SUPPORTED_EXPRESSIONS = { MemberExpression: properties && function (parent) { return !parent.computed && ( // regular property assignment parent.parent.left === parent && parent.parent.type === "AssignmentExpression" || // or the last identifier in an ObjectPattern destructuring parent.parent.type === "Property" && parent.parent.value === parent && parent.parent.parent.type === "ObjectPattern" && parent.parent.parent.parent.left === parent.parent.parent); }, AssignmentPattern: function AssignmentPattern(parent, node) { return parent.left === node; }, VariableDeclarator: function VariableDeclarator(parent, node) { return parent.id === node; }, Property: properties && function (parent, node) { return parent.key === node; }, ImportDefaultSpecifier: true, RestElement: true, FunctionExpression: true, ArrowFunctionExpression: true, ClassDeclaration: true, FunctionDeclaration: true, MethodDefinition: true, CatchClause: true }; return { Identifier: function Identifier(node) { var name = node.name; var parent = node.parent; var isShort = name.length < minLength; var isLong = name.length > maxLength; if (!(isShort || isLong) || exceptions[name]) { return; // Nothing to report } var isValidExpression = SUPPORTED_EXPRESSIONS[parent.type]; if (isValidExpression && (isValidExpression === true || isValidExpression(parent, node))) { context.report({ node: node, message: isShort ? "Identifier name '{{name}}' is too short (< {{min}})." : "Identifier name '{{name}}' is too long (> {{max}}).", data: { name: name, min: minLength, max: maxLength } }); } } }; } }; },{}],122:[function(require,module,exports){ /** * @fileoverview Rule to flag non-matching identifiers * @author Matthieu Larcher */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require identifiers to match a specified regular expression", category: "Stylistic Issues", recommended: false }, schema: [{ type: "string" }, { type: "object", properties: { properties: { type: "boolean" } } }] }, create: function create(context) { //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- var pattern = context.options[0] || "^.+$", regexp = new RegExp(pattern); var options = context.options[1] || {}, properties = !!options.properties, onlyDeclarations = !!options.onlyDeclarations; /** * Checks if a string matches the provided pattern * @param {string} name The string to check. * @returns {boolean} if the string is a match * @private */ function isInvalid(name) { return !regexp.test(name); } /** * Verifies if we should report an error or not based on the effective * parent node and the identifier name. * @param {ASTNode} effectiveParent The effective parent node of the node to be reported * @param {string} name The identifier name of the identifier node * @returns {boolean} whether an error should be reported or not */ function shouldReport(effectiveParent, name) { return effectiveParent.type !== "CallExpression" && effectiveParent.type !== "NewExpression" && isInvalid(name); } /** * Reports an AST node as a rule violation. * @param {ASTNode} node The node to report. * @returns {void} * @private */ function report(node) { context.report({ node: node, message: "Identifier '{{name}}' does not match the pattern '{{pattern}}'.", data: { name: node.name, pattern: pattern } }); } return { Identifier: function Identifier(node) { var name = node.name, parent = node.parent, effectiveParent = parent.type === "MemberExpression" ? parent.parent : parent; if (parent.type === "MemberExpression") { if (!properties) { return; } // Always check object names if (parent.object.type === "Identifier" && parent.object.name === name) { if (isInvalid(name)) { report(node); } // Report AssignmentExpressions only if they are the left side of the assignment } else if (effectiveParent.type === "AssignmentExpression" && (effectiveParent.right.type !== "MemberExpression" || effectiveParent.left.type === "MemberExpression" && effectiveParent.left.property.name === name)) { if (isInvalid(name)) { report(node); } } } else if (parent.type === "Property") { if (!properties || parent.key.name !== name) { return; } if (shouldReport(effectiveParent, name)) { report(node); } } else { var isDeclaration = effectiveParent.type === "FunctionDeclaration" || effectiveParent.type === "VariableDeclarator"; if (onlyDeclarations && !isDeclaration) { return; } if (shouldReport(effectiveParent, name)) { report(node); } } } }; } }; },{}],123:[function(require,module,exports){ /** * @fileoverview This option sets a specific tab width for your code * * This rule has been ported and modified from nodeca. * @author Vitaly Puzrin * @author Gyandeep Singh */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ /* istanbul ignore next: this rule has known coverage issues, but it's deprecated and shouldn't be updated in the future anyway. */ module.exports = { meta: { docs: { description: "enforce consistent indentation", category: "Stylistic Issues", recommended: false, replacedBy: ["indent"] }, deprecated: true, fixable: "whitespace", schema: [{ oneOf: [{ enum: ["tab"] }, { type: "integer", minimum: 0 }] }, { type: "object", properties: { SwitchCase: { type: "integer", minimum: 0 }, VariableDeclarator: { oneOf: [{ type: "integer", minimum: 0 }, { type: "object", properties: { var: { type: "integer", minimum: 0 }, let: { type: "integer", minimum: 0 }, const: { type: "integer", minimum: 0 } } }] }, outerIIFEBody: { type: "integer", minimum: 0 }, MemberExpression: { type: "integer", minimum: 0 }, FunctionDeclaration: { type: "object", properties: { parameters: { oneOf: [{ type: "integer", minimum: 0 }, { enum: ["first"] }] }, body: { type: "integer", minimum: 0 } } }, FunctionExpression: { type: "object", properties: { parameters: { oneOf: [{ type: "integer", minimum: 0 }, { enum: ["first"] }] }, body: { type: "integer", minimum: 0 } } }, CallExpression: { type: "object", properties: { parameters: { oneOf: [{ type: "integer", minimum: 0 }, { enum: ["first"] }] } } }, ArrayExpression: { oneOf: [{ type: "integer", minimum: 0 }, { enum: ["first"] }] }, ObjectExpression: { oneOf: [{ type: "integer", minimum: 0 }, { enum: ["first"] }] } }, additionalProperties: false }] }, create: function create(context) { var DEFAULT_VARIABLE_INDENT = 1; var DEFAULT_PARAMETER_INDENT = null; // For backwards compatibility, don't check parameter indentation unless specified in the config var DEFAULT_FUNCTION_BODY_INDENT = 1; var indentType = "space"; var indentSize = 4; var options = { SwitchCase: 0, VariableDeclarator: { var: DEFAULT_VARIABLE_INDENT, let: DEFAULT_VARIABLE_INDENT, const: DEFAULT_VARIABLE_INDENT }, outerIIFEBody: null, FunctionDeclaration: { parameters: DEFAULT_PARAMETER_INDENT, body: DEFAULT_FUNCTION_BODY_INDENT }, FunctionExpression: { parameters: DEFAULT_PARAMETER_INDENT, body: DEFAULT_FUNCTION_BODY_INDENT }, CallExpression: { arguments: DEFAULT_PARAMETER_INDENT }, ArrayExpression: 1, ObjectExpression: 1 }; var sourceCode = context.getSourceCode(); if (context.options.length) { if (context.options[0] === "tab") { indentSize = 1; indentType = "tab"; } else /* istanbul ignore else : this will be caught by options validation */if (typeof context.options[0] === "number") { indentSize = context.options[0]; indentType = "space"; } if (context.options[1]) { var opts = context.options[1]; options.SwitchCase = opts.SwitchCase || 0; var variableDeclaratorRules = opts.VariableDeclarator; if (typeof variableDeclaratorRules === "number") { options.VariableDeclarator = { var: variableDeclaratorRules, let: variableDeclaratorRules, const: variableDeclaratorRules }; } else if ((typeof variableDeclaratorRules === "undefined" ? "undefined" : _typeof(variableDeclaratorRules)) === "object") { Object.assign(options.VariableDeclarator, variableDeclaratorRules); } if (typeof opts.outerIIFEBody === "number") { options.outerIIFEBody = opts.outerIIFEBody; } if (typeof opts.MemberExpression === "number") { options.MemberExpression = opts.MemberExpression; } if (_typeof(opts.FunctionDeclaration) === "object") { Object.assign(options.FunctionDeclaration, opts.FunctionDeclaration); } if (_typeof(opts.FunctionExpression) === "object") { Object.assign(options.FunctionExpression, opts.FunctionExpression); } if (_typeof(opts.CallExpression) === "object") { Object.assign(options.CallExpression, opts.CallExpression); } if (typeof opts.ArrayExpression === "number" || typeof opts.ArrayExpression === "string") { options.ArrayExpression = opts.ArrayExpression; } if (typeof opts.ObjectExpression === "number" || typeof opts.ObjectExpression === "string") { options.ObjectExpression = opts.ObjectExpression; } } } var caseIndentStore = {}; /** * Creates an error message for a line, given the expected/actual indentation. * @param {int} expectedAmount The expected amount of indentation characters for this line * @param {int} actualSpaces The actual number of indentation spaces that were found on this line * @param {int} actualTabs The actual number of indentation tabs that were found on this line * @returns {string} An error message for this line */ function createErrorMessage(expectedAmount, actualSpaces, actualTabs) { var expectedStatement = expectedAmount + " " + indentType + (expectedAmount === 1 ? "" : "s"); // e.g. "2 tabs" var foundSpacesWord = "space" + (actualSpaces === 1 ? "" : "s"); // e.g. "space" var foundTabsWord = "tab" + (actualTabs === 1 ? "" : "s"); // e.g. "tabs" var foundStatement = void 0; if (actualSpaces > 0 && actualTabs > 0) { foundStatement = actualSpaces + " " + foundSpacesWord + " and " + actualTabs + " " + foundTabsWord; // e.g. "1 space and 2 tabs" } else if (actualSpaces > 0) { // Abbreviate the message if the expected indentation is also spaces. // e.g. 'Expected 4 spaces but found 2' rather than 'Expected 4 spaces but found 2 spaces' foundStatement = indentType === "space" ? actualSpaces : actualSpaces + " " + foundSpacesWord; } else if (actualTabs > 0) { foundStatement = indentType === "tab" ? actualTabs : actualTabs + " " + foundTabsWord; } else { foundStatement = "0"; } return "Expected indentation of " + expectedStatement + " but found " + foundStatement + "."; } /** * Reports a given indent violation * @param {ASTNode} node Node violating the indent rule * @param {int} needed Expected indentation character count * @param {int} gottenSpaces Indentation space count in the actual node/code * @param {int} gottenTabs Indentation tab count in the actual node/code * @param {Object=} loc Error line and column location * @param {boolean} isLastNodeCheck Is the error for last node check * @param {int} lastNodeCheckEndOffset Number of charecters to skip from the end * @returns {void} */ function report(node, needed, gottenSpaces, gottenTabs, loc, isLastNodeCheck) { if (gottenSpaces && gottenTabs) { // To avoid conflicts with `no-mixed-spaces-and-tabs`, don't report lines that have both spaces and tabs. return; } var desiredIndent = (indentType === "space" ? " " : "\t").repeat(needed); var textRange = isLastNodeCheck ? [node.range[1] - node.loc.end.column, node.range[1] - node.loc.end.column + gottenSpaces + gottenTabs] : [node.range[0] - node.loc.start.column, node.range[0] - node.loc.start.column + gottenSpaces + gottenTabs]; context.report({ node: node, loc: loc, message: createErrorMessage(needed, gottenSpaces, gottenTabs), fix: function fix(fixer) { return fixer.replaceTextRange(textRange, desiredIndent); } }); } /** * Get the actual indent of node * @param {ASTNode|Token} node Node to examine * @param {boolean} [byLastLine=false] get indent of node's last line * @returns {Object} The node's indent. Contains keys `space` and `tab`, representing the indent of each character. Also contains keys `goodChar` and `badChar`, where `goodChar` is the amount of the user's desired indentation character, and `badChar` is the amount of the other indentation character. */ function getNodeIndent(node, byLastLine) { var token = byLastLine ? sourceCode.getLastToken(node) : sourceCode.getFirstToken(node); var srcCharsBeforeNode = sourceCode.getText(token, token.loc.start.column).split(""); var indentChars = srcCharsBeforeNode.slice(0, srcCharsBeforeNode.findIndex(function (char) { return char !== " " && char !== "\t"; })); var spaces = indentChars.filter(function (char) { return char === " "; }).length; var tabs = indentChars.filter(function (char) { return char === "\t"; }).length; return { space: spaces, tab: tabs, goodChar: indentType === "space" ? spaces : tabs, badChar: indentType === "space" ? tabs : spaces }; } /** * Checks node is the first in its own start line. By default it looks by start line. * @param {ASTNode} node The node to check * @param {boolean} [byEndLocation=false] Lookup based on start position or end * @returns {boolean} true if its the first in the its start line */ function isNodeFirstInLine(node, byEndLocation) { var firstToken = byEndLocation === true ? sourceCode.getLastToken(node, 1) : sourceCode.getTokenBefore(node), startLine = byEndLocation === true ? node.loc.end.line : node.loc.start.line, endLine = firstToken ? firstToken.loc.end.line : -1; return startLine !== endLine; } /** * Check indent for node * @param {ASTNode} node Node to check * @param {int} neededIndent needed indent * @param {boolean} [excludeCommas=false] skip comma on start of line * @returns {void} */ function checkNodeIndent(node, neededIndent) { var actualIndent = getNodeIndent(node, false); if (node.type !== "ArrayExpression" && node.type !== "ObjectExpression" && (actualIndent.goodChar !== neededIndent || actualIndent.badChar !== 0) && isNodeFirstInLine(node)) { report(node, neededIndent, actualIndent.space, actualIndent.tab); } if (node.type === "IfStatement" && node.alternate) { var elseToken = sourceCode.getTokenBefore(node.alternate); checkNodeIndent(elseToken, neededIndent); if (!isNodeFirstInLine(node.alternate)) { checkNodeIndent(node.alternate, neededIndent); } } if (node.type === "TryStatement" && node.handler) { var catchToken = sourceCode.getFirstToken(node.handler); checkNodeIndent(catchToken, neededIndent); } if (node.type === "TryStatement" && node.finalizer) { var finallyToken = sourceCode.getTokenBefore(node.finalizer); checkNodeIndent(finallyToken, neededIndent); } if (node.type === "DoWhileStatement") { var whileToken = sourceCode.getTokenAfter(node.body); checkNodeIndent(whileToken, neededIndent); } } /** * Check indent for nodes list * @param {ASTNode[]} nodes list of node objects * @param {int} indent needed indent * @param {boolean} [excludeCommas=false] skip comma on start of line * @returns {void} */ function checkNodesIndent(nodes, indent) { nodes.forEach(function (node) { return checkNodeIndent(node, indent); }); } /** * Check last node line indent this detects, that block closed correctly * @param {ASTNode} node Node to examine * @param {int} lastLineIndent needed indent * @returns {void} */ function checkLastNodeLineIndent(node, lastLineIndent) { var lastToken = sourceCode.getLastToken(node); var endIndent = getNodeIndent(lastToken, true); if ((endIndent.goodChar !== lastLineIndent || endIndent.badChar !== 0) && isNodeFirstInLine(node, true)) { report(node, lastLineIndent, endIndent.space, endIndent.tab, { line: lastToken.loc.start.line, column: lastToken.loc.start.column }, true); } } /** * Check last node line indent this detects, that block closed correctly * This function for more complicated return statement case, where closing parenthesis may be followed by ';' * @param {ASTNode} node Node to examine * @param {int} firstLineIndent first line needed indent * @returns {void} */ function checkLastReturnStatementLineIndent(node, firstLineIndent) { // in case if return statement ends with ');' we have traverse back to ')' // otherwise we'll measure indent for ';' and replace ')' var lastToken = sourceCode.getLastToken(node, astUtils.isClosingParenToken); var textBeforeClosingParenthesis = sourceCode.getText(lastToken, lastToken.loc.start.column).slice(0, -1); if (textBeforeClosingParenthesis.trim()) { // There are tokens before the closing paren, don't report this case return; } var endIndent = getNodeIndent(lastToken, true); if (endIndent.goodChar !== firstLineIndent) { report(node, firstLineIndent, endIndent.space, endIndent.tab, { line: lastToken.loc.start.line, column: lastToken.loc.start.column }, true); } } /** * Check first node line indent is correct * @param {ASTNode} node Node to examine * @param {int} firstLineIndent needed indent * @returns {void} */ function checkFirstNodeLineIndent(node, firstLineIndent) { var startIndent = getNodeIndent(node, false); if ((startIndent.goodChar !== firstLineIndent || startIndent.badChar !== 0) && isNodeFirstInLine(node)) { report(node, firstLineIndent, startIndent.space, startIndent.tab, { line: node.loc.start.line, column: node.loc.start.column }); } } /** * Returns a parent node of given node based on a specified type * if not present then return null * @param {ASTNode} node node to examine * @param {string} type type that is being looked for * @param {string} stopAtList end points for the evaluating code * @returns {ASTNode|void} if found then node otherwise null */ function getParentNodeByType(node, type, stopAtList) { var parent = node.parent; if (!stopAtList) { stopAtList = ["Program"]; } while (parent.type !== type && stopAtList.indexOf(parent.type) === -1 && parent.type !== "Program") { parent = parent.parent; } return parent.type === type ? parent : null; } /** * Returns the VariableDeclarator based on the current node * if not present then return null * @param {ASTNode} node node to examine * @returns {ASTNode|void} if found then node otherwise null */ function getVariableDeclaratorNode(node) { return getParentNodeByType(node, "VariableDeclarator"); } /** * Check to see if the node is part of the multi-line variable declaration. * Also if its on the same line as the varNode * @param {ASTNode} node node to check * @param {ASTNode} varNode variable declaration node to check against * @returns {boolean} True if all the above condition satisfy */ function isNodeInVarOnTop(node, varNode) { return varNode && varNode.parent.loc.start.line === node.loc.start.line && varNode.parent.declarations.length > 1; } /** * Check to see if the argument before the callee node is multi-line and * there should only be 1 argument before the callee node * @param {ASTNode} node node to check * @returns {boolean} True if arguments are multi-line */ function isArgBeforeCalleeNodeMultiline(node) { var parent = node.parent; if (parent.arguments.length >= 2 && parent.arguments[1] === node) { return parent.arguments[0].loc.end.line > parent.arguments[0].loc.start.line; } return false; } /** * Check to see if the node is a file level IIFE * @param {ASTNode} node The function node to check. * @returns {boolean} True if the node is the outer IIFE */ function isOuterIIFE(node) { var parent = node.parent; var stmt = parent.parent; /* * Verify that the node is an IIEF */ if (parent.type !== "CallExpression" || parent.callee !== node) { return false; } /* * Navigate legal ancestors to determine whether this IIEF is outer */ while (stmt.type === "UnaryExpression" && (stmt.operator === "!" || stmt.operator === "~" || stmt.operator === "+" || stmt.operator === "-") || stmt.type === "AssignmentExpression" || stmt.type === "LogicalExpression" || stmt.type === "SequenceExpression" || stmt.type === "VariableDeclarator") { stmt = stmt.parent; } return (stmt.type === "ExpressionStatement" || stmt.type === "VariableDeclaration") && stmt.parent && stmt.parent.type === "Program"; } /** * Check indent for function block content * @param {ASTNode} node A BlockStatement node that is inside of a function. * @returns {void} */ function checkIndentInFunctionBlock(node) { /* * Search first caller in chain. * Ex.: * * Models <- Identifier * .User * .find() * .exec(function() { * // function body * }); * * Looks for 'Models' */ var calleeNode = node.parent; // FunctionExpression var indent = void 0; if (calleeNode.parent && (calleeNode.parent.type === "Property" || calleeNode.parent.type === "ArrayExpression")) { // If function is part of array or object, comma can be put at left indent = getNodeIndent(calleeNode, false).goodChar; } else { // If function is standalone, simple calculate indent indent = getNodeIndent(calleeNode).goodChar; } if (calleeNode.parent.type === "CallExpression") { var calleeParent = calleeNode.parent; if (calleeNode.type !== "FunctionExpression" && calleeNode.type !== "ArrowFunctionExpression") { if (calleeParent && calleeParent.loc.start.line < node.loc.start.line) { indent = getNodeIndent(calleeParent).goodChar; } } else { if (isArgBeforeCalleeNodeMultiline(calleeNode) && calleeParent.callee.loc.start.line === calleeParent.callee.loc.end.line && !isNodeFirstInLine(calleeNode)) { indent = getNodeIndent(calleeParent).goodChar; } } } // function body indent should be indent + indent size, unless this // is a FunctionDeclaration, FunctionExpression, or outer IIFE and the corresponding options are enabled. var functionOffset = indentSize; if (options.outerIIFEBody !== null && isOuterIIFE(calleeNode)) { functionOffset = options.outerIIFEBody * indentSize; } else if (calleeNode.type === "FunctionExpression") { functionOffset = options.FunctionExpression.body * indentSize; } else if (calleeNode.type === "FunctionDeclaration") { functionOffset = options.FunctionDeclaration.body * indentSize; } indent += functionOffset; // check if the node is inside a variable var parentVarNode = getVariableDeclaratorNode(node); if (parentVarNode && isNodeInVarOnTop(node, parentVarNode)) { indent += indentSize * options.VariableDeclarator[parentVarNode.parent.kind]; } if (node.body.length > 0) { checkNodesIndent(node.body, indent); } checkLastNodeLineIndent(node, indent - functionOffset); } /** * Checks if the given node starts and ends on the same line * @param {ASTNode} node The node to check * @returns {boolean} Whether or not the block starts and ends on the same line. */ function isSingleLineNode(node) { var lastToken = sourceCode.getLastToken(node), startLine = node.loc.start.line, endLine = lastToken.loc.end.line; return startLine === endLine; } /** * Check to see if the first element inside an array is an object and on the same line as the node * If the node is not an array then it will return false. * @param {ASTNode} node node to check * @returns {boolean} success/failure */ function isFirstArrayElementOnSameLine(node) { if (node.type === "ArrayExpression" && node.elements[0]) { return node.elements[0].loc.start.line === node.loc.start.line && node.elements[0].type === "ObjectExpression"; } return false; } /** * Check indent for array block content or object block content * @param {ASTNode} node node to examine * @returns {void} */ function checkIndentInArrayOrObjectBlock(node) { // Skip inline if (isSingleLineNode(node)) { return; } var elements = node.type === "ArrayExpression" ? node.elements : node.properties; // filter out empty elements example would be [ , 2] so remove first element as espree considers it as null elements = elements.filter(function (elem) { return elem !== null; }); var nodeIndent = void 0; var elementsIndent = void 0; var parentVarNode = getVariableDeclaratorNode(node); // TODO - come up with a better strategy in future if (isNodeFirstInLine(node)) { var parent = node.parent; nodeIndent = getNodeIndent(parent).goodChar; if (!parentVarNode || parentVarNode.loc.start.line !== node.loc.start.line) { if (parent.type !== "VariableDeclarator" || parentVarNode === parentVarNode.parent.declarations[0]) { if (parent.type === "VariableDeclarator" && parentVarNode.loc.start.line === parent.loc.start.line) { nodeIndent = nodeIndent + indentSize * options.VariableDeclarator[parentVarNode.parent.kind]; } else if (parent.type === "ObjectExpression" || parent.type === "ArrayExpression") { var parentElements = node.parent.type === "ObjectExpression" ? node.parent.properties : node.parent.elements; if (parentElements[0] && parentElements[0].loc.start.line === parent.loc.start.line && parentElements[0].loc.end.line !== parent.loc.start.line) { /* * If the first element of the array spans multiple lines, don't increase the expected indentation of the rest. * e.g. [{ * foo: 1 * }, * { * bar: 1 * }] * the second object is not indented. */ } else if (typeof options[parent.type] === "number") { nodeIndent += options[parent.type] * indentSize; } else { nodeIndent = parentElements[0].loc.start.column; } } else if (parent.type === "CallExpression" || parent.type === "NewExpression") { if (typeof options.CallExpression.arguments === "number") { nodeIndent += options.CallExpression.arguments * indentSize; } else if (options.CallExpression.arguments === "first") { if (parent.arguments.indexOf(node) !== -1) { nodeIndent = parent.arguments[0].loc.start.column; } } else { nodeIndent += indentSize; } } else if (parent.type === "LogicalExpression" || parent.type === "ArrowFunctionExpression") { nodeIndent += indentSize; } } } else if (!parentVarNode && !isFirstArrayElementOnSameLine(parent) && parent.type !== "MemberExpression" && parent.type !== "ExpressionStatement" && parent.type !== "AssignmentExpression" && parent.type !== "Property") { nodeIndent = nodeIndent + indentSize; } checkFirstNodeLineIndent(node, nodeIndent); } else { nodeIndent = getNodeIndent(node).goodChar; } if (options[node.type] === "first") { elementsIndent = elements.length ? elements[0].loc.start.column : 0; // If there are no elements, elementsIndent doesn't matter. } else { elementsIndent = nodeIndent + indentSize * options[node.type]; } /* * Check if the node is a multiple variable declaration; if so, then * make sure indentation takes that into account. */ if (isNodeInVarOnTop(node, parentVarNode)) { elementsIndent += indentSize * options.VariableDeclarator[parentVarNode.parent.kind]; } checkNodesIndent(elements, elementsIndent); if (elements.length > 0) { // Skip last block line check if last item in same line if (elements[elements.length - 1].loc.end.line === node.loc.end.line) { return; } } checkLastNodeLineIndent(node, nodeIndent + (isNodeInVarOnTop(node, parentVarNode) ? options.VariableDeclarator[parentVarNode.parent.kind] * indentSize : 0)); } /** * Check if the node or node body is a BlockStatement or not * @param {ASTNode} node node to test * @returns {boolean} True if it or its body is a block statement */ function isNodeBodyBlock(node) { return node.type === "BlockStatement" || node.type === "ClassBody" || node.body && node.body.type === "BlockStatement" || node.consequent && node.consequent.type === "BlockStatement"; } /** * Check indentation for blocks * @param {ASTNode} node node to check * @returns {void} */ function blockIndentationCheck(node) { // Skip inline blocks if (isSingleLineNode(node)) { return; } if (node.parent && (node.parent.type === "FunctionExpression" || node.parent.type === "FunctionDeclaration" || node.parent.type === "ArrowFunctionExpression")) { checkIndentInFunctionBlock(node); return; } var indent = void 0; var nodesToCheck = []; /* * For this statements we should check indent from statement beginning, * not from the beginning of the block. */ var statementsWithProperties = ["IfStatement", "WhileStatement", "ForStatement", "ForInStatement", "ForOfStatement", "DoWhileStatement", "ClassDeclaration", "TryStatement"]; if (node.parent && statementsWithProperties.indexOf(node.parent.type) !== -1 && isNodeBodyBlock(node)) { indent = getNodeIndent(node.parent).goodChar; } else if (node.parent && node.parent.type === "CatchClause") { indent = getNodeIndent(node.parent.parent).goodChar; } else { indent = getNodeIndent(node).goodChar; } if (node.type === "IfStatement" && node.consequent.type !== "BlockStatement") { nodesToCheck = [node.consequent]; } else if (Array.isArray(node.body)) { nodesToCheck = node.body; } else { nodesToCheck = [node.body]; } if (nodesToCheck.length > 0) { checkNodesIndent(nodesToCheck, indent + indentSize); } if (node.type === "BlockStatement") { checkLastNodeLineIndent(node, indent); } } /** * Filter out the elements which are on the same line of each other or the node. * basically have only 1 elements from each line except the variable declaration line. * @param {ASTNode} node Variable declaration node * @returns {ASTNode[]} Filtered elements */ function filterOutSameLineVars(node) { return node.declarations.reduce(function (finalCollection, elem) { var lastElem = finalCollection[finalCollection.length - 1]; if (elem.loc.start.line !== node.loc.start.line && !lastElem || lastElem && lastElem.loc.start.line !== elem.loc.start.line) { finalCollection.push(elem); } return finalCollection; }, []); } /** * Check indentation for variable declarations * @param {ASTNode} node node to examine * @returns {void} */ function checkIndentInVariableDeclarations(node) { var elements = filterOutSameLineVars(node); var nodeIndent = getNodeIndent(node).goodChar; var lastElement = elements[elements.length - 1]; var elementsIndent = nodeIndent + indentSize * options.VariableDeclarator[node.kind]; checkNodesIndent(elements, elementsIndent); // Only check the last line if there is any token after the last item if (sourceCode.getLastToken(node).loc.end.line <= lastElement.loc.end.line) { return; } var tokenBeforeLastElement = sourceCode.getTokenBefore(lastElement); if (tokenBeforeLastElement.value === ",") { // Special case for comma-first syntax where the semicolon is indented checkLastNodeLineIndent(node, getNodeIndent(tokenBeforeLastElement).goodChar); } else { checkLastNodeLineIndent(node, elementsIndent - indentSize); } } /** * Check and decide whether to check for indentation for blockless nodes * Scenarios are for or while statements without braces around them * @param {ASTNode} node node to examine * @returns {void} */ function blockLessNodes(node) { if (node.body.type !== "BlockStatement") { blockIndentationCheck(node); } } /** * Returns the expected indentation for the case statement * @param {ASTNode} node node to examine * @param {int} [switchIndent] indent for switch statement * @returns {int} indent size */ function expectedCaseIndent(node, switchIndent) { var switchNode = node.type === "SwitchStatement" ? node : node.parent; var caseIndent = void 0; if (caseIndentStore[switchNode.loc.start.line]) { return caseIndentStore[switchNode.loc.start.line]; } if (typeof switchIndent === "undefined") { switchIndent = getNodeIndent(switchNode).goodChar; } if (switchNode.cases.length > 0 && options.SwitchCase === 0) { caseIndent = switchIndent; } else { caseIndent = switchIndent + indentSize * options.SwitchCase; } caseIndentStore[switchNode.loc.start.line] = caseIndent; return caseIndent; } /** * Checks wether a return statement is wrapped in () * @param {ASTNode} node node to examine * @returns {boolean} the result */ function isWrappedInParenthesis(node) { var regex = /^return\s*?\(\s*?\);*?/; var statementWithoutArgument = sourceCode.getText(node).replace(sourceCode.getText(node.argument), ""); return regex.test(statementWithoutArgument); } return { Program: function Program(node) { if (node.body.length > 0) { // Root nodes should have no indent checkNodesIndent(node.body, getNodeIndent(node).goodChar); } }, ClassBody: blockIndentationCheck, BlockStatement: blockIndentationCheck, WhileStatement: blockLessNodes, ForStatement: blockLessNodes, ForInStatement: blockLessNodes, ForOfStatement: blockLessNodes, DoWhileStatement: blockLessNodes, IfStatement: function IfStatement(node) { if (node.consequent.type !== "BlockStatement" && node.consequent.loc.start.line > node.loc.start.line) { blockIndentationCheck(node); } }, VariableDeclaration: function VariableDeclaration(node) { if (node.declarations[node.declarations.length - 1].loc.start.line > node.declarations[0].loc.start.line) { checkIndentInVariableDeclarations(node); } }, ObjectExpression: function ObjectExpression(node) { checkIndentInArrayOrObjectBlock(node); }, ArrayExpression: function ArrayExpression(node) { checkIndentInArrayOrObjectBlock(node); }, MemberExpression: function MemberExpression(node) { if (typeof options.MemberExpression === "undefined") { return; } if (isSingleLineNode(node)) { return; } // The typical layout of variable declarations and assignments // alter the expectation of correct indentation. Skip them. // TODO: Add appropriate configuration options for variable // declarations and assignments. if (getParentNodeByType(node, "VariableDeclarator", ["FunctionExpression", "ArrowFunctionExpression"])) { return; } if (getParentNodeByType(node, "AssignmentExpression", ["FunctionExpression"])) { return; } var propertyIndent = getNodeIndent(node).goodChar + indentSize * options.MemberExpression; var checkNodes = [node.property]; var dot = context.getTokenBefore(node.property); if (dot.type === "Punctuator" && dot.value === ".") { checkNodes.push(dot); } checkNodesIndent(checkNodes, propertyIndent); }, SwitchStatement: function SwitchStatement(node) { // Switch is not a 'BlockStatement' var switchIndent = getNodeIndent(node).goodChar; var caseIndent = expectedCaseIndent(node, switchIndent); checkNodesIndent(node.cases, caseIndent); checkLastNodeLineIndent(node, switchIndent); }, SwitchCase: function SwitchCase(node) { // Skip inline cases if (isSingleLineNode(node)) { return; } var caseIndent = expectedCaseIndent(node); checkNodesIndent(node.consequent, caseIndent + indentSize); }, FunctionDeclaration: function FunctionDeclaration(node) { if (isSingleLineNode(node)) { return; } if (options.FunctionDeclaration.parameters === "first" && node.params.length) { checkNodesIndent(node.params.slice(1), node.params[0].loc.start.column); } else if (options.FunctionDeclaration.parameters !== null) { checkNodesIndent(node.params, getNodeIndent(node).goodChar + indentSize * options.FunctionDeclaration.parameters); } }, FunctionExpression: function FunctionExpression(node) { if (isSingleLineNode(node)) { return; } if (options.FunctionExpression.parameters === "first" && node.params.length) { checkNodesIndent(node.params.slice(1), node.params[0].loc.start.column); } else if (options.FunctionExpression.parameters !== null) { checkNodesIndent(node.params, getNodeIndent(node).goodChar + indentSize * options.FunctionExpression.parameters); } }, ReturnStatement: function ReturnStatement(node) { if (isSingleLineNode(node)) { return; } var firstLineIndent = getNodeIndent(node).goodChar; // in case if return statement is wrapped in parenthesis if (isWrappedInParenthesis(node)) { checkLastReturnStatementLineIndent(node, firstLineIndent); } else { checkNodeIndent(node, firstLineIndent); } }, CallExpression: function CallExpression(node) { if (isSingleLineNode(node)) { return; } if (options.CallExpression.arguments === "first" && node.arguments.length) { checkNodesIndent(node.arguments.slice(1), node.arguments[0].loc.start.column); } else if (options.CallExpression.arguments !== null) { checkNodesIndent(node.arguments, getNodeIndent(node).goodChar + indentSize * options.CallExpression.arguments); } } }; } }; },{"../ast-utils":67}],124:[function(require,module,exports){ /** * @fileoverview This option sets a specific tab width for your code * * This rule has been ported and modified from nodeca. * @author Vitaly Puzrin * @author Gyandeep Singh */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } var lodash = require("lodash"); var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ var KNOWN_NODES = new Set(["AssignmentExpression", "AssignmentPattern", "ArrayExpression", "ArrayPattern", "ArrowFunctionExpression", "AwaitExpression", "BlockStatement", "BinaryExpression", "BreakStatement", "CallExpression", "CatchClause", "ClassBody", "ClassDeclaration", "ClassExpression", "ConditionalExpression", "ContinueStatement", "DoWhileStatement", "DebuggerStatement", "EmptyStatement", "ExperimentalRestProperty", "ExperimentalSpreadProperty", "ExpressionStatement", "ForStatement", "ForInStatement", "ForOfStatement", "FunctionDeclaration", "FunctionExpression", "Identifier", "IfStatement", "Literal", "LabeledStatement", "LogicalExpression", "MemberExpression", "MetaProperty", "MethodDefinition", "NewExpression", "ObjectExpression", "ObjectPattern", "Program", "Property", "RestElement", "ReturnStatement", "SequenceExpression", "SpreadElement", "Super", "SwitchCase", "SwitchStatement", "TaggedTemplateExpression", "TemplateElement", "TemplateLiteral", "ThisExpression", "ThrowStatement", "TryStatement", "UnaryExpression", "UpdateExpression", "VariableDeclaration", "VariableDeclarator", "WhileStatement", "WithStatement", "YieldExpression", "JSXIdentifier", "JSXNamespacedName", "JSXMemberExpression", "JSXEmptyExpression", "JSXExpressionContainer", "JSXElement", "JSXClosingElement", "JSXOpeningElement", "JSXAttribute", "JSXSpreadAttribute", "JSXText", "ExportDefaultDeclaration", "ExportNamedDeclaration", "ExportAllDeclaration", "ExportSpecifier", "ImportDeclaration", "ImportSpecifier", "ImportDefaultSpecifier", "ImportNamespaceSpecifier"]); /* * General rule strategy: * 1. An OffsetStorage instance stores a map of desired offsets, where each token has a specified offset from another * specified token or to the first column. * 2. As the AST is traversed, modify the desired offsets of tokens accordingly. For example, when entering a * BlockStatement, offset all of the tokens in the BlockStatement by 1 indent level from the opening curly * brace of the BlockStatement. * 3. After traversing the AST, calculate the expected indentation levels of every token according to the * OffsetStorage container. * 4. For each line, compare the expected indentation of the first token to the actual indentation in the file, * and report the token if the two values are not equal. */ /** * A helper class to get token-based info related to indentation */ var TokenInfo = function () { /** * @param {SourceCode} sourceCode A SourceCode object */ function TokenInfo(sourceCode) { _classCallCheck(this, TokenInfo); this.sourceCode = sourceCode; this.firstTokensByLineNumber = sourceCode.tokensAndComments.reduce(function (map, token) { if (!map.has(token.loc.start.line)) { map.set(token.loc.start.line, token); } if (!map.has(token.loc.end.line) && sourceCode.text.slice(token.range[1] - token.loc.end.column, token.range[1]).trim()) { map.set(token.loc.end.line, token); } return map; }, new Map()); } /** * Gets all tokens and comments * @returns {Token[]} A list of all tokens and comments */ _createClass(TokenInfo, [{ key: "getAllTokens", value: function getAllTokens() { return this.sourceCode.tokensAndComments; } /** * Gets the first token on a given token's line * @param {Token|ASTNode} token a node or token * @returns {Token} The first token on the given line */ }, { key: "getFirstTokenOfLine", value: function getFirstTokenOfLine(token) { return this.firstTokensByLineNumber.get(token.loc.start.line); } /** * Determines whether a token is the first token in its line * @param {Token} token The token * @returns {boolean} `true` if the token is the first on its line */ }, { key: "isFirstTokenOfLine", value: function isFirstTokenOfLine(token) { return this.getFirstTokenOfLine(token) === token; } /** * Get the actual indent of a token * @param {Token} token Token to examine. This should be the first token on its line. * @returns {string} The indentation characters that precede the token */ }, { key: "getTokenIndent", value: function getTokenIndent(token) { return this.sourceCode.text.slice(token.range[0] - token.loc.start.column, token.range[0]); } }]); return TokenInfo; }(); /** * A class to store information on desired offsets of tokens from each other */ var OffsetStorage = function () { /** * @param {TokenInfo} tokenInfo a TokenInfo instance * @param {string} indentType The desired type of indentation (either "space" or "tab") * @param {number} indentSize The desired size of each indentation level */ function OffsetStorage(tokenInfo, indentType, indentSize) { _classCallCheck(this, OffsetStorage); this.tokenInfo = tokenInfo; this.indentType = indentType; this.indentSize = indentSize; /* * desiredOffsets, lockedFirstTokens, and desiredIndentCache conceptually map tokens to something else. * However, they're implemented as objects with range indices as keys because this improves performance as of Node 7. * This uses the assumption that no two tokens start at the same index in the program. * * The values of the desiredOffsets map are objects with the schema { offset: number, from: Token|null }. * These objects should not be mutated or exposed outside of OffsetStorage. */ var NO_OFFSET = { offset: 0, from: null }; this.desiredOffsets = tokenInfo.getAllTokens().reduce(function (desiredOffsets, token) { desiredOffsets[token.range[0]] = NO_OFFSET; return desiredOffsets; }, Object.create(null)); this.lockedFirstTokens = Object.create(null); this.desiredIndentCache = Object.create(null); this.ignoredTokens = new WeakSet(); } /** * Sets the indent of one token to match the indent of another. * @param {Token} baseToken The first token * @param {Token} offsetToken The second token, whose indent should be matched to the first token * @returns {void} */ _createClass(OffsetStorage, [{ key: "matchIndentOf", value: function matchIndentOf(baseToken, offsetToken) { if (baseToken !== offsetToken) { this.desiredOffsets[offsetToken.range[0]] = { offset: 0, from: baseToken }; } } /** * Sets the offset column of token B to match the offset column of token A. * This is different from matchIndentOf because it matches a *column*, even if baseToken is not * the first token on its line. * @param {Token} baseToken The first token * @param {Token} offsetToken The second token, whose offset should be matched to the first token * @returns {void} */ }, { key: "matchOffsetOf", value: function matchOffsetOf(baseToken, offsetToken) { /* * lockedFirstTokens is a map from a token whose indentation is controlled by the "first" option to * the token that it depends on. For example, with the `ArrayExpression: first` option, the first * token of each element in the array after the first will be mapped to the first token of the first * element. The desired indentation of each of these tokens is computed based on the desired indentation * of the "first" element, rather than through the normal offset mechanism. */ this.lockedFirstTokens[offsetToken.range[0]] = baseToken; } /** * Sets the desired offset of a token * @param {Token} token The token * @param {Token} offsetFrom The token that this is offset from * @param {number} offset The desired indent level * @returns {void} */ }, { key: "setDesiredOffset", value: function setDesiredOffset(token, offsetFrom, offset) { if (offsetFrom && token.loc.start.line === offsetFrom.loc.start.line) { this.matchIndentOf(offsetFrom, token); } else { this.desiredOffsets[token.range[0]] = { offset: offset, from: offsetFrom }; } } /** * Sets the desired offset of multiple tokens * @param {Token[]} tokens A list of tokens. These tokens should be consecutive. * @param {Token} offsetFrom The token that this is offset from * @param {number} offset The desired indent level * @returns {void} */ }, { key: "setDesiredOffsets", value: function setDesiredOffsets(tokens, offsetFrom, offset) { var _this = this; /* * TODO: (not-an-aardvark) This function is the main performance holdup for this rule. It works * by setting the desired offset of each token to the given amount relative to the parent, but it's * frequently called with a large list of tokens, and it takes time to set the offset for each token * individually. Since the tokens are always consecutive, it might be possible to improve performance * here by changing the data structure used to store offsets (e.g. allowing a *range* of tokens to * be offset rather than offsetting each token individually). */ tokens.forEach(function (token) { return _this.setDesiredOffset(token, offsetFrom, offset); }); } /** * Gets the desired indent of a token * @param {Token} token The token * @returns {number} The desired indent of the token */ }, { key: "getDesiredIndent", value: function getDesiredIndent(token) { if (!(token.range[0] in this.desiredIndentCache)) { if (this.ignoredTokens.has(token)) { // If the token is ignored, use the actual indent of the token as the desired indent. // This ensures that no errors are reported for this token. this.desiredIndentCache[token.range[0]] = this.tokenInfo.getTokenIndent(token).length / this.indentSize; } else if (token.range[0] in this.lockedFirstTokens) { var firstToken = this.lockedFirstTokens[token.range[0]]; this.desiredIndentCache[token.range[0]] = // (indentation for the first element's line) this.getDesiredIndent(this.tokenInfo.getFirstTokenOfLine(firstToken)) + // (space between the start of the first element's line and the first element) (firstToken.loc.start.column - this.tokenInfo.getFirstTokenOfLine(firstToken).loc.start.column) / this.indentSize; } else { var offsetInfo = this.desiredOffsets[token.range[0]]; this.desiredIndentCache[token.range[0]] = offsetInfo.offset + (offsetInfo.from ? this.getDesiredIndent(offsetInfo.from) : 0); } } return this.desiredIndentCache[token.range[0]]; } /** * Ignores a token, preventing it from being reported. * @param {Token} token The token * @returns {void} */ }, { key: "ignoreToken", value: function ignoreToken(token) { if (this.tokenInfo.isFirstTokenOfLine(token)) { this.ignoredTokens.add(token); } } /** * Gets the first token that the given token's indentation is dependent on * @param {Token} token The token * @returns {Token} The token that the given token depends on, or `null` if the given token is at the top level */ }, { key: "getFirstDependency", value: function getFirstDependency(token) { return this.desiredOffsets[token.range[0]].from; } /** * Increases the offset for a token from its parent by the given amount * @param {Token} token The token whose offset should be increased * @param {number} amount The number of indent levels that the offset should increase by * @returns {void} */ }, { key: "increaseOffset", value: function increaseOffset(token, amount) { var currentOffsetInfo = this.desiredOffsets[token.range[0]]; this.desiredOffsets[token.range[0]] = { offset: currentOffsetInfo.offset + amount, from: currentOffsetInfo.from }; } }]); return OffsetStorage; }(); var ELEMENT_LIST_SCHEMA = { oneOf: [{ type: "integer", minimum: 0 }, { enum: ["first", "off"] }] }; module.exports = { meta: { docs: { description: "enforce consistent indentation", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ oneOf: [{ enum: ["tab"] }, { type: "integer", minimum: 0 }] }, { type: "object", properties: { SwitchCase: { type: "integer", minimum: 0 }, VariableDeclarator: { oneOf: [{ type: "integer", minimum: 0 }, { type: "object", properties: { var: { type: "integer", minimum: 0 }, let: { type: "integer", minimum: 0 }, const: { type: "integer", minimum: 0 } }, additionalProperties: false }] }, outerIIFEBody: { type: "integer", minimum: 0 }, MemberExpression: { oneOf: [{ type: "integer", minimum: 0 }, { enum: ["off"] }] }, FunctionDeclaration: { type: "object", properties: { parameters: ELEMENT_LIST_SCHEMA, body: { type: "integer", minimum: 0 } }, additionalProperties: false }, FunctionExpression: { type: "object", properties: { parameters: ELEMENT_LIST_SCHEMA, body: { type: "integer", minimum: 0 } }, additionalProperties: false }, CallExpression: { type: "object", properties: { arguments: ELEMENT_LIST_SCHEMA }, additionalProperties: false }, ArrayExpression: ELEMENT_LIST_SCHEMA, ObjectExpression: ELEMENT_LIST_SCHEMA, flatTernaryExpressions: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var DEFAULT_VARIABLE_INDENT = 1; var DEFAULT_PARAMETER_INDENT = 1; var DEFAULT_FUNCTION_BODY_INDENT = 1; var indentType = "space"; var indentSize = 4; var options = { SwitchCase: 0, VariableDeclarator: { var: DEFAULT_VARIABLE_INDENT, let: DEFAULT_VARIABLE_INDENT, const: DEFAULT_VARIABLE_INDENT }, outerIIFEBody: 1, FunctionDeclaration: { parameters: DEFAULT_PARAMETER_INDENT, body: DEFAULT_FUNCTION_BODY_INDENT }, FunctionExpression: { parameters: DEFAULT_PARAMETER_INDENT, body: DEFAULT_FUNCTION_BODY_INDENT }, CallExpression: { arguments: DEFAULT_PARAMETER_INDENT }, MemberExpression: 1, ArrayExpression: 1, ObjectExpression: 1, ArrayPattern: 1, ObjectPattern: 1, flatTernaryExpressions: false }; if (context.options.length) { if (context.options[0] === "tab") { indentSize = 1; indentType = "tab"; } else if (typeof context.options[0] === "number") { indentSize = context.options[0]; indentType = "space"; } if (context.options[1]) { lodash.merge(options, context.options[1]); if (typeof options.VariableDeclarator === "number") { options.VariableDeclarator = { var: options.VariableDeclarator, let: options.VariableDeclarator, const: options.VariableDeclarator }; } } } var sourceCode = context.getSourceCode(); var tokenInfo = new TokenInfo(sourceCode); var offsets = new OffsetStorage(tokenInfo, indentType, indentSize); var parameterParens = new WeakSet(); /** * Creates an error message for a line, given the expected/actual indentation. * @param {int} expectedAmount The expected amount of indentation characters for this line * @param {int} actualSpaces The actual number of indentation spaces that were found on this line * @param {int} actualTabs The actual number of indentation tabs that were found on this line * @returns {string} An error message for this line */ function createErrorMessage(expectedAmount, actualSpaces, actualTabs) { var expectedStatement = expectedAmount + " " + indentType + (expectedAmount === 1 ? "" : "s"); // e.g. "2 tabs" var foundSpacesWord = "space" + (actualSpaces === 1 ? "" : "s"); // e.g. "space" var foundTabsWord = "tab" + (actualTabs === 1 ? "" : "s"); // e.g. "tabs" var foundStatement = void 0; if (actualSpaces > 0) { // Abbreviate the message if the expected indentation is also spaces. // e.g. 'Expected 4 spaces but found 2' rather than 'Expected 4 spaces but found 2 spaces' foundStatement = indentType === "space" ? actualSpaces : actualSpaces + " " + foundSpacesWord; } else if (actualTabs > 0) { foundStatement = indentType === "tab" ? actualTabs : actualTabs + " " + foundTabsWord; } else { foundStatement = "0"; } return "Expected indentation of " + expectedStatement + " but found " + foundStatement + "."; } /** * Reports a given indent violation * @param {Token} token Node violating the indent rule * @param {int} neededIndentLevel Expected indentation level * @param {int} gottenSpaces Indentation space count in the actual node/code * @param {int} gottenTabs Indentation tab count in the actual node/code * @returns {void} */ function report(token, neededIndentLevel) { var actualIndent = Array.from(tokenInfo.getTokenIndent(token)); var numSpaces = actualIndent.filter(function (char) { return char === " "; }).length; var numTabs = actualIndent.filter(function (char) { return char === "\t"; }).length; var neededChars = neededIndentLevel * indentSize; context.report({ node: token, message: createErrorMessage(neededChars, numSpaces, numTabs), loc: { start: { line: token.loc.start.line, column: 0 }, end: { line: token.loc.start.line, column: token.loc.start.column } }, fix: function fix(fixer) { var range = [token.range[0] - token.loc.start.column, token.range[0]]; var newText = (indentType === "space" ? " " : "\t").repeat(neededChars); return fixer.replaceTextRange(range, newText); } }); } /** * Checks if a token's indentation is correct * @param {Token} token Token to examine * @param {int} desiredIndentLevel needed indent level * @returns {boolean} `true` if the token's indentation is correct */ function validateTokenIndent(token, desiredIndentLevel) { var indentation = tokenInfo.getTokenIndent(token); var expectedChar = indentType === "space" ? " " : "\t"; return indentation === expectedChar.repeat(desiredIndentLevel * indentSize) || // To avoid conflicts with no-mixed-spaces-and-tabs, don't report mixed spaces and tabs. indentation.includes(" ") && indentation.includes("\t"); } /** * Check to see if the node is a file level IIFE * @param {ASTNode} node The function node to check. * @returns {boolean} True if the node is the outer IIFE */ function isOuterIIFE(node) { /* * Verify that the node is an IIFE */ if (!node.parent || node.parent.type !== "CallExpression" || node.parent.callee !== node) { return false; } /* * Navigate legal ancestors to determine whether this IIFE is outer. * A "legal ancestor" is an expression or statement that causes the function to get executed immediately. * For example, `!(function(){})()` is an outer IIFE even though it is preceded by a ! operator. */ var statement = node.parent && node.parent.parent; while (statement.type === "UnaryExpression" && ["!", "~", "+", "-"].indexOf(statement.operator) > -1 || statement.type === "AssignmentExpression" || statement.type === "LogicalExpression" || statement.type === "SequenceExpression" || statement.type === "VariableDeclarator") { statement = statement.parent; } return (statement.type === "ExpressionStatement" || statement.type === "VariableDeclaration") && statement.parent.type === "Program"; } /** * Gets all tokens and comments for a node * @param {ASTNode} node The node * @returns {Token[]} A list of tokens and comments */ function getTokensAndComments(node) { return sourceCode.getTokens(node, { includeComments: true }); } /** * Check indentation for lists of elements (arrays, objects, function params) * @param {ASTNode[]} elements List of elements that should be offset * @param {Token} startToken The start token of the list that element should be aligned against, e.g. '[' * @param {Token} endToken The end token of the list, e.g. ']' * @param {number|string} offset The amount that the elements should be offset * @returns {void} */ function addElementListIndent(elements, startToken, endToken, offset) { /** * Gets the first token of a given element, including surrounding parentheses. * @param {ASTNode} element A node in the `elements` list * @returns {Token} The first token of this element */ function getFirstToken(element) { var token = sourceCode.getTokenBefore(element); while (astUtils.isOpeningParenToken(token) && token !== startToken) { token = sourceCode.getTokenBefore(token); } return sourceCode.getTokenAfter(token); } // Run through all the tokens in the list, and offset them by one indent level (mainly for comments, other things will end up overridden) // FIXME: (not-an-aardvark) This isn't performant at all. offsets.setDesiredOffsets(sourceCode.getTokensBetween(startToken, endToken, { includeComments: true }), startToken, offset === "first" ? 1 : offset); offsets.matchIndentOf(startToken, endToken); // If the preference is "first" but there is no first element (e.g. sparse arrays w/ empty first slot), fall back to 1 level. if (offset === "first" && elements.length && !elements[0]) { return; } elements.forEach(function (element, index) { if (offset === "off") { offsets.ignoreToken(getFirstToken(element)); } if (index === 0 || !element) { return; } if (offset === "first" && tokenInfo.isFirstTokenOfLine(getFirstToken(element))) { offsets.matchOffsetOf(getFirstToken(elements[0]), getFirstToken(element)); } else { var previousElement = elements[index - 1]; var firstTokenOfPreviousElement = previousElement && getFirstToken(previousElement); if (previousElement && sourceCode.getLastToken(previousElement).loc.start.line > startToken.loc.end.line) { offsets.matchIndentOf(firstTokenOfPreviousElement, getFirstToken(element)); } } }); } /** * Check indentation for blocks and class bodies * @param {ASTNode} node The BlockStatement or ClassBody node to indent * @returns {void} */ function addBlockIndent(node) { var blockIndentLevel = void 0; if (node.parent && isOuterIIFE(node.parent)) { blockIndentLevel = options.outerIIFEBody; } else if (node.parent && (node.parent.type === "FunctionExpression" || node.parent.type === "ArrowFunctionExpression")) { blockIndentLevel = options.FunctionExpression.body; } else if (node.parent && node.parent.type === "FunctionDeclaration") { blockIndentLevel = options.FunctionDeclaration.body; } else { blockIndentLevel = 1; } /* * For blocks that aren't lone statements, ensure that the opening curly brace * is aligned with the parent. */ if (!astUtils.STATEMENT_LIST_PARENTS.has(node.parent.type)) { offsets.matchIndentOf(sourceCode.getFirstToken(node.parent), sourceCode.getFirstToken(node)); } addElementListIndent(node.body, sourceCode.getFirstToken(node), sourceCode.getLastToken(node), blockIndentLevel); } /** * Check indent for array block content or object block content * @param {ASTNode} node node to examine * @returns {void} */ function addArrayOrObjectIndent(node) { var tokens = getTokensAndComments(node); addElementListIndent(node.elements || node.properties, tokens[0], tokens[tokens.length - 1], options[node.type]); } /** * Check and decide whether to check for indentation for blockless nodes * Scenarios are for or while statements without braces around them * @param {ASTNode} node node to examine * @returns {void} */ function addBlocklessNodeIndent(node) { if (node.type !== "BlockStatement") { var lastParentToken = sourceCode.getTokenBefore(node, astUtils.isNotOpeningParenToken); var bodyTokens = getTokensAndComments(node); while (astUtils.isOpeningParenToken(sourceCode.getTokenBefore(bodyTokens[0])) && astUtils.isClosingParenToken(sourceCode.getTokenAfter(bodyTokens[bodyTokens.length - 1]))) { bodyTokens = [sourceCode.getTokenBefore(bodyTokens[0])].concat(bodyTokens).concat(sourceCode.getTokenAfter(bodyTokens[bodyTokens.length - 1])); } offsets.setDesiredOffsets(bodyTokens, lastParentToken, 1); /* * For blockless nodes with semicolon-first style, don't indent the semicolon. * e.g. * if (foo) bar() * ; [1, 2, 3].map(foo) */ var lastToken = sourceCode.getLastToken(node); if (astUtils.isSemicolonToken(lastToken)) { offsets.matchIndentOf(lastParentToken, lastToken); } } } /** * Checks the indentation of a function's parameters * @param {ASTNode} node The node * @param {number} paramsIndent The indentation level option for the parameters * @returns {void} */ function addFunctionParamsIndent(node, paramsIndent) { var openingParen = node.params.length ? sourceCode.getTokenBefore(node.params[0]) : sourceCode.getTokenBefore(node.body, 1); if (!openingParen) { // If there is no opening paren (e.g. for an arrow function with a single parameter), don't indent anything. return; } var closingParen = sourceCode.getTokenBefore(node.body); var nodeTokens = getTokensAndComments(node); var openingParenIndex = lodash.sortedIndexBy(nodeTokens, openingParen, function (token) { return token.range[0]; }); var closingParenIndex = lodash.sortedIndexBy(nodeTokens, closingParen, function (token) { return token.range[0]; }); parameterParens.add(nodeTokens[openingParenIndex]); parameterParens.add(nodeTokens[closingParenIndex]); addElementListIndent(node.params, nodeTokens[openingParenIndex], nodeTokens[closingParenIndex], paramsIndent); } /** * Adds indentation for the right-hand side of binary/logical expressions. * @param {ASTNode} node A BinaryExpression or LogicalExpression node * @returns {void} */ function addBinaryOrLogicalExpressionIndent(node) { var tokens = getTokensAndComments(node); var operator = sourceCode.getFirstTokenBetween(node.left, node.right, function (token) { return token.value === node.operator; }); var firstTokenAfterOperator = sourceCode.getTokenAfter(operator); var tokensAfterOperator = tokens.slice(lodash.sortedIndexBy(tokens, firstTokenAfterOperator, function (token) { return token.range[0]; })); /* * For backwards compatibility, don't check BinaryExpression indents, e.g. * var foo = bar && * baz; */ offsets.ignoreToken(operator); offsets.ignoreToken(tokensAfterOperator[0]); offsets.setDesiredOffset(tokensAfterOperator[0], sourceCode.getFirstToken(node), 1); offsets.setDesiredOffsets(tokensAfterOperator, tokensAfterOperator[0], 1); } /** * Checks the indentation for nodes that are like function calls (`CallExpression` and `NewExpression`) * @param {ASTNode} node A CallExpression or NewExpression node * @returns {void} */ function addFunctionCallIndent(node) { var openingParen = void 0; if (node.arguments.length) { openingParen = sourceCode.getFirstTokenBetween(node.callee, node.arguments[0], astUtils.isOpeningParenToken); } else { openingParen = sourceCode.getLastToken(node, 1); } var closingParen = sourceCode.getLastToken(node); parameterParens.add(openingParen); parameterParens.add(closingParen); offsets.matchIndentOf(sourceCode.getLastToken(node.callee), openingParen); addElementListIndent(node.arguments, openingParen, closingParen, options.CallExpression.arguments); } /** * Checks the indentation of ClassDeclarations and ClassExpressions * @param {ASTNode} node A ClassDeclaration or ClassExpression node * @returns {void} */ function addClassIndent(node) { if (node.superClass) { var classToken = sourceCode.getFirstToken(node); var extendsToken = sourceCode.getTokenBefore(node.superClass, astUtils.isNotOpeningParenToken); offsets.setDesiredOffset(extendsToken, classToken, 1); offsets.setDesiredOffsets(sourceCode.getTokensBetween(extendsToken, node.body, { includeComments: true }), classToken, 1); } } /** * Checks the indentation of parenthesized values, given a list of tokens in a program * @param {Token[]} tokens A list of tokens * @returns {void} */ function addParensIndent(tokens) { var parenStack = []; var parenPairs = []; tokens.forEach(function (nextToken) { // Accumulate a list of parenthesis pairs if (astUtils.isOpeningParenToken(nextToken)) { parenStack.push(nextToken); } else if (astUtils.isClosingParenToken(nextToken)) { parenPairs.unshift({ left: parenStack.pop(), right: nextToken }); } }); parenPairs.forEach(function (pair) { var leftParen = pair.left; var rightParen = pair.right; // We only want to handle parens around expressions, so exclude parentheses that are in function parameters and function call arguments. if (!parameterParens.has(leftParen) && !parameterParens.has(rightParen)) { offsets.setDesiredOffset(sourceCode.getTokenAfter(leftParen), leftParen, 1); } offsets.matchIndentOf(leftParen, rightParen); }); } /** * Ignore all tokens within an unknown node whose offset do not depend * on another token's offset within the unknown node * @param {ASTNode} node Unknown Node * @returns {void} */ function ignoreUnknownNode(node) { var unknownNodeTokens = new Set(getTokensAndComments(node)); unknownNodeTokens.forEach(function (token) { if (!unknownNodeTokens.has(offsets.getFirstDependency(token))) { var firstTokenOfLine = tokenInfo.getFirstTokenOfLine(token); if (token === firstTokenOfLine) { offsets.ignoreToken(token); } else { offsets.matchIndentOf(firstTokenOfLine, token); } } }); } /** * Ignore node if it is unknown * @param {ASTNode} node Node * @returns {void} */ function checkForUnknownNode(node) { var isNodeUnknown = !KNOWN_NODES.has(node.type); if (isNodeUnknown) { ignoreUnknownNode(node); } } /** * Check whether the given token is the first token of a statement. * @param {Token} token The token to check. * @param {ASTNode} leafNode The expression node that the token belongs directly. * @returns {boolean} `true` if the token is the first token of a statement. */ function isFirstTokenOfStatement(token, leafNode) { var node = leafNode; while (node.parent && !node.parent.type.endsWith("Statement") && !node.parent.type.endsWith("Declaration")) { node = node.parent; } node = node.parent; return !node || node.range[0] === token.range[0]; } return { ArrayExpression: addArrayOrObjectIndent, ArrayPattern: addArrayOrObjectIndent, ArrowFunctionExpression: function ArrowFunctionExpression(node) { addFunctionParamsIndent(node, options.FunctionExpression.parameters); addBlocklessNodeIndent(node.body); var arrowToken = void 0; if (node.params.length) { arrowToken = sourceCode.getTokenAfter(node.params[node.params.length - 1], astUtils.isArrowToken); } else { arrowToken = sourceCode.getFirstToken(node, astUtils.isArrowToken); } offsets.matchIndentOf(sourceCode.getFirstToken(node), arrowToken); }, AssignmentExpression: function AssignmentExpression(node) { var operator = sourceCode.getFirstTokenBetween(node.left, node.right, function (token) { return token.value === node.operator; }); var nodeTokens = getTokensAndComments(node); var tokensFromOperator = nodeTokens.slice(lodash.sortedIndexBy(nodeTokens, operator, function (token) { return token.range[0]; })); offsets.setDesiredOffsets(tokensFromOperator, sourceCode.getFirstToken(node.left), 1); offsets.ignoreToken(tokensFromOperator[0]); offsets.ignoreToken(tokensFromOperator[1]); }, BinaryExpression: addBinaryOrLogicalExpressionIndent, BlockStatement: addBlockIndent, CallExpression: addFunctionCallIndent, ClassBody: addBlockIndent, ClassDeclaration: addClassIndent, ClassExpression: addClassIndent, ConditionalExpression: function ConditionalExpression(node) { var firstToken = sourceCode.getFirstToken(node); // `flatTernaryExpressions` option is for the following style: // var a = // foo > 0 ? bar : // foo < 0 ? baz : // /*else*/ qiz ; if (!options.flatTernaryExpressions || !astUtils.isTokenOnSameLine(node.test, node.consequent) || isFirstTokenOfStatement(firstToken, node)) { var questionMarkToken = sourceCode.getFirstTokenBetween(node.test, node.consequent, function (token) { return token.type === "Punctuator" && token.value === "?"; }); var colonToken = sourceCode.getFirstTokenBetween(node.consequent, node.alternate, function (token) { return token.type === "Punctuator" && token.value === ":"; }); var consequentTokens = sourceCode.getTokensBetween(questionMarkToken, colonToken, { includeComments: true }); var alternateTokens = sourceCode.getTokensAfter(colonToken, function (token) { return token.range[1] <= node.range[1]; }); offsets.setDesiredOffset(questionMarkToken, firstToken, 1); offsets.setDesiredOffset(colonToken, firstToken, 1); offsets.setDesiredOffset(consequentTokens[0], firstToken, 1); /* * The alternate and the consequent should usually have the same indentation. * If they share part of a line, align the alternate against the first token of the consequent. * This allows the alternate to be indented correctly in cases like this: * foo ? ( * bar * ) : ( // this '(' is aligned with the '(' above, so it's considered to be aligned with `foo` * baz // as a result, `baz` is offset by 1 rather than 2 * ) */ if (consequentTokens[consequentTokens.length - 1].loc.end.line === alternateTokens[0].loc.start.line) { offsets.matchIndentOf(consequentTokens[0], alternateTokens[0]); } else { /** * If the alternate and consequent do not share part of a line, offset the alternate from the first * token of the conditional expression. For example: * foo ? bar * : baz * * If `baz` were aligned with `bar` rather than being offset by 1 from `foo`, `baz` would end up * having no expected indentation. */ offsets.setDesiredOffset(alternateTokens[0], firstToken, 1); } offsets.setDesiredOffsets(consequentTokens, consequentTokens[0], 0); offsets.setDesiredOffsets(alternateTokens, alternateTokens[0], 0); } }, DoWhileStatement: function DoWhileStatement(node) { return addBlocklessNodeIndent(node.body); }, ExportNamedDeclaration: function ExportNamedDeclaration(node) { if (node.declaration === null) { var tokensInNode = getTokensAndComments(node); var closingCurly = sourceCode.getLastToken(node, astUtils.isClosingBraceToken); var closingCurlyIndex = lodash.sortedIndexBy(tokensInNode, closingCurly, function (token) { return token.range[0]; }); // Indent the specifiers in `export {foo, bar, baz}` addElementListIndent(node.specifiers, sourceCode.getFirstToken(node, { skip: 1 }), closingCurly, 1); if (node.source) { // Indent everything after and including the `from` token in `export {foo, bar, baz} from 'qux'` offsets.setDesiredOffsets(tokensInNode.slice(closingCurlyIndex + 1), sourceCode.getFirstToken(node), 1); } } }, ForInStatement: function ForInStatement(node) { return addBlocklessNodeIndent(node.body); }, ForOfStatement: function ForOfStatement(node) { return addBlocklessNodeIndent(node.body); }, ForStatement: function ForStatement(node) { var forOpeningParen = sourceCode.getFirstToken(node, 1); if (node.init) { offsets.setDesiredOffsets(getTokensAndComments(node.init), forOpeningParen, 1); } if (node.test) { offsets.setDesiredOffsets(getTokensAndComments(node.test), forOpeningParen, 1); } if (node.update) { offsets.setDesiredOffsets(getTokensAndComments(node.update), forOpeningParen, 1); } addBlocklessNodeIndent(node.body); }, FunctionDeclaration: function FunctionDeclaration(node) { addFunctionParamsIndent(node, options.FunctionDeclaration.parameters); }, FunctionExpression: function FunctionExpression(node) { addFunctionParamsIndent(node, options.FunctionExpression.parameters); }, IfStatement: function IfStatement(node) { addBlocklessNodeIndent(node.consequent); if (node.alternate && node.alternate.type !== "IfStatement") { addBlocklessNodeIndent(node.alternate); } }, ImportDeclaration: function ImportDeclaration(node) { if (node.specifiers.some(function (specifier) { return specifier.type === "ImportSpecifier"; })) { var openingCurly = sourceCode.getFirstToken(node, astUtils.isOpeningBraceToken); var closingCurly = sourceCode.getLastToken(node, astUtils.isClosingBraceToken); addElementListIndent(node.specifiers.filter(function (specifier) { return specifier.type === "ImportSpecifier"; }), openingCurly, closingCurly, 1); } var fromToken = sourceCode.getLastToken(node, function (token) { return token.type === "Identifier" && token.value === "from"; }); if (fromToken) { var tokensToOffset = sourceCode.getTokensBetween(fromToken, sourceCode.getLastToken(node), 1); offsets.setDesiredOffsets(tokensToOffset, sourceCode.getFirstToken(node), 1); } }, LogicalExpression: addBinaryOrLogicalExpressionIndent, "MemberExpression, JSXMemberExpression": function MemberExpressionJSXMemberExpression(node) { var firstNonObjectToken = sourceCode.getFirstTokenBetween(node.object, node.property, astUtils.isNotClosingParenToken); var secondNonObjectToken = sourceCode.getTokenAfter(firstNonObjectToken); var tokenBeforeObject = sourceCode.getTokenBefore(node.object, function (token) { return astUtils.isNotOpeningParenToken(token) || parameterParens.has(token); }); var firstObjectToken = tokenBeforeObject ? sourceCode.getTokenAfter(tokenBeforeObject) : sourceCode.ast.tokens[0]; var lastObjectToken = sourceCode.getTokenBefore(firstNonObjectToken); if (node.computed) { // For computed MemberExpressions, match the closing bracket with the opening bracket. offsets.matchIndentOf(firstNonObjectToken, sourceCode.getLastToken(node)); } if (typeof options.MemberExpression === "number") { var firstPropertyToken = node.computed ? firstNonObjectToken : secondNonObjectToken; /* * If the object ends on the same line that the property starts, match against the last token * of the object, to ensure that the MemberExpression is not indented. * * Otherwise, match against the first token of the object, e.g. * foo * .bar * .baz // <-- offset by 1 from `foo` */ var offsetBase = lastObjectToken.loc.end.line === firstPropertyToken.loc.start.line ? lastObjectToken : firstObjectToken; // Match the dot (for non-computed properties) or the opening bracket (for computed properties) against the object. offsets.setDesiredOffset(firstNonObjectToken, offsetBase, options.MemberExpression); /* * For computed MemberExpressions, match the first token of the property against the opening bracket. * Otherwise, match the first token of the property against the object. */ offsets.setDesiredOffset(secondNonObjectToken, node.computed ? firstNonObjectToken : offsetBase, options.MemberExpression); } else { // If the MemberExpression option is off, ignore the dot and the first token of the property. offsets.ignoreToken(firstNonObjectToken); offsets.ignoreToken(secondNonObjectToken); offsets.matchIndentOf(firstNonObjectToken, secondNonObjectToken); } }, NewExpression: function NewExpression(node) { // Only indent the arguments if the NewExpression has parens (e.g. `new Foo(bar)` or `new Foo()`, but not `new Foo` if (node.arguments.length > 0 || astUtils.isClosingParenToken(sourceCode.getLastToken(node)) && astUtils.isOpeningParenToken(sourceCode.getLastToken(node, 1))) { addFunctionCallIndent(node); } }, ObjectExpression: addArrayOrObjectIndent, ObjectPattern: addArrayOrObjectIndent, Property: function Property(node) { if (!node.computed && !node.shorthand && !node.method && node.kind === "init") { var colon = sourceCode.getFirstTokenBetween(node.key, node.value, astUtils.isColonToken); offsets.ignoreToken(sourceCode.getTokenAfter(colon)); } }, SwitchStatement: function SwitchStatement(node) { var tokens = getTokensAndComments(node); var openingCurlyIndex = tokens.findIndex(function (token) { return token.range[0] >= node.discriminant.range[1] && astUtils.isOpeningBraceToken(token); }); offsets.setDesiredOffsets(tokens.slice(openingCurlyIndex + 1, -1), tokens[openingCurlyIndex], options.SwitchCase); var caseKeywords = new WeakSet(node.cases.map(function (switchCase) { return sourceCode.getFirstToken(switchCase); })); var lastCaseKeyword = node.cases.length && sourceCode.getFirstToken(node.cases[node.cases.length - 1]); var casesWithBlocks = new WeakSet(node.cases.filter(function (switchCase) { return switchCase.consequent.length === 1 && switchCase.consequent[0].type === "BlockStatement"; }).map(function (switchCase) { return sourceCode.getFirstToken(switchCase); })); var lastAnchor = tokens[openingCurlyIndex]; tokens.slice(openingCurlyIndex + 1, -1).forEach(function (token) { if (caseKeywords.has(token)) { lastAnchor = token; } else if (lastAnchor === lastCaseKeyword && (token.type === "Line" || token.type === "Block")) { offsets.ignoreToken(token); } else if (!casesWithBlocks.has(lastAnchor)) { offsets.setDesiredOffset(token, lastAnchor, 1); } }); }, TemplateLiteral: function TemplateLiteral(node) { var tokens = getTokensAndComments(node); offsets.setDesiredOffsets(getTokensAndComments(node.quasis[0]), tokens[0], 0); node.expressions.forEach(function (expression, index) { var previousQuasi = node.quasis[index]; var nextQuasi = node.quasis[index + 1]; var tokenToAlignFrom = previousQuasi.loc.start.line === previousQuasi.loc.end.line ? sourceCode.getFirstToken(previousQuasi) : null; offsets.setDesiredOffsets(sourceCode.getTokensBetween(previousQuasi, nextQuasi), tokenToAlignFrom, 1); offsets.setDesiredOffset(sourceCode.getFirstToken(nextQuasi), tokenToAlignFrom, 0); }); }, VariableDeclaration: function VariableDeclaration(node) { var variableIndent = options.VariableDeclarator.hasOwnProperty(node.kind) ? options.VariableDeclarator[node.kind] : DEFAULT_VARIABLE_INDENT; offsets.setDesiredOffsets(getTokensAndComments(node), sourceCode.getFirstToken(node), variableIndent); var lastToken = sourceCode.getLastToken(node); if (astUtils.isSemicolonToken(lastToken)) { offsets.ignoreToken(lastToken); } }, VariableDeclarator: function VariableDeclarator(node) { if (node.init) { var equalOperator = sourceCode.getTokenBefore(node.init, astUtils.isNotOpeningParenToken); var tokenAfterOperator = sourceCode.getTokenAfter(equalOperator); offsets.ignoreToken(equalOperator); offsets.ignoreToken(tokenAfterOperator); offsets.matchIndentOf(equalOperator, tokenAfterOperator); } }, "VariableDeclarator:exit": function VariableDeclaratorExit(node) { /* * VariableDeclarator indentation is a bit different from other forms of indentation, in that the * indentation of an opening bracket sometimes won't match that of a closing bracket. For example, * the following indentations are correct: * * var foo = { * ok: true * }; * * var foo = { * ok: true, * }, * bar = 1; * * Account for when exiting the AST (after indentations have already been set for the nodes in * the declaration) by manually increasing the indentation level of the tokens in the first declarator if the * parent declaration has more than one declarator. */ if (node.parent.declarations.length > 1 && node.parent.declarations[0] === node && node.init) { var valueTokens = new Set(getTokensAndComments(node.init)); valueTokens.forEach(function (token) { if (!valueTokens.has(offsets.getFirstDependency(token))) { offsets.increaseOffset(token, options.VariableDeclarator[node.parent.kind]); } }); } }, WhileStatement: function WhileStatement(node) { return addBlocklessNodeIndent(node.body); }, "*:exit": checkForUnknownNode, "JSXAttribute[value]": function JSXAttributeValue(node) { var equalsToken = sourceCode.getFirstTokenBetween(node.name, node.value, function (token) { return token.type === "Punctuator" && token.value === "="; }); var firstNameToken = sourceCode.getFirstToken(node.name); offsets.setDesiredOffset(equalsToken, firstNameToken, 1); offsets.setDesiredOffset(sourceCode.getFirstToken(node.value), firstNameToken, 1); }, JSXElement: function JSXElement(node) { if (node.closingElement) { addElementListIndent(node.children, sourceCode.getFirstToken(node.openingElement), sourceCode.getFirstToken(node.closingElement), 1); } }, JSXOpeningElement: function JSXOpeningElement(node) { var firstToken = sourceCode.getFirstToken(node); var closingToken = void 0; if (node.selfClosing) { closingToken = sourceCode.getLastToken(node, { skip: 1 }); offsets.matchIndentOf(closingToken, sourceCode.getLastToken(node)); } else { closingToken = sourceCode.getLastToken(node); } offsets.setDesiredOffsets(getTokensAndComments(node.name), sourceCode.getFirstToken(node)); addElementListIndent(node.attributes, firstToken, closingToken, 1); }, JSXClosingElement: function JSXClosingElement(node) { var firstToken = sourceCode.getFirstToken(node); offsets.setDesiredOffsets(getTokensAndComments(node.name), firstToken, 1); offsets.matchIndentOf(firstToken, sourceCode.getLastToken(node)); }, JSXExpressionContainer: function JSXExpressionContainer(node) { var openingCurly = sourceCode.getFirstToken(node); var firstExpressionToken = sourceCode.getFirstToken(node.expression); if (firstExpressionToken) { offsets.setDesiredOffset(firstExpressionToken, openingCurly, 1); } offsets.matchIndentOf(openingCurly, sourceCode.getLastToken(node)); }, "Program:exit": function ProgramExit() { addParensIndent(sourceCode.ast.tokens); /* * Create a Map from (tokenOrComment) => (precedingToken). * This is necessary because sourceCode.getTokenBefore does not handle a comment as an argument correctly. */ var precedingTokens = sourceCode.ast.comments.reduce(function (commentMap, comment) { var tokenOrCommentBefore = sourceCode.getTokenBefore(comment, { includeComments: true }); return commentMap.set(comment, commentMap.has(tokenOrCommentBefore) ? commentMap.get(tokenOrCommentBefore) : tokenOrCommentBefore); }, new WeakMap()); sourceCode.lines.forEach(function (line, lineIndex) { var lineNumber = lineIndex + 1; if (!tokenInfo.firstTokensByLineNumber.has(lineNumber)) { // Don't check indentation on blank lines return; } var firstTokenOfLine = tokenInfo.firstTokensByLineNumber.get(lineNumber); if (firstTokenOfLine.loc.start.line !== lineNumber) { // Don't check the indentation of multi-line tokens (e.g. template literals or block comments) twice. return; } // If the token matches the expected expected indentation, don't report it. if (validateTokenIndent(firstTokenOfLine, offsets.getDesiredIndent(firstTokenOfLine))) { return; } if (astUtils.isCommentToken(firstTokenOfLine)) { var tokenBefore = precedingTokens.get(firstTokenOfLine); var tokenAfter = tokenBefore ? sourceCode.getTokenAfter(tokenBefore) : sourceCode.ast.tokens[0]; // If a comment matches the expected indentation of the token immediately before or after, don't report it. if (tokenBefore && validateTokenIndent(firstTokenOfLine, offsets.getDesiredIndent(tokenBefore)) || tokenAfter && validateTokenIndent(firstTokenOfLine, offsets.getDesiredIndent(tokenAfter))) { return; } } // Otherwise, report the token/comment. report(firstTokenOfLine, offsets.getDesiredIndent(firstTokenOfLine)); }); } }; } }; },{"../ast-utils":67,"lodash":48}],125:[function(require,module,exports){ /** * @fileoverview A rule to control the style of variable initializations. * @author Colin Ihrig */ "use strict"; //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Checks whether or not a given node is a for loop. * @param {ASTNode} block - A node to check. * @returns {boolean} `true` when the node is a for loop. */ function isForLoop(block) { return block.type === "ForInStatement" || block.type === "ForOfStatement" || block.type === "ForStatement"; } /** * Checks whether or not a given declarator node has its initializer. * @param {ASTNode} node - A declarator node to check. * @returns {boolean} `true` when the node has its initializer. */ function isInitialized(node) { var declaration = node.parent; var block = declaration.parent; if (isForLoop(block)) { if (block.type === "ForStatement") { return block.init === declaration; } return block.left === declaration; } return Boolean(node.init); } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require or disallow initialization in variable declarations", category: "Variables", recommended: false }, schema: { anyOf: [{ type: "array", items: [{ enum: ["always"] }], minItems: 0, maxItems: 1 }, { type: "array", items: [{ enum: ["never"] }, { type: "object", properties: { ignoreForLoopInit: { type: "boolean" } }, additionalProperties: false }], minItems: 0, maxItems: 2 }] } }, create: function create(context) { var MODE_ALWAYS = "always", MODE_NEVER = "never"; var mode = context.options[0] || MODE_ALWAYS; var params = context.options[1] || {}; //-------------------------------------------------------------------------- // Public API //-------------------------------------------------------------------------- return { "VariableDeclaration:exit": function VariableDeclarationExit(node) { var kind = node.kind, declarations = node.declarations; for (var i = 0; i < declarations.length; ++i) { var declaration = declarations[i], id = declaration.id, initialized = isInitialized(declaration), isIgnoredForLoop = params.ignoreForLoopInit && isForLoop(node.parent); if (id.type !== "Identifier") { continue; } if (mode === MODE_ALWAYS && !initialized) { context.report({ node: declaration, message: "Variable '{{idName}}' should be initialized on declaration.", data: { idName: id.name } }); } else if (mode === MODE_NEVER && kind !== "const" && initialized && !isIgnoredForLoop) { context.report({ node: declaration, message: "Variable '{{idName}}' should not be initialized on declaration.", data: { idName: id.name } }); } } } }; } }; },{}],126:[function(require,module,exports){ /** * @fileoverview A rule to ensure consistent quotes used in jsx syntax. * @author Mathias Schreck */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Constants //------------------------------------------------------------------------------ var QUOTE_SETTINGS = { "prefer-double": { quote: "\"", description: "singlequote", convert: function convert(str) { return str.replace(/'/g, "\""); } }, "prefer-single": { quote: "'", description: "doublequote", convert: function convert(str) { return str.replace(/"/g, "'"); } } }; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce the consistent use of either double or single quotes in JSX attributes", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ enum: ["prefer-single", "prefer-double"] }] }, create: function create(context) { var quoteOption = context.options[0] || "prefer-double", setting = QUOTE_SETTINGS[quoteOption]; /** * Checks if the given string literal node uses the expected quotes * @param {ASTNode} node - A string literal node. * @returns {boolean} Whether or not the string literal used the expected quotes. * @public */ function usesExpectedQuotes(node) { return node.value.indexOf(setting.quote) !== -1 || astUtils.isSurroundedBy(node.raw, setting.quote); } return { JSXAttribute: function JSXAttribute(node) { var attributeValue = node.value; if (attributeValue && astUtils.isStringLiteral(attributeValue) && !usesExpectedQuotes(attributeValue)) { context.report({ node: attributeValue, message: "Unexpected usage of {{description}}.", data: { description: setting.description }, fix: function fix(fixer) { return fixer.replaceText(attributeValue, setting.convert(attributeValue.raw)); } }); } } }; } }; },{"../ast-utils":67}],127:[function(require,module,exports){ /** * @fileoverview Rule to specify spacing of object literal keys and values * @author Brandon Mills */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Checks whether a string contains a line terminator as defined in * http://www.ecma-international.org/ecma-262/5.1/#sec-7.3 * @param {string} str String to test. * @returns {boolean} True if str contains a line terminator. */ function containsLineTerminator(str) { return astUtils.LINEBREAK_MATCHER.test(str); } /** * Gets the last element of an array. * @param {Array} arr An array. * @returns {any} Last element of arr. */ function last(arr) { return arr[arr.length - 1]; } /** * Checks whether a node is contained on a single line. * @param {ASTNode} node AST Node being evaluated. * @returns {boolean} True if the node is a single line. */ function isSingleLine(node) { return node.loc.end.line === node.loc.start.line; } /** * Initializes a single option property from the configuration with defaults for undefined values * @param {Object} toOptions Object to be initialized * @param {Object} fromOptions Object to be initialized from * @returns {Object} The object with correctly initialized options and values */ function initOptionProperty(toOptions, fromOptions) { toOptions.mode = fromOptions.mode || "strict"; // Set value of beforeColon if (typeof fromOptions.beforeColon !== "undefined") { toOptions.beforeColon = +fromOptions.beforeColon; } else { toOptions.beforeColon = 0; } // Set value of afterColon if (typeof fromOptions.afterColon !== "undefined") { toOptions.afterColon = +fromOptions.afterColon; } else { toOptions.afterColon = 1; } // Set align if exists if (typeof fromOptions.align !== "undefined") { if (_typeof(fromOptions.align) === "object") { toOptions.align = fromOptions.align; } else { // "string" toOptions.align = { on: fromOptions.align, mode: toOptions.mode, beforeColon: toOptions.beforeColon, afterColon: toOptions.afterColon }; } } return toOptions; } /** * Initializes all the option values (singleLine, multiLine and align) from the configuration with defaults for undefined values * @param {Object} toOptions Object to be initialized * @param {Object} fromOptions Object to be initialized from * @returns {Object} The object with correctly initialized options and values */ function initOptions(toOptions, fromOptions) { if (_typeof(fromOptions.align) === "object") { // Initialize the alignment configuration toOptions.align = initOptionProperty({}, fromOptions.align); toOptions.align.on = fromOptions.align.on || "colon"; toOptions.align.mode = fromOptions.align.mode || "strict"; toOptions.multiLine = initOptionProperty({}, fromOptions.multiLine || fromOptions); toOptions.singleLine = initOptionProperty({}, fromOptions.singleLine || fromOptions); } else { // string or undefined toOptions.multiLine = initOptionProperty({}, fromOptions.multiLine || fromOptions); toOptions.singleLine = initOptionProperty({}, fromOptions.singleLine || fromOptions); // If alignment options are defined in multiLine, pull them out into the general align configuration if (toOptions.multiLine.align) { toOptions.align = { on: toOptions.multiLine.align.on, mode: toOptions.multiLine.align.mode || toOptions.multiLine.mode, beforeColon: toOptions.multiLine.align.beforeColon, afterColon: toOptions.multiLine.align.afterColon }; } } return toOptions; } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ var messages = { key: "{{error}} space after {{computed}}key '{{key}}'.", value: "{{error}} space before value for {{computed}}key '{{key}}'." }; module.exports = { meta: { docs: { description: "enforce consistent spacing between keys and values in object literal properties", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ anyOf: [{ type: "object", properties: { align: { anyOf: [{ enum: ["colon", "value"] }, { type: "object", properties: { mode: { enum: ["strict", "minimum"] }, on: { enum: ["colon", "value"] }, beforeColon: { type: "boolean" }, afterColon: { type: "boolean" } }, additionalProperties: false }] }, mode: { enum: ["strict", "minimum"] }, beforeColon: { type: "boolean" }, afterColon: { type: "boolean" } }, additionalProperties: false }, { type: "object", properties: { singleLine: { type: "object", properties: { mode: { enum: ["strict", "minimum"] }, beforeColon: { type: "boolean" }, afterColon: { type: "boolean" } }, additionalProperties: false }, multiLine: { type: "object", properties: { align: { anyOf: [{ enum: ["colon", "value"] }, { type: "object", properties: { mode: { enum: ["strict", "minimum"] }, on: { enum: ["colon", "value"] }, beforeColon: { type: "boolean" }, afterColon: { type: "boolean" } }, additionalProperties: false }] }, mode: { enum: ["strict", "minimum"] }, beforeColon: { type: "boolean" }, afterColon: { type: "boolean" } }, additionalProperties: false } }, additionalProperties: false }, { type: "object", properties: { singleLine: { type: "object", properties: { mode: { enum: ["strict", "minimum"] }, beforeColon: { type: "boolean" }, afterColon: { type: "boolean" } }, additionalProperties: false }, multiLine: { type: "object", properties: { mode: { enum: ["strict", "minimum"] }, beforeColon: { type: "boolean" }, afterColon: { type: "boolean" } }, additionalProperties: false }, align: { type: "object", properties: { mode: { enum: ["strict", "minimum"] }, on: { enum: ["colon", "value"] }, beforeColon: { type: "boolean" }, afterColon: { type: "boolean" } }, additionalProperties: false } }, additionalProperties: false }] }] }, create: function create(context) { /** * OPTIONS * "key-spacing": [2, { * beforeColon: false, * afterColon: true, * align: "colon" // Optional, or "value" * } */ var options = context.options[0] || {}, ruleOptions = initOptions({}, options), multiLineOptions = ruleOptions.multiLine, singleLineOptions = ruleOptions.singleLine, alignmentOptions = ruleOptions.align || null; var sourceCode = context.getSourceCode(); /** * Checks whether a property is a member of the property group it follows. * @param {ASTNode} lastMember The last Property known to be in the group. * @param {ASTNode} candidate The next Property that might be in the group. * @returns {boolean} True if the candidate property is part of the group. */ function continuesPropertyGroup(lastMember, candidate) { var groupEndLine = lastMember.loc.start.line, candidateStartLine = candidate.loc.start.line; if (candidateStartLine - groupEndLine <= 1) { return true; } // Check that the first comment is adjacent to the end of the group, the // last comment is adjacent to the candidate property, and that successive // comments are adjacent to each other. var leadingComments = sourceCode.getCommentsBefore(candidate); if (leadingComments.length && leadingComments[0].loc.start.line - groupEndLine <= 1 && candidateStartLine - last(leadingComments).loc.end.line <= 1) { for (var i = 1; i < leadingComments.length; i++) { if (leadingComments[i].loc.start.line - leadingComments[i - 1].loc.end.line > 1) { return false; } } return true; } return false; } /** * Determines if the given property is key-value property. * @param {ASTNode} property Property node to check. * @returns {boolean} Whether the property is a key-value property. */ function isKeyValueProperty(property) { return !(property.method || property.shorthand || property.kind !== "init" || property.type !== "Property"); } /** * Starting from the given a node (a property.key node here) looks forward * until it finds the last token before a colon punctuator and returns it. * @param {ASTNode} node The node to start looking from. * @returns {ASTNode} The last token before a colon punctuator. */ function getLastTokenBeforeColon(node) { var colonToken = sourceCode.getTokenAfter(node, astUtils.isColonToken); return sourceCode.getTokenBefore(colonToken); } /** * Starting from the given a node (a property.key node here) looks forward * until it finds the colon punctuator and returns it. * @param {ASTNode} node The node to start looking from. * @returns {ASTNode} The colon punctuator. */ function getNextColon(node) { return sourceCode.getTokenAfter(node, astUtils.isColonToken); } /** * Gets an object literal property's key as the identifier name or string value. * @param {ASTNode} property Property node whose key to retrieve. * @returns {string} The property's key. */ function getKey(property) { var key = property.key; if (property.computed) { return sourceCode.getText().slice(key.range[0], key.range[1]); } return property.key.name || property.key.value; } /** * Reports an appropriately-formatted error if spacing is incorrect on one * side of the colon. * @param {ASTNode} property Key-value pair in an object literal. * @param {string} side Side being verified - either "key" or "value". * @param {string} whitespace Actual whitespace string. * @param {int} expected Expected whitespace length. * @param {string} mode Value of the mode as "strict" or "minimum" * @returns {void} */ function report(property, side, whitespace, expected, mode) { var diff = whitespace.length - expected, nextColon = getNextColon(property.key), tokenBeforeColon = sourceCode.getTokenBefore(nextColon, { includeComments: true }), tokenAfterColon = sourceCode.getTokenAfter(nextColon, { includeComments: true }), isKeySide = side === "key", locStart = isKeySide ? tokenBeforeColon.loc.start : tokenAfterColon.loc.start, isExtra = diff > 0, diffAbs = Math.abs(diff), spaces = Array(diffAbs + 1).join(" "); var fix = void 0; if ((diff && mode === "strict" || diff < 0 && mode === "minimum" || diff > 0 && !expected && mode === "minimum") && !(expected && containsLineTerminator(whitespace))) { if (isExtra) { var range = void 0; // Remove whitespace if (isKeySide) { range = [tokenBeforeColon.end, tokenBeforeColon.end + diffAbs]; } else { range = [tokenAfterColon.start - diffAbs, tokenAfterColon.start]; } fix = function fix(fixer) { return fixer.removeRange(range); }; } else { // Add whitespace if (isKeySide) { fix = function fix(fixer) { return fixer.insertTextAfter(tokenBeforeColon, spaces); }; } else { fix = function fix(fixer) { return fixer.insertTextBefore(tokenAfterColon, spaces); }; } } context.report({ node: property[side], loc: locStart, message: messages[side], data: { error: isExtra ? "Extra" : "Missing", computed: property.computed ? "computed " : "", key: getKey(property) }, fix: fix }); } } /** * Gets the number of characters in a key, including quotes around string * keys and braces around computed property keys. * @param {ASTNode} property Property of on object literal. * @returns {int} Width of the key. */ function getKeyWidth(property) { var startToken = sourceCode.getFirstToken(property); var endToken = getLastTokenBeforeColon(property.key); return endToken.range[1] - startToken.range[0]; } /** * Gets the whitespace around the colon in an object literal property. * @param {ASTNode} property Property node from an object literal. * @returns {Object} Whitespace before and after the property's colon. */ function getPropertyWhitespace(property) { var whitespace = /(\s*):(\s*)/.exec(sourceCode.getText().slice(property.key.range[1], property.value.range[0])); if (whitespace) { return { beforeColon: whitespace[1], afterColon: whitespace[2] }; } return null; } /** * Creates groups of properties. * @param {ASTNode} node ObjectExpression node being evaluated. * @returns {Array.} Groups of property AST node lists. */ function createGroups(node) { if (node.properties.length === 1) { return [node.properties]; } return node.properties.reduce(function (groups, property) { var currentGroup = last(groups), prev = last(currentGroup); if (!prev || continuesPropertyGroup(prev, property)) { currentGroup.push(property); } else { groups.push([property]); } return groups; }, [[]]); } /** * Verifies correct vertical alignment of a group of properties. * @param {ASTNode[]} properties List of Property AST nodes. * @returns {void} */ function verifyGroupAlignment(properties) { var length = properties.length, widths = properties.map(getKeyWidth), // Width of keys, including quotes align = alignmentOptions.on; // "value" or "colon" var targetWidth = Math.max.apply(null, widths), beforeColon = void 0, afterColon = void 0, mode = void 0; if (alignmentOptions && length > 1) { // When aligning values within a group, use the alignment configuration. beforeColon = alignmentOptions.beforeColon; afterColon = alignmentOptions.afterColon; mode = alignmentOptions.mode; } else { beforeColon = multiLineOptions.beforeColon; afterColon = multiLineOptions.afterColon; mode = alignmentOptions.mode; } // Conditionally include one space before or after colon targetWidth += align === "colon" ? beforeColon : afterColon; for (var i = 0; i < length; i++) { var property = properties[i]; var whitespace = getPropertyWhitespace(property); if (whitespace) { // Object literal getters/setters lack a colon var width = widths[i]; if (align === "value") { report(property, "key", whitespace.beforeColon, beforeColon, mode); report(property, "value", whitespace.afterColon, targetWidth - width, mode); } else { // align = "colon" report(property, "key", whitespace.beforeColon, targetWidth - width, mode); report(property, "value", whitespace.afterColon, afterColon, mode); } } } } /** * Verifies vertical alignment, taking into account groups of properties. * @param {ASTNode} node ObjectExpression node being evaluated. * @returns {void} */ function verifyAlignment(node) { createGroups(node).forEach(function (group) { verifyGroupAlignment(group.filter(isKeyValueProperty)); }); } /** * Verifies spacing of property conforms to specified options. * @param {ASTNode} node Property node being evaluated. * @param {Object} lineOptions Configured singleLine or multiLine options * @returns {void} */ function verifySpacing(node, lineOptions) { var actual = getPropertyWhitespace(node); if (actual) { // Object literal getters/setters lack colons report(node, "key", actual.beforeColon, lineOptions.beforeColon, lineOptions.mode); report(node, "value", actual.afterColon, lineOptions.afterColon, lineOptions.mode); } } /** * Verifies spacing of each property in a list. * @param {ASTNode[]} properties List of Property AST nodes. * @returns {void} */ function verifyListSpacing(properties) { var length = properties.length; for (var i = 0; i < length; i++) { verifySpacing(properties[i], singleLineOptions); } } //-------------------------------------------------------------------------- // Public API //-------------------------------------------------------------------------- if (alignmentOptions) { // Verify vertical alignment return { ObjectExpression: function ObjectExpression(node) { if (isSingleLine(node)) { verifyListSpacing(node.properties.filter(isKeyValueProperty)); } else { verifyAlignment(node); } } }; } // Obey beforeColon and afterColon in each property as configured return { Property: function Property(node) { verifySpacing(node, isSingleLine(node.parent) ? singleLineOptions : multiLineOptions); } }; } }; },{"../ast-utils":67}],128:[function(require,module,exports){ /** * @fileoverview Rule to enforce spacing before and after keywords. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"), keywords = require("../util/keywords"); //------------------------------------------------------------------------------ // Constants //------------------------------------------------------------------------------ var PREV_TOKEN = /^[)\]}>]$/; var NEXT_TOKEN = /^(?:[([{<~!]|\+\+?|--?)$/; var PREV_TOKEN_M = /^[)\]}>*]$/; var NEXT_TOKEN_M = /^[{*]$/; var TEMPLATE_OPEN_PAREN = /\$\{$/; var TEMPLATE_CLOSE_PAREN = /^\}/; var CHECK_TYPE = /^(?:JSXElement|RegularExpression|String|Template)$/; var KEYS = keywords.concat(["as", "async", "await", "from", "get", "let", "of", "set", "yield"]); // check duplications. (function () { KEYS.sort(); for (var i = 1; i < KEYS.length; ++i) { if (KEYS[i] === KEYS[i - 1]) { throw new Error("Duplication was found in the keyword list: " + KEYS[i]); } } })(); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Checks whether or not a given token is a "Template" token ends with "${". * * @param {Token} token - A token to check. * @returns {boolean} `true` if the token is a "Template" token ends with "${". */ function isOpenParenOfTemplate(token) { return token.type === "Template" && TEMPLATE_OPEN_PAREN.test(token.value); } /** * Checks whether or not a given token is a "Template" token starts with "}". * * @param {Token} token - A token to check. * @returns {boolean} `true` if the token is a "Template" token starts with "}". */ function isCloseParenOfTemplate(token) { return token.type === "Template" && TEMPLATE_CLOSE_PAREN.test(token.value); } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce consistent spacing before and after keywords", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ type: "object", properties: { before: { type: "boolean" }, after: { type: "boolean" }, overrides: { type: "object", properties: KEYS.reduce(function (retv, key) { retv[key] = { type: "object", properties: { before: { type: "boolean" }, after: { type: "boolean" } }, additionalProperties: false }; return retv; }, {}), additionalProperties: false } }, additionalProperties: false }] }, create: function create(context) { var sourceCode = context.getSourceCode(); /** * Reports a given token if there are not space(s) before the token. * * @param {Token} token - A token to report. * @param {RegExp|undefined} pattern - Optional. A pattern of the previous * token to check. * @returns {void} */ function expectSpaceBefore(token, pattern) { pattern = pattern || PREV_TOKEN; var prevToken = sourceCode.getTokenBefore(token); if (prevToken && (CHECK_TYPE.test(prevToken.type) || pattern.test(prevToken.value)) && !isOpenParenOfTemplate(prevToken) && astUtils.isTokenOnSameLine(prevToken, token) && !sourceCode.isSpaceBetweenTokens(prevToken, token)) { context.report({ loc: token.loc.start, message: "Expected space(s) before \"{{value}}\".", data: token, fix: function fix(fixer) { return fixer.insertTextBefore(token, " "); } }); } } /** * Reports a given token if there are space(s) before the token. * * @param {Token} token - A token to report. * @param {RegExp|undefined} pattern - Optional. A pattern of the previous * token to check. * @returns {void} */ function unexpectSpaceBefore(token, pattern) { pattern = pattern || PREV_TOKEN; var prevToken = sourceCode.getTokenBefore(token); if (prevToken && (CHECK_TYPE.test(prevToken.type) || pattern.test(prevToken.value)) && !isOpenParenOfTemplate(prevToken) && astUtils.isTokenOnSameLine(prevToken, token) && sourceCode.isSpaceBetweenTokens(prevToken, token)) { context.report({ loc: token.loc.start, message: "Unexpected space(s) before \"{{value}}\".", data: token, fix: function fix(fixer) { return fixer.removeRange([prevToken.range[1], token.range[0]]); } }); } } /** * Reports a given token if there are not space(s) after the token. * * @param {Token} token - A token to report. * @param {RegExp|undefined} pattern - Optional. A pattern of the next * token to check. * @returns {void} */ function expectSpaceAfter(token, pattern) { pattern = pattern || NEXT_TOKEN; var nextToken = sourceCode.getTokenAfter(token); if (nextToken && (CHECK_TYPE.test(nextToken.type) || pattern.test(nextToken.value)) && !isCloseParenOfTemplate(nextToken) && astUtils.isTokenOnSameLine(token, nextToken) && !sourceCode.isSpaceBetweenTokens(token, nextToken)) { context.report({ loc: token.loc.start, message: "Expected space(s) after \"{{value}}\".", data: token, fix: function fix(fixer) { return fixer.insertTextAfter(token, " "); } }); } } /** * Reports a given token if there are space(s) after the token. * * @param {Token} token - A token to report. * @param {RegExp|undefined} pattern - Optional. A pattern of the next * token to check. * @returns {void} */ function unexpectSpaceAfter(token, pattern) { pattern = pattern || NEXT_TOKEN; var nextToken = sourceCode.getTokenAfter(token); if (nextToken && (CHECK_TYPE.test(nextToken.type) || pattern.test(nextToken.value)) && !isCloseParenOfTemplate(nextToken) && astUtils.isTokenOnSameLine(token, nextToken) && sourceCode.isSpaceBetweenTokens(token, nextToken)) { context.report({ loc: token.loc.start, message: "Unexpected space(s) after \"{{value}}\".", data: token, fix: function fix(fixer) { return fixer.removeRange([token.range[1], nextToken.range[0]]); } }); } } /** * Parses the option object and determines check methods for each keyword. * * @param {Object|undefined} options - The option object to parse. * @returns {Object} - Normalized option object. * Keys are keywords (there are for every keyword). * Values are instances of `{"before": function, "after": function}`. */ function parseOptions(options) { var before = !options || options.before !== false; var after = !options || options.after !== false; var defaultValue = { before: before ? expectSpaceBefore : unexpectSpaceBefore, after: after ? expectSpaceAfter : unexpectSpaceAfter }; var overrides = options && options.overrides || {}; var retv = Object.create(null); for (var i = 0; i < KEYS.length; ++i) { var key = KEYS[i]; var override = overrides[key]; if (override) { var thisBefore = "before" in override ? override.before : before; var thisAfter = "after" in override ? override.after : after; retv[key] = { before: thisBefore ? expectSpaceBefore : unexpectSpaceBefore, after: thisAfter ? expectSpaceAfter : unexpectSpaceAfter }; } else { retv[key] = defaultValue; } } return retv; } var checkMethodMap = parseOptions(context.options[0]); /** * Reports a given token if usage of spacing followed by the token is * invalid. * * @param {Token} token - A token to report. * @param {RegExp|undefined} pattern - Optional. A pattern of the previous * token to check. * @returns {void} */ function checkSpacingBefore(token, pattern) { checkMethodMap[token.value].before(token, pattern); } /** * Reports a given token if usage of spacing preceded by the token is * invalid. * * @param {Token} token - A token to report. * @param {RegExp|undefined} pattern - Optional. A pattern of the next * token to check. * @returns {void} */ function checkSpacingAfter(token, pattern) { checkMethodMap[token.value].after(token, pattern); } /** * Reports a given token if usage of spacing around the token is invalid. * * @param {Token} token - A token to report. * @returns {void} */ function checkSpacingAround(token) { checkSpacingBefore(token); checkSpacingAfter(token); } /** * Reports the first token of a given node if the first token is a keyword * and usage of spacing around the token is invalid. * * @param {ASTNode|null} node - A node to report. * @returns {void} */ function checkSpacingAroundFirstToken(node) { var firstToken = node && sourceCode.getFirstToken(node); if (firstToken && firstToken.type === "Keyword") { checkSpacingAround(firstToken); } } /** * Reports the first token of a given node if the first token is a keyword * and usage of spacing followed by the token is invalid. * * This is used for unary operators (e.g. `typeof`), `function`, and `super`. * Other rules are handling usage of spacing preceded by those keywords. * * @param {ASTNode|null} node - A node to report. * @returns {void} */ function checkSpacingBeforeFirstToken(node) { var firstToken = node && sourceCode.getFirstToken(node); if (firstToken && firstToken.type === "Keyword") { checkSpacingBefore(firstToken); } } /** * Reports the previous token of a given node if the token is a keyword and * usage of spacing around the token is invalid. * * @param {ASTNode|null} node - A node to report. * @returns {void} */ function checkSpacingAroundTokenBefore(node) { if (node) { var token = sourceCode.getTokenBefore(node, astUtils.isKeywordToken); checkSpacingAround(token); } } /** * Reports `async` or `function` keywords of a given node if usage of * spacing around those keywords is invalid. * * @param {ASTNode} node - A node to report. * @returns {void} */ function checkSpacingForFunction(node) { var firstToken = node && sourceCode.getFirstToken(node); if (firstToken && (firstToken.type === "Keyword" && firstToken.value === "function" || firstToken.value === "async")) { checkSpacingBefore(firstToken); } } /** * Reports `class` and `extends` keywords of a given node if usage of * spacing around those keywords is invalid. * * @param {ASTNode} node - A node to report. * @returns {void} */ function checkSpacingForClass(node) { checkSpacingAroundFirstToken(node); checkSpacingAroundTokenBefore(node.superClass); } /** * Reports `if` and `else` keywords of a given node if usage of spacing * around those keywords is invalid. * * @param {ASTNode} node - A node to report. * @returns {void} */ function checkSpacingForIfStatement(node) { checkSpacingAroundFirstToken(node); checkSpacingAroundTokenBefore(node.alternate); } /** * Reports `try`, `catch`, and `finally` keywords of a given node if usage * of spacing around those keywords is invalid. * * @param {ASTNode} node - A node to report. * @returns {void} */ function checkSpacingForTryStatement(node) { checkSpacingAroundFirstToken(node); checkSpacingAroundFirstToken(node.handler); checkSpacingAroundTokenBefore(node.finalizer); } /** * Reports `do` and `while` keywords of a given node if usage of spacing * around those keywords is invalid. * * @param {ASTNode} node - A node to report. * @returns {void} */ function checkSpacingForDoWhileStatement(node) { checkSpacingAroundFirstToken(node); checkSpacingAroundTokenBefore(node.test); } /** * Reports `for` and `in` keywords of a given node if usage of spacing * around those keywords is invalid. * * @param {ASTNode} node - A node to report. * @returns {void} */ function checkSpacingForForInStatement(node) { checkSpacingAroundFirstToken(node); checkSpacingAroundTokenBefore(node.right); } /** * Reports `for` and `of` keywords of a given node if usage of spacing * around those keywords is invalid. * * @param {ASTNode} node - A node to report. * @returns {void} */ function checkSpacingForForOfStatement(node) { checkSpacingAroundFirstToken(node); checkSpacingAround(sourceCode.getTokenBefore(node.right, astUtils.isNotOpeningParenToken)); } /** * Reports `import`, `export`, `as`, and `from` keywords of a given node if * usage of spacing around those keywords is invalid. * * This rule handles the `*` token in module declarations. * * import*as A from "./a"; /*error Expected space(s) after "import". * error Expected space(s) before "as". * * @param {ASTNode} node - A node to report. * @returns {void} */ function checkSpacingForModuleDeclaration(node) { var firstToken = sourceCode.getFirstToken(node); checkSpacingBefore(firstToken, PREV_TOKEN_M); checkSpacingAfter(firstToken, NEXT_TOKEN_M); if (node.source) { var fromToken = sourceCode.getTokenBefore(node.source); checkSpacingBefore(fromToken, PREV_TOKEN_M); checkSpacingAfter(fromToken, NEXT_TOKEN_M); } } /** * Reports `as` keyword of a given node if usage of spacing around this * keyword is invalid. * * @param {ASTNode} node - A node to report. * @returns {void} */ function checkSpacingForImportNamespaceSpecifier(node) { var asToken = sourceCode.getFirstToken(node, 1); checkSpacingBefore(asToken, PREV_TOKEN_M); } /** * Reports `static`, `get`, and `set` keywords of a given node if usage of * spacing around those keywords is invalid. * * @param {ASTNode} node - A node to report. * @returns {void} */ function checkSpacingForProperty(node) { if (node.static) { checkSpacingAroundFirstToken(node); } if (node.kind === "get" || node.kind === "set" || (node.method || node.type === "MethodDefinition") && node.value.async) { var token = sourceCode.getTokenBefore(node.key, function (tok) { switch (tok.value) { case "get": case "set": case "async": return true; default: return false; } }); if (!token) { throw new Error("Failed to find token get, set, or async beside method name"); } checkSpacingAround(token); } } /** * Reports `await` keyword of a given node if usage of spacing before * this keyword is invalid. * * @param {ASTNode} node - A node to report. * @returns {void} */ function checkSpacingForAwaitExpression(node) { checkSpacingBefore(sourceCode.getFirstToken(node)); } return { // Statements DebuggerStatement: checkSpacingAroundFirstToken, WithStatement: checkSpacingAroundFirstToken, // Statements - Control flow BreakStatement: checkSpacingAroundFirstToken, ContinueStatement: checkSpacingAroundFirstToken, ReturnStatement: checkSpacingAroundFirstToken, ThrowStatement: checkSpacingAroundFirstToken, TryStatement: checkSpacingForTryStatement, // Statements - Choice IfStatement: checkSpacingForIfStatement, SwitchStatement: checkSpacingAroundFirstToken, SwitchCase: checkSpacingAroundFirstToken, // Statements - Loops DoWhileStatement: checkSpacingForDoWhileStatement, ForInStatement: checkSpacingForForInStatement, ForOfStatement: checkSpacingForForOfStatement, ForStatement: checkSpacingAroundFirstToken, WhileStatement: checkSpacingAroundFirstToken, // Statements - Declarations ClassDeclaration: checkSpacingForClass, ExportNamedDeclaration: checkSpacingForModuleDeclaration, ExportDefaultDeclaration: checkSpacingAroundFirstToken, ExportAllDeclaration: checkSpacingForModuleDeclaration, FunctionDeclaration: checkSpacingForFunction, ImportDeclaration: checkSpacingForModuleDeclaration, VariableDeclaration: checkSpacingAroundFirstToken, // Expressions ArrowFunctionExpression: checkSpacingForFunction, AwaitExpression: checkSpacingForAwaitExpression, ClassExpression: checkSpacingForClass, FunctionExpression: checkSpacingForFunction, NewExpression: checkSpacingBeforeFirstToken, Super: checkSpacingBeforeFirstToken, ThisExpression: checkSpacingBeforeFirstToken, UnaryExpression: checkSpacingBeforeFirstToken, YieldExpression: checkSpacingBeforeFirstToken, // Others ImportNamespaceSpecifier: checkSpacingForImportNamespaceSpecifier, MethodDefinition: checkSpacingForProperty, Property: checkSpacingForProperty }; } }; },{"../ast-utils":67,"../util/keywords":349}],129:[function(require,module,exports){ /** * @fileoverview Rule to enforce the position of line comments * @author Alberto Rodríguez */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce position of line comments", category: "Stylistic Issues", recommended: false }, schema: [{ oneOf: [{ enum: ["above", "beside"] }, { type: "object", properties: { position: { enum: ["above", "beside"] }, ignorePattern: { type: "string" }, applyDefaultPatterns: { type: "boolean" }, applyDefaultIgnorePatterns: { type: "boolean" } }, additionalProperties: false }] }] }, create: function create(context) { var options = context.options[0]; var above = void 0, ignorePattern = void 0, applyDefaultIgnorePatterns = true; if (!options || typeof options === "string") { above = !options || options === "above"; } else { above = options.position === "above"; ignorePattern = options.ignorePattern; if (options.hasOwnProperty("applyDefaultIgnorePatterns")) { applyDefaultIgnorePatterns = options.applyDefaultIgnorePatterns !== false; } else { applyDefaultIgnorePatterns = options.applyDefaultPatterns !== false; } } var defaultIgnoreRegExp = astUtils.COMMENTS_IGNORE_PATTERN; var fallThroughRegExp = /^\s*falls?\s?through/; var customIgnoreRegExp = new RegExp(ignorePattern); var sourceCode = context.getSourceCode(); //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { Program: function Program() { var comments = sourceCode.getAllComments(); comments.filter(function (token) { return token.type === "Line"; }).forEach(function (node) { if (applyDefaultIgnorePatterns && (defaultIgnoreRegExp.test(node.value) || fallThroughRegExp.test(node.value))) { return; } if (ignorePattern && customIgnoreRegExp.test(node.value)) { return; } var previous = sourceCode.getTokenBefore(node, { includeComments: true }); var isOnSameLine = previous && previous.loc.end.line === node.loc.start.line; if (above) { if (isOnSameLine) { context.report({ node: node, message: "Expected comment to be above code." }); } } else { if (!isOnSameLine) { context.report({ node: node, message: "Expected comment to be beside code." }); } } }); } }; } }; },{"../ast-utils":67}],130:[function(require,module,exports){ /** * @fileoverview Rule to enforce a single linebreak style. * @author Erik Mueller */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce consistent linebreak style", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ enum: ["unix", "windows"] }] }, create: function create(context) { var EXPECTED_LF_MSG = "Expected linebreaks to be 'LF' but found 'CRLF'.", EXPECTED_CRLF_MSG = "Expected linebreaks to be 'CRLF' but found 'LF'."; var sourceCode = context.getSourceCode(); //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Builds a fix function that replaces text at the specified range in the source text. * @param {int[]} range The range to replace * @param {string} text The text to insert. * @returns {Function} Fixer function * @private */ function createFix(range, text) { return function (fixer) { return fixer.replaceTextRange(range, text); }; } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { Program: function checkForlinebreakStyle(node) { var linebreakStyle = context.options[0] || "unix", expectedLF = linebreakStyle === "unix", expectedLFChars = expectedLF ? "\n" : "\r\n", source = sourceCode.getText(), pattern = astUtils.createGlobalLinebreakMatcher(); var match = void 0; var i = 0; while ((match = pattern.exec(source)) !== null) { i++; if (match[0] === expectedLFChars) { continue; } var index = match.index; var range = [index, index + match[0].length]; context.report({ node: node, loc: { line: i, column: sourceCode.lines[i - 1].length }, message: expectedLF ? EXPECTED_LF_MSG : EXPECTED_CRLF_MSG, fix: createFix(range, expectedLFChars) }); } } }; } }; },{"../ast-utils":67}],131:[function(require,module,exports){ /** * @fileoverview Enforces empty lines around comments. * @author Jamund Ferguson */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var lodash = require("lodash"), astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Return an array with with any line numbers that are empty. * @param {Array} lines An array of each line of the file. * @returns {Array} An array of line numbers. */ function getEmptyLineNums(lines) { var emptyLines = lines.map(function (line, i) { return { code: line.trim(), num: i + 1 }; }).filter(function (line) { return !line.code; }).map(function (line) { return line.num; }); return emptyLines; } /** * Return an array with with any line numbers that contain comments. * @param {Array} comments An array of comment tokens. * @returns {Array} An array of line numbers. */ function getCommentLineNums(comments) { var lines = []; comments.forEach(function (token) { var start = token.loc.start.line; var end = token.loc.end.line; lines.push(start, end); }); return lines; } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require empty lines around comments", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ type: "object", properties: { beforeBlockComment: { type: "boolean" }, afterBlockComment: { type: "boolean" }, beforeLineComment: { type: "boolean" }, afterLineComment: { type: "boolean" }, allowBlockStart: { type: "boolean" }, allowBlockEnd: { type: "boolean" }, allowObjectStart: { type: "boolean" }, allowObjectEnd: { type: "boolean" }, allowArrayStart: { type: "boolean" }, allowArrayEnd: { type: "boolean" }, ignorePattern: { type: "string" }, applyDefaultIgnorePatterns: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var options = context.options[0] ? Object.assign({}, context.options[0]) : {}; var ignorePattern = options.ignorePattern; var defaultIgnoreRegExp = astUtils.COMMENTS_IGNORE_PATTERN; var customIgnoreRegExp = new RegExp(ignorePattern); var applyDefaultIgnorePatterns = options.applyDefaultIgnorePatterns !== false; options.beforeLineComment = options.beforeLineComment || false; options.afterLineComment = options.afterLineComment || false; options.beforeBlockComment = typeof options.beforeBlockComment !== "undefined" ? options.beforeBlockComment : true; options.afterBlockComment = options.afterBlockComment || false; options.allowBlockStart = options.allowBlockStart || false; options.allowBlockEnd = options.allowBlockEnd || false; var sourceCode = context.getSourceCode(); var lines = sourceCode.lines, numLines = lines.length + 1, comments = sourceCode.getAllComments(), commentLines = getCommentLineNums(comments), emptyLines = getEmptyLineNums(lines), commentAndEmptyLines = commentLines.concat(emptyLines); /** * Returns whether or not comments are on lines starting with or ending with code * @param {token} token The comment token to check. * @returns {boolean} True if the comment is not alone. */ function codeAroundComment(token) { var currentToken = token; do { currentToken = sourceCode.getTokenBefore(currentToken, { includeComments: true }); } while (currentToken && astUtils.isCommentToken(currentToken)); if (currentToken && astUtils.isTokenOnSameLine(currentToken, token)) { return true; } currentToken = token; do { currentToken = sourceCode.getTokenAfter(currentToken, { includeComments: true }); } while (currentToken && astUtils.isCommentToken(currentToken)); if (currentToken && astUtils.isTokenOnSameLine(token, currentToken)) { return true; } return false; } /** * Returns whether or not comments are inside a node type or not. * @param {ASTNode} parent The Comment parent node. * @param {string} nodeType The parent type to check against. * @returns {boolean} True if the comment is inside nodeType. */ function isParentNodeType(parent, nodeType) { return parent.type === nodeType || parent.body && parent.body.type === nodeType || parent.consequent && parent.consequent.type === nodeType; } /** * Returns the parent node that contains the given token. * @param {token} token The token to check. * @returns {ASTNode} The parent node that contains the given token. */ function getParentNodeOfToken(token) { return sourceCode.getNodeByRangeIndex(token.range[0]); } /** * Returns whether or not comments are at the parent start or not. * @param {token} token The Comment token. * @param {string} nodeType The parent type to check against. * @returns {boolean} True if the comment is at parent start. */ function isCommentAtParentStart(token, nodeType) { var parent = getParentNodeOfToken(token); return parent && isParentNodeType(parent, nodeType) && token.loc.start.line - parent.loc.start.line === 1; } /** * Returns whether or not comments are at the parent end or not. * @param {token} token The Comment token. * @param {string} nodeType The parent type to check against. * @returns {boolean} True if the comment is at parent end. */ function isCommentAtParentEnd(token, nodeType) { var parent = getParentNodeOfToken(token); return parent && isParentNodeType(parent, nodeType) && parent.loc.end.line - token.loc.end.line === 1; } /** * Returns whether or not comments are at the block start or not. * @param {token} token The Comment token. * @returns {boolean} True if the comment is at block start. */ function isCommentAtBlockStart(token) { return isCommentAtParentStart(token, "ClassBody") || isCommentAtParentStart(token, "BlockStatement") || isCommentAtParentStart(token, "SwitchCase"); } /** * Returns whether or not comments are at the block end or not. * @param {token} token The Comment token. * @returns {boolean} True if the comment is at block end. */ function isCommentAtBlockEnd(token) { return isCommentAtParentEnd(token, "ClassBody") || isCommentAtParentEnd(token, "BlockStatement") || isCommentAtParentEnd(token, "SwitchCase") || isCommentAtParentEnd(token, "SwitchStatement"); } /** * Returns whether or not comments are at the object start or not. * @param {token} token The Comment token. * @returns {boolean} True if the comment is at object start. */ function isCommentAtObjectStart(token) { return isCommentAtParentStart(token, "ObjectExpression") || isCommentAtParentStart(token, "ObjectPattern"); } /** * Returns whether or not comments are at the object end or not. * @param {token} token The Comment token. * @returns {boolean} True if the comment is at object end. */ function isCommentAtObjectEnd(token) { return isCommentAtParentEnd(token, "ObjectExpression") || isCommentAtParentEnd(token, "ObjectPattern"); } /** * Returns whether or not comments are at the array start or not. * @param {token} token The Comment token. * @returns {boolean} True if the comment is at array start. */ function isCommentAtArrayStart(token) { return isCommentAtParentStart(token, "ArrayExpression") || isCommentAtParentStart(token, "ArrayPattern"); } /** * Returns whether or not comments are at the array end or not. * @param {token} token The Comment token. * @returns {boolean} True if the comment is at array end. */ function isCommentAtArrayEnd(token) { return isCommentAtParentEnd(token, "ArrayExpression") || isCommentAtParentEnd(token, "ArrayPattern"); } /** * Checks if a comment token has lines around it (ignores inline comments) * @param {token} token The Comment token. * @param {Object} opts Options to determine the newline. * @param {boolean} opts.after Should have a newline after this line. * @param {boolean} opts.before Should have a newline before this line. * @returns {void} */ function checkForEmptyLine(token, opts) { if (applyDefaultIgnorePatterns && defaultIgnoreRegExp.test(token.value)) { return; } if (ignorePattern && customIgnoreRegExp.test(token.value)) { return; } var after = opts.after, before = opts.before; var prevLineNum = token.loc.start.line - 1, nextLineNum = token.loc.end.line + 1, commentIsNotAlone = codeAroundComment(token); var blockStartAllowed = options.allowBlockStart && isCommentAtBlockStart(token), blockEndAllowed = options.allowBlockEnd && isCommentAtBlockEnd(token), objectStartAllowed = options.allowObjectStart && isCommentAtObjectStart(token), objectEndAllowed = options.allowObjectEnd && isCommentAtObjectEnd(token), arrayStartAllowed = options.allowArrayStart && isCommentAtArrayStart(token), arrayEndAllowed = options.allowArrayEnd && isCommentAtArrayEnd(token); var exceptionStartAllowed = blockStartAllowed || objectStartAllowed || arrayStartAllowed; var exceptionEndAllowed = blockEndAllowed || objectEndAllowed || arrayEndAllowed; // ignore top of the file and bottom of the file if (prevLineNum < 1) { before = false; } if (nextLineNum >= numLines) { after = false; } // we ignore all inline comments if (commentIsNotAlone) { return; } var previousTokenOrComment = sourceCode.getTokenBefore(token, { includeComments: true }); var nextTokenOrComment = sourceCode.getTokenAfter(token, { includeComments: true }); // check for newline before if (!exceptionStartAllowed && before && !lodash.includes(commentAndEmptyLines, prevLineNum) && !(astUtils.isCommentToken(previousTokenOrComment) && astUtils.isTokenOnSameLine(previousTokenOrComment, token))) { var lineStart = token.range[0] - token.loc.start.column; var range = [lineStart, lineStart]; context.report({ node: token, message: "Expected line before comment.", fix: function fix(fixer) { return fixer.insertTextBeforeRange(range, "\n"); } }); } // check for newline after if (!exceptionEndAllowed && after && !lodash.includes(commentAndEmptyLines, nextLineNum) && !(astUtils.isCommentToken(nextTokenOrComment) && astUtils.isTokenOnSameLine(token, nextTokenOrComment))) { context.report({ node: token, message: "Expected line after comment.", fix: function fix(fixer) { return fixer.insertTextAfter(token, "\n"); } }); } } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { Program: function Program() { comments.forEach(function (token) { if (token.type === "Line") { if (options.beforeLineComment || options.afterLineComment) { checkForEmptyLine(token, { after: options.afterLineComment, before: options.beforeLineComment }); } } else if (token.type === "Block") { if (options.beforeBlockComment || options.afterBlockComment) { checkForEmptyLine(token, { after: options.afterBlockComment, before: options.beforeBlockComment }); } } }); } }; } }; },{"../ast-utils":67,"lodash":48}],132:[function(require,module,exports){ /** * @fileoverview Require or disallow newlines around directives. * @author Kai Cataldo * @deprecated */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require or disallow newlines around directives", category: "Stylistic Issues", recommended: false, replacedBy: ["padding-line-between-statements"] }, schema: [{ oneOf: [{ enum: ["always", "never"] }, { type: "object", properties: { before: { enum: ["always", "never"] }, after: { enum: ["always", "never"] } }, additionalProperties: false, minProperties: 2 }] }], fixable: "whitespace", deprecated: true }, create: function create(context) { var sourceCode = context.getSourceCode(); var config = context.options[0] || "always"; var expectLineBefore = typeof config === "string" ? config : config.before; var expectLineAfter = typeof config === "string" ? config : config.after; //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Check if node is preceded by a blank newline. * @param {ASTNode} node Node to check. * @returns {boolean} Whether or not the passed in node is preceded by a blank newline. */ function hasNewlineBefore(node) { var tokenBefore = sourceCode.getTokenBefore(node, { includeComments: true }); var tokenLineBefore = tokenBefore ? tokenBefore.loc.end.line : 0; return node.loc.start.line - tokenLineBefore >= 2; } /** * Gets the last token of a node that is on the same line as the rest of the node. * This will usually be the last token of the node, but it will be the second-to-last token if the node has a trailing * semicolon on a different line. * @param {ASTNode} node A directive node * @returns {Token} The last token of the node on the line */ function getLastTokenOnLine(node) { var lastToken = sourceCode.getLastToken(node); var secondToLastToken = sourceCode.getTokenBefore(lastToken); return astUtils.isSemicolonToken(lastToken) && lastToken.loc.start.line > secondToLastToken.loc.end.line ? secondToLastToken : lastToken; } /** * Check if node is followed by a blank newline. * @param {ASTNode} node Node to check. * @returns {boolean} Whether or not the passed in node is followed by a blank newline. */ function hasNewlineAfter(node) { var lastToken = getLastTokenOnLine(node); var tokenAfter = sourceCode.getTokenAfter(lastToken, { includeComments: true }); return tokenAfter.loc.start.line - lastToken.loc.end.line >= 2; } /** * Report errors for newlines around directives. * @param {ASTNode} node Node to check. * @param {string} location Whether the error was found before or after the directive. * @param {boolean} expected Whether or not a newline was expected or unexpected. * @returns {void} */ function reportError(node, location, expected) { context.report({ node: node, message: "{{expected}} newline {{location}} \"{{value}}\" directive.", data: { expected: expected ? "Expected" : "Unexpected", value: node.expression.value, location: location }, fix: function fix(fixer) { var lastToken = getLastTokenOnLine(node); if (expected) { return location === "before" ? fixer.insertTextBefore(node, "\n") : fixer.insertTextAfter(lastToken, "\n"); } return fixer.removeRange(location === "before" ? [node.range[0] - 1, node.range[0]] : [lastToken.range[1], lastToken.range[1] + 1]); } }); } /** * Check lines around directives in node * @param {ASTNode} node - node to check * @returns {void} */ function checkDirectives(node) { var directives = astUtils.getDirectivePrologue(node); if (!directives.length) { return; } var firstDirective = directives[0]; var leadingComments = sourceCode.getCommentsBefore(firstDirective); // Only check before the first directive if it is preceded by a comment or if it is at the top of // the file and expectLineBefore is set to "never". This is to not force a newline at the top of // the file if there are no comments as well as for compatibility with padded-blocks. if (leadingComments.length) { if (expectLineBefore === "always" && !hasNewlineBefore(firstDirective)) { reportError(firstDirective, "before", true); } if (expectLineBefore === "never" && hasNewlineBefore(firstDirective)) { reportError(firstDirective, "before", false); } } else if (node.type === "Program" && expectLineBefore === "never" && !leadingComments.length && hasNewlineBefore(firstDirective)) { reportError(firstDirective, "before", false); } var lastDirective = directives[directives.length - 1]; var statements = node.type === "Program" ? node.body : node.body.body; // Do not check after the last directive if the body only // contains a directive prologue and isn't followed by a comment to ensure // this rule behaves well with padded-blocks. if (lastDirective === statements[statements.length - 1] && !lastDirective.trailingComments) { return; } if (expectLineAfter === "always" && !hasNewlineAfter(lastDirective)) { reportError(lastDirective, "after", true); } if (expectLineAfter === "never" && hasNewlineAfter(lastDirective)) { reportError(lastDirective, "after", false); } } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { Program: checkDirectives, FunctionDeclaration: checkDirectives, FunctionExpression: checkDirectives, ArrowFunctionExpression: checkDirectives }; } }; },{"../ast-utils":67}],133:[function(require,module,exports){ /** * @fileoverview A rule to set the maximum depth block can be nested in a function. * @author Ian Christian Myers */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; module.exports = { meta: { docs: { description: "enforce a maximum depth that blocks can be nested", category: "Stylistic Issues", recommended: false }, schema: [{ oneOf: [{ type: "integer", minimum: 0 }, { type: "object", properties: { maximum: { type: "integer", minimum: 0 }, max: { type: "integer", minimum: 0 } }, additionalProperties: false }] }] }, create: function create(context) { //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- var functionStack = [], option = context.options[0]; var maxDepth = 4; if ((typeof option === "undefined" ? "undefined" : _typeof(option)) === "object" && option.hasOwnProperty("maximum") && typeof option.maximum === "number") { maxDepth = option.maximum; } if ((typeof option === "undefined" ? "undefined" : _typeof(option)) === "object" && option.hasOwnProperty("max") && typeof option.max === "number") { maxDepth = option.max; } if (typeof option === "number") { maxDepth = option; } /** * When parsing a new function, store it in our function stack * @returns {void} * @private */ function startFunction() { functionStack.push(0); } /** * When parsing is done then pop out the reference * @returns {void} * @private */ function endFunction() { functionStack.pop(); } /** * Save the block and Evaluate the node * @param {ASTNode} node node to evaluate * @returns {void} * @private */ function pushBlock(node) { var len = ++functionStack[functionStack.length - 1]; if (len > maxDepth) { context.report({ node: node, message: "Blocks are nested too deeply ({{depth}}).", data: { depth: len } }); } } /** * Pop the saved block * @returns {void} * @private */ function popBlock() { functionStack[functionStack.length - 1]--; } //-------------------------------------------------------------------------- // Public API //-------------------------------------------------------------------------- return { Program: startFunction, FunctionDeclaration: startFunction, FunctionExpression: startFunction, ArrowFunctionExpression: startFunction, IfStatement: function IfStatement(node) { if (node.parent.type !== "IfStatement") { pushBlock(node); } }, SwitchStatement: pushBlock, TryStatement: pushBlock, DoWhileStatement: pushBlock, WhileStatement: pushBlock, WithStatement: pushBlock, ForStatement: pushBlock, ForInStatement: pushBlock, ForOfStatement: pushBlock, "IfStatement:exit": popBlock, "SwitchStatement:exit": popBlock, "TryStatement:exit": popBlock, "DoWhileStatement:exit": popBlock, "WhileStatement:exit": popBlock, "WithStatement:exit": popBlock, "ForStatement:exit": popBlock, "ForInStatement:exit": popBlock, "ForOfStatement:exit": popBlock, "FunctionDeclaration:exit": endFunction, "FunctionExpression:exit": endFunction, "ArrowFunctionExpression:exit": endFunction, "Program:exit": endFunction }; } }; },{}],134:[function(require,module,exports){ /** * @fileoverview Rule to check for max length on a line. * @author Matt DuVall */ "use strict"; //------------------------------------------------------------------------------ // Constants //------------------------------------------------------------------------------ var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; var OPTIONS_SCHEMA = { type: "object", properties: { code: { type: "integer", minimum: 0 }, comments: { type: "integer", minimum: 0 }, tabWidth: { type: "integer", minimum: 0 }, ignorePattern: { type: "string" }, ignoreComments: { type: "boolean" }, ignoreStrings: { type: "boolean" }, ignoreUrls: { type: "boolean" }, ignoreTemplateLiterals: { type: "boolean" }, ignoreRegExpLiterals: { type: "boolean" }, ignoreTrailingComments: { type: "boolean" } }, additionalProperties: false }; var OPTIONS_OR_INTEGER_SCHEMA = { anyOf: [OPTIONS_SCHEMA, { type: "integer", minimum: 0 }] }; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce a maximum line length", category: "Stylistic Issues", recommended: false }, schema: [OPTIONS_OR_INTEGER_SCHEMA, OPTIONS_OR_INTEGER_SCHEMA, OPTIONS_SCHEMA] }, create: function create(context) { /* * Inspired by http://tools.ietf.org/html/rfc3986#appendix-B, however: * - They're matching an entire string that we know is a URI * - We're matching part of a string where we think there *might* be a URL * - We're only concerned about URLs, as picking out any URI would cause * too many false positives * - We don't care about matching the entire URL, any small segment is fine */ var URL_REGEXP = /[^:/?#]:\/\/[^?#]/; var sourceCode = context.getSourceCode(); /** * Computes the length of a line that may contain tabs. The width of each * tab will be the number of spaces to the next tab stop. * @param {string} line The line. * @param {int} tabWidth The width of each tab stop in spaces. * @returns {int} The computed line length. * @private */ function computeLineLength(line, tabWidth) { var extraCharacterCount = 0; line.replace(/\t/g, function (match, offset) { var totalOffset = offset + extraCharacterCount, previousTabStopOffset = tabWidth ? totalOffset % tabWidth : 0, spaceCount = tabWidth - previousTabStopOffset; extraCharacterCount += spaceCount - 1; // -1 for the replaced tab }); return Array.from(line).length + extraCharacterCount; } // The options object must be the last option specified… var lastOption = context.options[context.options.length - 1]; var options = (typeof lastOption === "undefined" ? "undefined" : _typeof(lastOption)) === "object" ? Object.create(lastOption) : {}; // …but max code length… if (typeof context.options[0] === "number") { options.code = context.options[0]; } // …and tabWidth can be optionally specified directly as integers. if (typeof context.options[1] === "number") { options.tabWidth = context.options[1]; } var maxLength = options.code || 80, tabWidth = options.tabWidth || 4, ignoreComments = options.ignoreComments || false, ignoreStrings = options.ignoreStrings || false, ignoreTemplateLiterals = options.ignoreTemplateLiterals || false, ignoreRegExpLiterals = options.ignoreRegExpLiterals || false, ignoreTrailingComments = options.ignoreTrailingComments || options.ignoreComments || false, ignoreUrls = options.ignoreUrls || false, maxCommentLength = options.comments; var ignorePattern = options.ignorePattern || null; if (ignorePattern) { ignorePattern = new RegExp(ignorePattern); } //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Tells if a given comment is trailing: it starts on the current line and * extends to or past the end of the current line. * @param {string} line The source line we want to check for a trailing comment on * @param {number} lineNumber The one-indexed line number for line * @param {ASTNode} comment The comment to inspect * @returns {boolean} If the comment is trailing on the given line */ function isTrailingComment(line, lineNumber, comment) { return comment && comment.loc.start.line === lineNumber && lineNumber <= comment.loc.end.line && (comment.loc.end.line > lineNumber || comment.loc.end.column === line.length); } /** * Tells if a comment encompasses the entire line. * @param {string} line The source line with a trailing comment * @param {number} lineNumber The one-indexed line number this is on * @param {ASTNode} comment The comment to remove * @returns {boolean} If the comment covers the entire line */ function isFullLineComment(line, lineNumber, comment) { var start = comment.loc.start, end = comment.loc.end, isFirstTokenOnLine = !line.slice(0, comment.loc.start.column).trim(); return comment && (start.line < lineNumber || start.line === lineNumber && isFirstTokenOnLine) && (end.line > lineNumber || end.line === lineNumber && end.column === line.length); } /** * Gets the line after the comment and any remaining trailing whitespace is * stripped. * @param {string} line The source line with a trailing comment * @param {number} lineNumber The one-indexed line number this is on * @param {ASTNode} comment The comment to remove * @returns {string} Line without comment and trailing whitepace */ function stripTrailingComment(line, lineNumber, comment) { // loc.column is zero-indexed return line.slice(0, comment.loc.start.column).replace(/\s+$/, ""); } /** * Ensure that an array exists at [key] on `object`, and add `value` to it. * * @param {Object} object the object to mutate * @param {string} key the object's key * @param {*} value the value to add * @returns {void} * @private */ function ensureArrayAndPush(object, key, value) { if (!Array.isArray(object[key])) { object[key] = []; } object[key].push(value); } /** * Retrieves an array containing all strings (" or ') in the source code. * * @returns {ASTNode[]} An array of string nodes. */ function getAllStrings() { return sourceCode.ast.tokens.filter(function (token) { return token.type === "String"; }); } /** * Retrieves an array containing all template literals in the source code. * * @returns {ASTNode[]} An array of template literal nodes. */ function getAllTemplateLiterals() { return sourceCode.ast.tokens.filter(function (token) { return token.type === "Template"; }); } /** * Retrieves an array containing all RegExp literals in the source code. * * @returns {ASTNode[]} An array of RegExp literal nodes. */ function getAllRegExpLiterals() { return sourceCode.ast.tokens.filter(function (token) { return token.type === "RegularExpression"; }); } /** * A reducer to group an AST node by line number, both start and end. * * @param {Object} acc the accumulator * @param {ASTNode} node the AST node in question * @returns {Object} the modified accumulator * @private */ function groupByLineNumber(acc, node) { for (var i = node.loc.start.line; i <= node.loc.end.line; ++i) { ensureArrayAndPush(acc, i, node); } return acc; } /** * Check the program for max length * @param {ASTNode} node Node to examine * @returns {void} * @private */ function checkProgramForMaxLength(node) { // split (honors line-ending) var lines = sourceCode.lines, // list of comments to ignore comments = ignoreComments || maxCommentLength || ignoreTrailingComments ? sourceCode.getAllComments() : []; // we iterate over comments in parallel with the lines var commentsIndex = 0; var strings = getAllStrings(); var stringsByLine = strings.reduce(groupByLineNumber, {}); var templateLiterals = getAllTemplateLiterals(); var templateLiteralsByLine = templateLiterals.reduce(groupByLineNumber, {}); var regExpLiterals = getAllRegExpLiterals(); var regExpLiteralsByLine = regExpLiterals.reduce(groupByLineNumber, {}); lines.forEach(function (line, i) { // i is zero-indexed, line numbers are one-indexed var lineNumber = i + 1; /* * if we're checking comment length; we need to know whether this * line is a comment */ var lineIsComment = false; /* * We can short-circuit the comment checks if we're already out of * comments to check. */ if (commentsIndex < comments.length) { var comment = null; // iterate over comments until we find one past the current line do { comment = comments[++commentsIndex]; } while (comment && comment.loc.start.line <= lineNumber); // and step back by one comment = comments[--commentsIndex]; if (isFullLineComment(line, lineNumber, comment)) { lineIsComment = true; } else if (ignoreTrailingComments && isTrailingComment(line, lineNumber, comment)) { line = stripTrailingComment(line, lineNumber, comment); } } if (ignorePattern && ignorePattern.test(line) || ignoreUrls && URL_REGEXP.test(line) || ignoreStrings && stringsByLine[lineNumber] || ignoreTemplateLiterals && templateLiteralsByLine[lineNumber] || ignoreRegExpLiterals && regExpLiteralsByLine[lineNumber]) { // ignore this line return; } var lineLength = computeLineLength(line, tabWidth); var commentLengthApplies = lineIsComment && maxCommentLength; if (lineIsComment && ignoreComments) { return; } if (commentLengthApplies) { if (lineLength > maxCommentLength) { context.report({ node: node, loc: { line: lineNumber, column: 0 }, message: "Line {{lineNumber}} exceeds the maximum comment line length of {{maxCommentLength}}.", data: { lineNumber: i + 1, maxCommentLength: maxCommentLength } }); } } else if (lineLength > maxLength) { context.report({ node: node, loc: { line: lineNumber, column: 0 }, message: "Line {{lineNumber}} exceeds the maximum line length of {{maxLength}}.", data: { lineNumber: i + 1, maxLength: maxLength } }); } }); } //-------------------------------------------------------------------------- // Public API //-------------------------------------------------------------------------- return { Program: checkProgramForMaxLength }; } }; },{}],135:[function(require,module,exports){ /** * @fileoverview enforce a maximum file length * @author Alberto Rodríguez */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; var lodash = require("lodash"); var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce a maximum number of lines per file", category: "Stylistic Issues", recommended: false }, schema: [{ oneOf: [{ type: "integer", minimum: 0 }, { type: "object", properties: { max: { type: "integer", minimum: 0 }, skipComments: { type: "boolean" }, skipBlankLines: { type: "boolean" } }, additionalProperties: false }] }] }, create: function create(context) { var option = context.options[0]; var max = 300; if ((typeof option === "undefined" ? "undefined" : _typeof(option)) === "object" && option.hasOwnProperty("max") && typeof option.max === "number") { max = option.max; } if (typeof option === "number") { max = option; } var skipComments = option && option.skipComments; var skipBlankLines = option && option.skipBlankLines; var sourceCode = context.getSourceCode(); /** * Returns whether or not a token is a comment node type * @param {Token} token The token to check * @returns {boolean} True if the token is a comment node */ function isCommentNodeType(token) { return token && (token.type === "Block" || token.type === "Line"); } /** * Returns the line numbers of a comment that don't have any code on the same line * @param {Node} comment The comment node to check * @returns {int[]} The line numbers */ function getLinesWithoutCode(comment) { var start = comment.loc.start.line; var end = comment.loc.end.line; var token = void 0; token = comment; do { token = sourceCode.getTokenBefore(token, { includeComments: true }); } while (isCommentNodeType(token)); if (token && astUtils.isTokenOnSameLine(token, comment)) { start += 1; } token = comment; do { token = sourceCode.getTokenAfter(token, { includeComments: true }); } while (isCommentNodeType(token)); if (token && astUtils.isTokenOnSameLine(comment, token)) { end -= 1; } if (start <= end) { return lodash.range(start, end + 1); } return []; } return { "Program:exit": function ProgramExit() { var lines = sourceCode.lines.map(function (text, i) { return { lineNumber: i + 1, text: text }; }); if (skipBlankLines) { lines = lines.filter(function (l) { return l.text.trim() !== ""; }); } if (skipComments) { var comments = sourceCode.getAllComments(); var commentLines = lodash.flatten(comments.map(function (comment) { return getLinesWithoutCode(comment); })); lines = lines.filter(function (l) { return !lodash.includes(commentLines, l.lineNumber); }); } if (lines.length > max) { context.report({ loc: { line: 1, column: 0 }, message: "File must be at most {{max}} lines long. It's {{actual}} lines long.", data: { max: max, actual: lines.length } }); } } }; } }; },{"../ast-utils":67,"lodash":48}],136:[function(require,module,exports){ /** * @fileoverview Rule to enforce a maximum number of nested callbacks. * @author Ian Christian Myers */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; module.exports = { meta: { docs: { description: "enforce a maximum depth that callbacks can be nested", category: "Stylistic Issues", recommended: false }, schema: [{ oneOf: [{ type: "integer", minimum: 0 }, { type: "object", properties: { maximum: { type: "integer", minimum: 0 }, max: { type: "integer", minimum: 0 } }, additionalProperties: false }] }] }, create: function create(context) { //-------------------------------------------------------------------------- // Constants //-------------------------------------------------------------------------- var option = context.options[0]; var THRESHOLD = 10; if ((typeof option === "undefined" ? "undefined" : _typeof(option)) === "object" && option.hasOwnProperty("maximum") && typeof option.maximum === "number") { THRESHOLD = option.maximum; } if ((typeof option === "undefined" ? "undefined" : _typeof(option)) === "object" && option.hasOwnProperty("max") && typeof option.max === "number") { THRESHOLD = option.max; } if (typeof option === "number") { THRESHOLD = option; } //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- var callbackStack = []; /** * Checks a given function node for too many callbacks. * @param {ASTNode} node The node to check. * @returns {void} * @private */ function checkFunction(node) { var parent = node.parent; if (parent.type === "CallExpression") { callbackStack.push(node); } if (callbackStack.length > THRESHOLD) { var opts = { num: callbackStack.length, max: THRESHOLD }; context.report({ node: node, message: "Too many nested callbacks ({{num}}). Maximum allowed is {{max}}.", data: opts }); } } /** * Pops the call stack. * @returns {void} * @private */ function popStack() { callbackStack.pop(); } //-------------------------------------------------------------------------- // Public API //-------------------------------------------------------------------------- return { ArrowFunctionExpression: checkFunction, "ArrowFunctionExpression:exit": popStack, FunctionExpression: checkFunction, "FunctionExpression:exit": popStack }; } }; },{}],137:[function(require,module,exports){ /** * @fileoverview Rule to flag when a function has too many parameters * @author Ilya Volodin */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; var lodash = require("lodash"); var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce a maximum number of parameters in function definitions", category: "Stylistic Issues", recommended: false }, schema: [{ oneOf: [{ type: "integer", minimum: 0 }, { type: "object", properties: { maximum: { type: "integer", minimum: 0 }, max: { type: "integer", minimum: 0 } }, additionalProperties: false }] }] }, create: function create(context) { var option = context.options[0]; var numParams = 3; if ((typeof option === "undefined" ? "undefined" : _typeof(option)) === "object" && option.hasOwnProperty("maximum") && typeof option.maximum === "number") { numParams = option.maximum; } if ((typeof option === "undefined" ? "undefined" : _typeof(option)) === "object" && option.hasOwnProperty("max") && typeof option.max === "number") { numParams = option.max; } if (typeof option === "number") { numParams = option; } /** * Checks a function to see if it has too many parameters. * @param {ASTNode} node The node to check. * @returns {void} * @private */ function checkFunction(node) { if (node.params.length > numParams) { context.report({ node: node, message: "{{name}} has too many parameters ({{count}}). Maximum allowed is {{max}}.", data: { name: lodash.upperFirst(astUtils.getFunctionNameWithKind(node)), count: node.params.length, max: numParams } }); } } return { FunctionDeclaration: checkFunction, ArrowFunctionExpression: checkFunction, FunctionExpression: checkFunction }; } }; },{"../ast-utils":67,"lodash":48}],138:[function(require,module,exports){ /** * @fileoverview Specify the maximum number of statements allowed per line. * @author Kenneth Williams */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce a maximum number of statements allowed per line", category: "Stylistic Issues", recommended: false }, schema: [{ type: "object", properties: { max: { type: "integer", minimum: 1 } }, additionalProperties: false }] }, create: function create(context) { var sourceCode = context.getSourceCode(), options = context.options[0] || {}, maxStatementsPerLine = typeof options.max !== "undefined" ? options.max : 1, message = "This line has {{numberOfStatementsOnThisLine}} {{statements}}. Maximum allowed is {{maxStatementsPerLine}}."; var lastStatementLine = 0, numberOfStatementsOnThisLine = 0, firstExtraStatement = void 0; //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- var SINGLE_CHILD_ALLOWED = /^(?:(?:DoWhile|For|ForIn|ForOf|If|Labeled|While)Statement|Export(?:Default|Named)Declaration)$/; /** * Reports with the first extra statement, and clears it. * * @returns {void} */ function reportFirstExtraStatementAndClear() { if (firstExtraStatement) { context.report({ node: firstExtraStatement, message: message, data: { numberOfStatementsOnThisLine: numberOfStatementsOnThisLine, maxStatementsPerLine: maxStatementsPerLine, statements: numberOfStatementsOnThisLine === 1 ? "statement" : "statements" } }); } firstExtraStatement = null; } /** * Gets the actual last token of a given node. * * @param {ASTNode} node - A node to get. This is a node except EmptyStatement. * @returns {Token} The actual last token. */ function getActualLastToken(node) { return sourceCode.getLastToken(node, astUtils.isNotSemicolonToken); } /** * Addresses a given node. * It updates the state of this rule, then reports the node if the node violated this rule. * * @param {ASTNode} node - A node to check. * @returns {void} */ function enterStatement(node) { var line = node.loc.start.line; // Skip to allow non-block statements if this is direct child of control statements. // `if (a) foo();` is counted as 1. // But `if (a) foo(); else foo();` should be counted as 2. if (SINGLE_CHILD_ALLOWED.test(node.parent.type) && node.parent.alternate !== node) { return; } // Update state. if (line === lastStatementLine) { numberOfStatementsOnThisLine += 1; } else { reportFirstExtraStatementAndClear(); numberOfStatementsOnThisLine = 1; lastStatementLine = line; } // Reports if the node violated this rule. if (numberOfStatementsOnThisLine === maxStatementsPerLine + 1) { firstExtraStatement = firstExtraStatement || node; } } /** * Updates the state of this rule with the end line of leaving node to check with the next statement. * * @param {ASTNode} node - A node to check. * @returns {void} */ function leaveStatement(node) { var line = getActualLastToken(node).loc.end.line; // Update state. if (line !== lastStatementLine) { reportFirstExtraStatementAndClear(); numberOfStatementsOnThisLine = 1; lastStatementLine = line; } } //-------------------------------------------------------------------------- // Public API //-------------------------------------------------------------------------- return { BreakStatement: enterStatement, ClassDeclaration: enterStatement, ContinueStatement: enterStatement, DebuggerStatement: enterStatement, DoWhileStatement: enterStatement, ExpressionStatement: enterStatement, ForInStatement: enterStatement, ForOfStatement: enterStatement, ForStatement: enterStatement, FunctionDeclaration: enterStatement, IfStatement: enterStatement, ImportDeclaration: enterStatement, LabeledStatement: enterStatement, ReturnStatement: enterStatement, SwitchStatement: enterStatement, ThrowStatement: enterStatement, TryStatement: enterStatement, VariableDeclaration: enterStatement, WhileStatement: enterStatement, WithStatement: enterStatement, ExportNamedDeclaration: enterStatement, ExportDefaultDeclaration: enterStatement, ExportAllDeclaration: enterStatement, "BreakStatement:exit": leaveStatement, "ClassDeclaration:exit": leaveStatement, "ContinueStatement:exit": leaveStatement, "DebuggerStatement:exit": leaveStatement, "DoWhileStatement:exit": leaveStatement, "ExpressionStatement:exit": leaveStatement, "ForInStatement:exit": leaveStatement, "ForOfStatement:exit": leaveStatement, "ForStatement:exit": leaveStatement, "FunctionDeclaration:exit": leaveStatement, "IfStatement:exit": leaveStatement, "ImportDeclaration:exit": leaveStatement, "LabeledStatement:exit": leaveStatement, "ReturnStatement:exit": leaveStatement, "SwitchStatement:exit": leaveStatement, "ThrowStatement:exit": leaveStatement, "TryStatement:exit": leaveStatement, "VariableDeclaration:exit": leaveStatement, "WhileStatement:exit": leaveStatement, "WithStatement:exit": leaveStatement, "ExportNamedDeclaration:exit": leaveStatement, "ExportDefaultDeclaration:exit": leaveStatement, "ExportAllDeclaration:exit": leaveStatement, "Program:exit": reportFirstExtraStatementAndClear }; } }; },{"../ast-utils":67}],139:[function(require,module,exports){ /** * @fileoverview A rule to set the maximum number of statements in a function. * @author Ian Christian Myers */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; var lodash = require("lodash"); var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce a maximum number of statements allowed in function blocks", category: "Stylistic Issues", recommended: false }, schema: [{ oneOf: [{ type: "integer", minimum: 0 }, { type: "object", properties: { maximum: { type: "integer", minimum: 0 }, max: { type: "integer", minimum: 0 } }, additionalProperties: false }] }, { type: "object", properties: { ignoreTopLevelFunctions: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- var functionStack = [], option = context.options[0], ignoreTopLevelFunctions = context.options[1] && context.options[1].ignoreTopLevelFunctions || false, topLevelFunctions = []; var maxStatements = 10; if ((typeof option === "undefined" ? "undefined" : _typeof(option)) === "object" && option.hasOwnProperty("maximum") && typeof option.maximum === "number") { maxStatements = option.maximum; } if ((typeof option === "undefined" ? "undefined" : _typeof(option)) === "object" && option.hasOwnProperty("max") && typeof option.max === "number") { maxStatements = option.max; } if (typeof option === "number") { maxStatements = option; } /** * Reports a node if it has too many statements * @param {ASTNode} node node to evaluate * @param {int} count Number of statements in node * @param {int} max Maximum number of statements allowed * @returns {void} * @private */ function reportIfTooManyStatements(node, count, max) { if (count > max) { var name = lodash.upperFirst(astUtils.getFunctionNameWithKind(node)); context.report({ node: node, message: "{{name}} has too many statements ({{count}}). Maximum allowed is {{max}}.", data: { name: name, count: count, max: max } }); } } /** * When parsing a new function, store it in our function stack * @returns {void} * @private */ function startFunction() { functionStack.push(0); } /** * Evaluate the node at the end of function * @param {ASTNode} node node to evaluate * @returns {void} * @private */ function endFunction(node) { var count = functionStack.pop(); if (ignoreTopLevelFunctions && functionStack.length === 0) { topLevelFunctions.push({ node: node, count: count }); } else { reportIfTooManyStatements(node, count, maxStatements); } } /** * Increment the count of the functions * @param {ASTNode} node node to evaluate * @returns {void} * @private */ function countStatements(node) { functionStack[functionStack.length - 1] += node.body.length; } //-------------------------------------------------------------------------- // Public API //-------------------------------------------------------------------------- return { FunctionDeclaration: startFunction, FunctionExpression: startFunction, ArrowFunctionExpression: startFunction, BlockStatement: countStatements, "FunctionDeclaration:exit": endFunction, "FunctionExpression:exit": endFunction, "ArrowFunctionExpression:exit": endFunction, "Program:exit": function ProgramExit() { if (topLevelFunctions.length === 1) { return; } topLevelFunctions.forEach(function (element) { var count = element.count; var node = element.node; reportIfTooManyStatements(node, count, maxStatements); }); } }; } }; },{"../ast-utils":67,"lodash":48}],140:[function(require,module,exports){ /** * @fileoverview Enforce newlines between operands of ternary expressions * @author Kai Cataldo */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce newlines between operands of ternary expressions", category: "Stylistic Issues", recommended: false }, schema: [{ enum: ["always", "never"] }] }, create: function create(context) { var multiline = context.options[0] !== "never"; //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Tests whether node is preceded by supplied tokens * @param {ASTNode} node - node to check * @param {ASTNode} parentNode - parent of node to report * @param {boolean} expected - whether newline was expected or not * @returns {void} * @private */ function reportError(node, parentNode, expected) { context.report({ node: node, message: "{{expected}} newline between {{typeOfError}} of ternary expression.", data: { expected: expected ? "Expected" : "Unexpected", typeOfError: node === parentNode.test ? "test and consequent" : "consequent and alternate" } }); } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { ConditionalExpression: function ConditionalExpression(node) { var areTestAndConsequentOnSameLine = astUtils.isTokenOnSameLine(node.test, node.consequent); var areConsequentAndAlternateOnSameLine = astUtils.isTokenOnSameLine(node.consequent, node.alternate); if (!multiline) { if (!areTestAndConsequentOnSameLine) { reportError(node.test, node, false); } if (!areConsequentAndAlternateOnSameLine) { reportError(node.consequent, node, false); } } else { if (areTestAndConsequentOnSameLine) { reportError(node.test, node, true); } if (areConsequentAndAlternateOnSameLine) { reportError(node.consequent, node, true); } } } }; } }; },{"../ast-utils":67}],141:[function(require,module,exports){ /** * @fileoverview Rule to flag use of constructors without capital letters * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var CAPS_ALLOWED = ["Array", "Boolean", "Date", "Error", "Function", "Number", "Object", "RegExp", "String", "Symbol"]; /** * Ensure that if the key is provided, it must be an array. * @param {Object} obj Object to check with `key`. * @param {string} key Object key to check on `obj`. * @param {*} fallback If obj[key] is not present, this will be returned. * @returns {string[]} Returns obj[key] if it's an Array, otherwise `fallback` */ function checkArray(obj, key, fallback) { /* istanbul ignore if */ if (Object.prototype.hasOwnProperty.call(obj, key) && !Array.isArray(obj[key])) { throw new TypeError(key + ", if provided, must be an Array"); } return obj[key] || fallback; } /** * A reducer function to invert an array to an Object mapping the string form of the key, to `true`. * @param {Object} map Accumulator object for the reduce. * @param {string} key Object key to set to `true`. * @returns {Object} Returns the updated Object for further reduction. */ function invert(map, key) { map[key] = true; return map; } /** * Creates an object with the cap is new exceptions as its keys and true as their values. * @param {Object} config Rule configuration * @returns {Object} Object with cap is new exceptions. */ function calculateCapIsNewExceptions(config) { var capIsNewExceptions = checkArray(config, "capIsNewExceptions", CAPS_ALLOWED); if (capIsNewExceptions !== CAPS_ALLOWED) { capIsNewExceptions = capIsNewExceptions.concat(CAPS_ALLOWED); } return capIsNewExceptions.reduce(invert, {}); } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require constructor names to begin with a capital letter", category: "Stylistic Issues", recommended: false }, schema: [{ type: "object", properties: { newIsCap: { type: "boolean" }, capIsNew: { type: "boolean" }, newIsCapExceptions: { type: "array", items: { type: "string" } }, newIsCapExceptionPattern: { type: "string" }, capIsNewExceptions: { type: "array", items: { type: "string" } }, capIsNewExceptionPattern: { type: "string" }, properties: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var config = context.options[0] ? Object.assign({}, context.options[0]) : {}; config.newIsCap = config.newIsCap !== false; config.capIsNew = config.capIsNew !== false; var skipProperties = config.properties === false; var newIsCapExceptions = checkArray(config, "newIsCapExceptions", []).reduce(invert, {}); var newIsCapExceptionPattern = config.newIsCapExceptionPattern ? new RegExp(config.newIsCapExceptionPattern) : null; var capIsNewExceptions = calculateCapIsNewExceptions(config); var capIsNewExceptionPattern = config.capIsNewExceptionPattern ? new RegExp(config.capIsNewExceptionPattern) : null; var listeners = {}; var sourceCode = context.getSourceCode(); //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Get exact callee name from expression * @param {ASTNode} node CallExpression or NewExpression node * @returns {string} name */ function extractNameFromExpression(node) { var name = ""; if (node.callee.type === "MemberExpression") { var property = node.callee.property; if (property.type === "Literal" && typeof property.value === "string") { name = property.value; } else if (property.type === "Identifier" && !node.callee.computed) { name = property.name; } } else { name = node.callee.name; } return name; } /** * Returns the capitalization state of the string - * Whether the first character is uppercase, lowercase, or non-alphabetic * @param {string} str String * @returns {string} capitalization state: "non-alpha", "lower", or "upper" */ function getCap(str) { var firstChar = str.charAt(0); var firstCharLower = firstChar.toLowerCase(); var firstCharUpper = firstChar.toUpperCase(); if (firstCharLower === firstCharUpper) { // char has no uppercase variant, so it's non-alphabetic return "non-alpha"; } else if (firstChar === firstCharLower) { return "lower"; } return "upper"; } /** * Check if capitalization is allowed for a CallExpression * @param {Object} allowedMap Object mapping calleeName to a Boolean * @param {ASTNode} node CallExpression node * @param {string} calleeName Capitalized callee name from a CallExpression * @param {Object} pattern RegExp object from options pattern * @returns {boolean} Returns true if the callee may be capitalized */ function isCapAllowed(allowedMap, node, calleeName, pattern) { var sourceText = sourceCode.getText(node.callee); if (allowedMap[calleeName] || allowedMap[sourceText]) { return true; } if (pattern && pattern.test(sourceText)) { return true; } if (calleeName === "UTC" && node.callee.type === "MemberExpression") { // allow if callee is Date.UTC return node.callee.object.type === "Identifier" && node.callee.object.name === "Date"; } return skipProperties && node.callee.type === "MemberExpression"; } /** * Reports the given message for the given node. The location will be the start of the property or the callee. * @param {ASTNode} node CallExpression or NewExpression node. * @param {string} message The message to report. * @returns {void} */ function report(node, message) { var callee = node.callee; if (callee.type === "MemberExpression") { callee = callee.property; } context.report({ node: node, loc: callee.loc.start, message: message }); } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- if (config.newIsCap) { listeners.NewExpression = function (node) { var constructorName = extractNameFromExpression(node); if (constructorName) { var capitalization = getCap(constructorName); var isAllowed = capitalization !== "lower" || isCapAllowed(newIsCapExceptions, node, constructorName, newIsCapExceptionPattern); if (!isAllowed) { report(node, "A constructor name should not start with a lowercase letter."); } } }; } if (config.capIsNew) { listeners.CallExpression = function (node) { var calleeName = extractNameFromExpression(node); if (calleeName) { var capitalization = getCap(calleeName); var isAllowed = capitalization !== "upper" || isCapAllowed(capIsNewExceptions, node, calleeName, capIsNewExceptionPattern); if (!isAllowed) { report(node, "A function with a name starting with an uppercase letter should only be used as a constructor."); } } }; } return listeners; } }; },{}],142:[function(require,module,exports){ /** * @fileoverview Rule to flag when using constructor without parentheses * @author Ilya Volodin */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require parentheses when invoking a constructor with no arguments", category: "Stylistic Issues", recommended: false }, schema: [], fixable: "code" }, create: function create(context) { var sourceCode = context.getSourceCode(); return { NewExpression: function NewExpression(node) { if (node.arguments.length !== 0) { return; // shortcut: if there are arguments, there have to be parens } var lastToken = sourceCode.getLastToken(node); var hasLastParen = lastToken && astUtils.isClosingParenToken(lastToken); var hasParens = hasLastParen && astUtils.isOpeningParenToken(sourceCode.getTokenBefore(lastToken)); if (!hasParens) { context.report({ node: node, message: "Missing '()' invoking a constructor.", fix: function fix(fixer) { return fixer.insertTextAfter(node, "()"); } }); } } }; } }; },{"../ast-utils":67}],143:[function(require,module,exports){ /** * @fileoverview Rule to check empty newline after "var" statement * @author Gopal Venkatesan * @deprecated */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require or disallow an empty line after variable declarations", category: "Stylistic Issues", recommended: false, replacedBy: ["padding-line-between-statements"] }, schema: [{ enum: ["never", "always"] }], fixable: "whitespace", deprecated: true }, create: function create(context) { var ALWAYS_MESSAGE = "Expected blank line after variable declarations.", NEVER_MESSAGE = "Unexpected blank line after variable declarations."; var sourceCode = context.getSourceCode(); // Default `mode` to "always". var mode = context.options[0] === "never" ? "never" : "always"; // Cache starting and ending line numbers of comments for faster lookup var commentEndLine = sourceCode.getAllComments().reduce(function (result, token) { result[token.loc.start.line] = token.loc.end.line; return result; }, {}); //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Gets a token from the given node to compare line to the next statement. * * In general, the token is the last token of the node. However, the token is the second last token if the following conditions satisfy. * * - The last token is semicolon. * - The semicolon is on a different line from the previous token of the semicolon. * * This behavior would address semicolon-less style code. e.g.: * * var foo = 1 * * ;(a || b).doSomething() * * @param {ASTNode} node - The node to get. * @returns {Token} The token to compare line to the next statement. */ function getLastToken(node) { var lastToken = sourceCode.getLastToken(node); if (lastToken.type === "Punctuator" && lastToken.value === ";") { var prevToken = sourceCode.getTokenBefore(lastToken); if (prevToken.loc.end.line !== lastToken.loc.start.line) { return prevToken; } } return lastToken; } /** * Determine if provided keyword is a variable declaration * @private * @param {string} keyword - keyword to test * @returns {boolean} True if `keyword` is a type of var */ function isVar(keyword) { return keyword === "var" || keyword === "let" || keyword === "const"; } /** * Determine if provided keyword is a variant of for specifiers * @private * @param {string} keyword - keyword to test * @returns {boolean} True if `keyword` is a variant of for specifier */ function isForTypeSpecifier(keyword) { return keyword === "ForStatement" || keyword === "ForInStatement" || keyword === "ForOfStatement"; } /** * Determine if provided keyword is an export specifiers * @private * @param {string} nodeType - nodeType to test * @returns {boolean} True if `nodeType` is an export specifier */ function isExportSpecifier(nodeType) { return nodeType === "ExportNamedDeclaration" || nodeType === "ExportSpecifier" || nodeType === "ExportDefaultDeclaration" || nodeType === "ExportAllDeclaration"; } /** * Determine if provided node is the last of their parent block. * @private * @param {ASTNode} node - node to test * @returns {boolean} True if `node` is last of their parent block. */ function isLastNode(node) { var token = sourceCode.getTokenAfter(node); return !token || token.type === "Punctuator" && token.value === "}"; } /** * Gets the last line of a group of consecutive comments * @param {number} commentStartLine The starting line of the group * @returns {number} The number of the last comment line of the group */ function getLastCommentLineOfBlock(commentStartLine) { var currentCommentEnd = commentEndLine[commentStartLine]; return commentEndLine[currentCommentEnd + 1] ? getLastCommentLineOfBlock(currentCommentEnd + 1) : currentCommentEnd; } /** * Determine if a token starts more than one line after a comment ends * @param {token} token The token being checked * @param {integer} commentStartLine The line number on which the comment starts * @returns {boolean} True if `token` does not start immediately after a comment */ function hasBlankLineAfterComment(token, commentStartLine) { return token.loc.start.line > getLastCommentLineOfBlock(commentStartLine) + 1; } /** * Checks that a blank line exists after a variable declaration when mode is * set to "always", or checks that there is no blank line when mode is set * to "never" * @private * @param {ASTNode} node - `VariableDeclaration` node to test * @returns {void} */ function checkForBlankLine(node) { /* * lastToken is the last token on the node's line. It will usually also be the last token of the node, but it will * sometimes be second-last if there is a semicolon on a different line. */ var lastToken = getLastToken(node), /* * If lastToken is the last token of the node, nextToken should be the token after the node. Otherwise, nextToken * is the last token of the node. */ nextToken = lastToken === sourceCode.getLastToken(node) ? sourceCode.getTokenAfter(node) : sourceCode.getLastToken(node), nextLineNum = lastToken.loc.end.line + 1; // Ignore if there is no following statement if (!nextToken) { return; } // Ignore if parent of node is a for variant if (isForTypeSpecifier(node.parent.type)) { return; } // Ignore if parent of node is an export specifier if (isExportSpecifier(node.parent.type)) { return; } // Some coding styles use multiple `var` statements, so do nothing if // the next token is a `var` statement. if (nextToken.type === "Keyword" && isVar(nextToken.value)) { return; } // Ignore if it is last statement in a block if (isLastNode(node)) { return; } // Next statement is not a `var`... var noNextLineToken = nextToken.loc.start.line > nextLineNum; var hasNextLineComment = typeof commentEndLine[nextLineNum] !== "undefined"; if (mode === "never" && noNextLineToken && !hasNextLineComment) { context.report({ node: node, message: NEVER_MESSAGE, data: { identifier: node.name }, fix: function fix(fixer) { var linesBetween = sourceCode.getText().slice(lastToken.range[1], nextToken.range[0]).split(astUtils.LINEBREAK_MATCHER); return fixer.replaceTextRange([lastToken.range[1], nextToken.range[0]], linesBetween.slice(0, -1).join("") + "\n" + linesBetween[linesBetween.length - 1]); } }); } // Token on the next line, or comment without blank line if (mode === "always" && (!noNextLineToken || hasNextLineComment && !hasBlankLineAfterComment(nextToken, nextLineNum))) { context.report({ node: node, message: ALWAYS_MESSAGE, data: { identifier: node.name }, fix: function fix(fixer) { if ((noNextLineToken ? getLastCommentLineOfBlock(nextLineNum) : lastToken.loc.end.line) === nextToken.loc.start.line) { return fixer.insertTextBefore(nextToken, "\n\n"); } return fixer.insertTextBeforeRange([nextToken.range[0] - nextToken.loc.start.column, nextToken.range[1]], "\n"); } }); } } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { VariableDeclaration: checkForBlankLine }; } }; },{"../ast-utils":67}],144:[function(require,module,exports){ /** * @fileoverview Rule to require newlines before `return` statement * @author Kai Cataldo * @deprecated */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require an empty line before `return` statements", category: "Stylistic Issues", recommended: false, replacedBy: ["padding-line-between-statements"] }, fixable: "whitespace", schema: [], deprecated: true }, create: function create(context) { var sourceCode = context.getSourceCode(); //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Tests whether node is preceded by supplied tokens * @param {ASTNode} node - node to check * @param {array} testTokens - array of tokens to test against * @returns {boolean} Whether or not the node is preceded by one of the supplied tokens * @private */ function isPrecededByTokens(node, testTokens) { var tokenBefore = sourceCode.getTokenBefore(node); return testTokens.some(function (token) { return tokenBefore.value === token; }); } /** * Checks whether node is the first node after statement or in block * @param {ASTNode} node - node to check * @returns {boolean} Whether or not the node is the first node after statement or in block * @private */ function isFirstNode(node) { var parentType = node.parent.type; if (node.parent.body) { return Array.isArray(node.parent.body) ? node.parent.body[0] === node : node.parent.body === node; } if (parentType === "IfStatement") { return isPrecededByTokens(node, ["else", ")"]); } else if (parentType === "DoWhileStatement") { return isPrecededByTokens(node, ["do"]); } else if (parentType === "SwitchCase") { return isPrecededByTokens(node, [":"]); } return isPrecededByTokens(node, [")"]); } /** * Returns the number of lines of comments that precede the node * @param {ASTNode} node - node to check for overlapping comments * @param {number} lineNumTokenBefore - line number of previous token, to check for overlapping comments * @returns {number} Number of lines of comments that precede the node * @private */ function calcCommentLines(node, lineNumTokenBefore) { var comments = sourceCode.getCommentsBefore(node); var numLinesComments = 0; if (!comments.length) { return numLinesComments; } comments.forEach(function (comment) { numLinesComments++; if (comment.type === "Block") { numLinesComments += comment.loc.end.line - comment.loc.start.line; } // avoid counting lines with inline comments twice if (comment.loc.start.line === lineNumTokenBefore) { numLinesComments--; } if (comment.loc.end.line === node.loc.start.line) { numLinesComments--; } }); return numLinesComments; } /** * Returns the line number of the token before the node that is passed in as an argument * @param {ASTNode} node - The node to use as the start of the calculation * @returns {number} Line number of the token before `node` * @private */ function getLineNumberOfTokenBefore(node) { var tokenBefore = sourceCode.getTokenBefore(node); var lineNumTokenBefore = void 0; /** * Global return (at the beginning of a script) is a special case. * If there is no token before `return`, then we expect no line * break before the return. Comments are allowed to occupy lines * before the global return, just no blank lines. * Setting lineNumTokenBefore to zero in that case results in the * desired behavior. */ if (tokenBefore) { lineNumTokenBefore = tokenBefore.loc.end.line; } else { lineNumTokenBefore = 0; // global return at beginning of script } return lineNumTokenBefore; } /** * Checks whether node is preceded by a newline * @param {ASTNode} node - node to check * @returns {boolean} Whether or not the node is preceded by a newline * @private */ function hasNewlineBefore(node) { var lineNumNode = node.loc.start.line; var lineNumTokenBefore = getLineNumberOfTokenBefore(node); var commentLines = calcCommentLines(node, lineNumTokenBefore); return lineNumNode - lineNumTokenBefore - commentLines > 1; } /** * Checks whether it is safe to apply a fix to a given return statement. * * The fix is not considered safe if the given return statement has leading comments, * as we cannot safely determine if the newline should be added before or after the comments. * For more information, see: https://github.com/eslint/eslint/issues/5958#issuecomment-222767211 * * @param {ASTNode} node - The return statement node to check. * @returns {boolean} `true` if it can fix the node. * @private */ function canFix(node) { var leadingComments = sourceCode.getCommentsBefore(node); var lastLeadingComment = leadingComments[leadingComments.length - 1]; var tokenBefore = sourceCode.getTokenBefore(node); if (leadingComments.length === 0) { return true; } // if the last leading comment ends in the same line as the previous token and // does not share a line with the `return` node, we can consider it safe to fix. // Example: // function a() { // var b; //comment // return; // } if (lastLeadingComment.loc.end.line === tokenBefore.loc.end.line && lastLeadingComment.loc.end.line !== node.loc.start.line) { return true; } return false; } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { ReturnStatement: function ReturnStatement(node) { if (!isFirstNode(node) && !hasNewlineBefore(node)) { context.report({ node: node, message: "Expected newline before return statement.", fix: function fix(fixer) { if (canFix(node)) { var tokenBefore = sourceCode.getTokenBefore(node); var newlines = node.loc.start.line === tokenBefore.loc.end.line ? "\n\n" : "\n"; return fixer.insertTextBefore(node, newlines); } return null; } }); } } }; } }; },{}],145:[function(require,module,exports){ /** * @fileoverview Rule to ensure newline per method call when chaining calls * @author Rajendra Patil * @author Burak Yigit Kaya */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require a newline after each call in a method chain", category: "Stylistic Issues", recommended: false }, schema: [{ type: "object", properties: { ignoreChainWithDepth: { type: "integer", minimum: 1, maximum: 10 } }, additionalProperties: false }] }, create: function create(context) { var options = context.options[0] || {}, ignoreChainWithDepth = options.ignoreChainWithDepth || 2; var sourceCode = context.getSourceCode(); /** * Gets the property text of a given MemberExpression node. * If the text is multiline, this returns only the first line. * * @param {ASTNode} node - A MemberExpression node to get. * @returns {string} The property text of the node. */ function getPropertyText(node) { var prefix = node.computed ? "[" : "."; var lines = sourceCode.getText(node.property).split(astUtils.LINEBREAK_MATCHER); var suffix = node.computed && lines.length === 1 ? "]" : ""; return prefix + lines[0] + suffix; } return { "CallExpression:exit": function CallExpressionExit(node) { if (!node.callee || node.callee.type !== "MemberExpression") { return; } var callee = node.callee; var parent = callee.object; var depth = 1; while (parent && parent.callee) { depth += 1; parent = parent.callee.object; } if (depth > ignoreChainWithDepth && callee.property.loc.start.line === callee.object.loc.end.line) { context.report({ node: callee.property, loc: callee.property.loc.start, message: "Expected line break before `{{callee}}`.", data: { callee: getPropertyText(callee) } }); } } }; } }; },{"../ast-utils":67}],146:[function(require,module,exports){ /** * @fileoverview Rule to flag use of alert, confirm, prompt * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var getPropertyName = require("../ast-utils").getStaticPropertyName; //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Checks if the given name is a prohibited identifier. * @param {string} name The name to check * @returns {boolean} Whether or not the name is prohibited. */ function isProhibitedIdentifier(name) { return (/^(alert|confirm|prompt)$/.test(name) ); } /** * Reports the given node and identifier name. * @param {RuleContext} context The ESLint rule context. * @param {ASTNode} node The node to report on. * @param {string} identifierName The name of the identifier. * @returns {void} */ function report(context, node, identifierName) { context.report(node, "Unexpected {{name}}.", { name: identifierName }); } /** * Finds the eslint-scope reference in the given scope. * @param {Object} scope The scope to search. * @param {ASTNode} node The identifier node. * @returns {Reference|null} Returns the found reference or null if none were found. */ function findReference(scope, node) { var references = scope.references.filter(function (reference) { return reference.identifier.range[0] === node.range[0] && reference.identifier.range[1] === node.range[1]; }); if (references.length === 1) { return references[0]; } return null; } /** * Checks if the given identifier node is shadowed in the given scope. * @param {Object} scope The current scope. * @param {Object} globalScope The global scope. * @param {string} node The identifier node to check * @returns {boolean} Whether or not the name is shadowed. */ function isShadowed(scope, globalScope, node) { var reference = findReference(scope, node); return reference && reference.resolved && reference.resolved.defs.length > 0; } /** * Checks if the given identifier node is a ThisExpression in the global scope or the global window property. * @param {Object} scope The current scope. * @param {Object} globalScope The global scope. * @param {string} node The identifier node to check * @returns {boolean} Whether or not the node is a reference to the global object. */ function isGlobalThisReferenceOrGlobalWindow(scope, globalScope, node) { if (scope.type === "global" && node.type === "ThisExpression") { return true; } else if (node.name === "window") { return !isShadowed(scope, globalScope, node); } return false; } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow the use of `alert`, `confirm`, and `prompt`", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { var globalScope = void 0; return { Program: function Program() { globalScope = context.getScope(); }, CallExpression: function CallExpression(node) { var callee = node.callee, currentScope = context.getScope(); // without window. if (callee.type === "Identifier") { var identifierName = callee.name; if (!isShadowed(currentScope, globalScope, callee) && isProhibitedIdentifier(callee.name)) { report(context, node, identifierName); } } else if (callee.type === "MemberExpression" && isGlobalThisReferenceOrGlobalWindow(currentScope, globalScope, callee.object)) { var _identifierName = getPropertyName(callee); if (isProhibitedIdentifier(_identifierName)) { report(context, node, _identifierName); } } } }; } }; },{"../ast-utils":67}],147:[function(require,module,exports){ /** * @fileoverview Disallow construction of dense arrays using the Array constructor * @author Matt DuVall */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow `Array` constructors", category: "Stylistic Issues", recommended: false }, schema: [] }, create: function create(context) { /** * Disallow construction of dense arrays using the Array constructor * @param {ASTNode} node node to evaluate * @returns {void} * @private */ function check(node) { if (node.arguments.length !== 1 && node.callee.type === "Identifier" && node.callee.name === "Array") { context.report({ node: node, message: "The array literal notation [] is preferrable." }); } } return { CallExpression: check, NewExpression: check }; } }; },{}],148:[function(require,module,exports){ /** * @fileoverview Rule to disallow uses of await inside of loops. * @author Nat Mote (nmote) */ "use strict"; // Node types which are considered loops. var loopTypes = new Set(["ForStatement", "ForOfStatement", "ForInStatement", "WhileStatement", "DoWhileStatement"]); // Node types at which we should stop looking for loops. For example, it is fine to declare an async // function within a loop, and use await inside of that. var boundaryTypes = new Set(["FunctionDeclaration", "FunctionExpression", "ArrowFunctionExpression"]); module.exports = { meta: { docs: { description: "disallow `await` inside of loops", category: "Possible Errors", recommended: false }, schema: [] }, create: function create(context) { return { AwaitExpression: function AwaitExpression(node) { var ancestors = context.getAncestors(); // Reverse so that we can traverse from the deepest node upwards. ancestors.reverse(); // Create a set of all the ancestors plus this node so that we can check // if this use of await appears in the body of the loop as opposed to // the right-hand side of a for...of, for example. var ancestorSet = new Set(ancestors).add(node); for (var i = 0; i < ancestors.length; i++) { var ancestor = ancestors[i]; if (boundaryTypes.has(ancestor.type)) { // Short-circuit out if we encounter a boundary type. Loops above // this do not matter. return; } if (loopTypes.has(ancestor.type)) { // Only report if we are actually in the body or another part that gets executed on // every iteration. if (ancestorSet.has(ancestor.body) || ancestorSet.has(ancestor.test) || ancestorSet.has(ancestor.update)) { context.report({ node: node, message: "Unexpected `await` inside a loop." }); return; } } } } }; } }; },{}],149:[function(require,module,exports){ /** * @fileoverview Rule to flag bitwise identifiers * @author Nicholas C. Zakas */ "use strict"; // // Set of bitwise operators. // var BITWISE_OPERATORS = ["^", "|", "&", "<<", ">>", ">>>", "^=", "|=", "&=", "<<=", ">>=", ">>>=", "~"]; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow bitwise operators", category: "Stylistic Issues", recommended: false }, schema: [{ type: "object", properties: { allow: { type: "array", items: { enum: BITWISE_OPERATORS }, uniqueItems: true }, int32Hint: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var options = context.options[0] || {}; var allowed = options.allow || []; var int32Hint = options.int32Hint === true; /** * Reports an unexpected use of a bitwise operator. * @param {ASTNode} node Node which contains the bitwise operator. * @returns {void} */ function report(node) { context.report({ node: node, message: "Unexpected use of '{{operator}}'.", data: { operator: node.operator } }); } /** * Checks if the given node has a bitwise operator. * @param {ASTNode} node The node to check. * @returns {boolean} Whether or not the node has a bitwise operator. */ function hasBitwiseOperator(node) { return BITWISE_OPERATORS.indexOf(node.operator) !== -1; } /** * Checks if exceptions were provided, e.g. `{ allow: ['~', '|'] }`. * @param {ASTNode} node The node to check. * @returns {boolean} Whether or not the node has a bitwise operator. */ function allowedOperator(node) { return allowed.indexOf(node.operator) !== -1; } /** * Checks if the given bitwise operator is used for integer typecasting, i.e. "|0" * @param {ASTNode} node The node to check. * @returns {boolean} whether the node is used in integer typecasting. */ function isInt32Hint(node) { return int32Hint && node.operator === "|" && node.right && node.right.type === "Literal" && node.right.value === 0; } /** * Report if the given node contains a bitwise operator. * @param {ASTNode} node The node to check. * @returns {void} */ function checkNodeForBitwiseOperator(node) { if (hasBitwiseOperator(node) && !allowedOperator(node) && !isInt32Hint(node)) { report(node); } } return { AssignmentExpression: checkNodeForBitwiseOperator, BinaryExpression: checkNodeForBitwiseOperator, UnaryExpression: checkNodeForBitwiseOperator }; } }; },{}],150:[function(require,module,exports){ /** * @fileoverview disallow use of the Buffer() constructor * @author Teddy Katz */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow use of the Buffer() constructor", category: "Node.js and CommonJS", recommended: false }, schema: [] }, create: function create(context) { //---------------------------------------------------------------------- // Public //---------------------------------------------------------------------- return { "CallExpression[callee.name='Buffer'], NewExpression[callee.name='Buffer']": function CallExpressionCalleeNameBufferNewExpressionCalleeNameBuffer(node) { context.report({ node: node, message: "{{example}} is deprecated. Use Buffer.from(), Buffer.alloc(), or Buffer.allocUnsafe() instead.", data: { example: node.type === "CallExpression" ? "Buffer()" : "new Buffer()" } }); } }; } }; },{}],151:[function(require,module,exports){ /** * @fileoverview Rule to flag use of arguments.callee and arguments.caller. * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow the use of `arguments.caller` or `arguments.callee`", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { return { MemberExpression: function MemberExpression(node) { var objectName = node.object.name, propertyName = node.property.name; if (objectName === "arguments" && !node.computed && propertyName && propertyName.match(/^calle[er]$/)) { context.report({ node: node, message: "Avoid arguments.{{property}}.", data: { property: propertyName } }); } } }; } }; },{}],152:[function(require,module,exports){ /** * @fileoverview Rule to flag use of an lexical declarations inside a case clause * @author Erik Arvidsson */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow lexical declarations in case clauses", category: "Best Practices", recommended: true }, schema: [] }, create: function create(context) { /** * Checks whether or not a node is a lexical declaration. * @param {ASTNode} node A direct child statement of a switch case. * @returns {boolean} Whether or not the node is a lexical declaration. */ function isLexicalDeclaration(node) { switch (node.type) { case "FunctionDeclaration": case "ClassDeclaration": return true; case "VariableDeclaration": return node.kind !== "var"; default: return false; } } return { SwitchCase: function SwitchCase(node) { for (var i = 0; i < node.consequent.length; i++) { var statement = node.consequent[i]; if (isLexicalDeclaration(statement)) { context.report({ node: node, message: "Unexpected lexical declaration in case block." }); } } } }; } }; },{}],153:[function(require,module,exports){ /** * @fileoverview Rule to flag variable leak in CatchClauses in IE 8 and earlier * @author Ian Christian Myers */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow `catch` clause parameters from shadowing variables in the outer scope", category: "Variables", recommended: false }, schema: [] }, create: function create(context) { //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Check if the parameters are been shadowed * @param {Object} scope current scope * @param {string} name parameter name * @returns {boolean} True is its been shadowed */ function paramIsShadowing(scope, name) { return astUtils.getVariableByName(scope, name) !== null; } //-------------------------------------------------------------------------- // Public API //-------------------------------------------------------------------------- return { CatchClause: function CatchClause(node) { var scope = context.getScope(); // When blockBindings is enabled, CatchClause creates its own scope // so start from one upper scope to exclude the current node if (scope.block === node) { scope = scope.upper; } if (paramIsShadowing(scope, node.param.name)) { context.report({ node: node, message: "Value of '{{name}}' may be overwritten in IE 8 and earlier.", data: { name: node.param.name } }); } } }; } }; },{"../ast-utils":67}],154:[function(require,module,exports){ /** * @fileoverview A rule to disallow modifying variables of class declarations * @author Toru Nagashima */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow reassigning class members", category: "ECMAScript 6", recommended: true }, schema: [] }, create: function create(context) { /** * Finds and reports references that are non initializer and writable. * @param {Variable} variable - A variable to check. * @returns {void} */ function checkVariable(variable) { astUtils.getModifyingReferences(variable.references).forEach(function (reference) { context.report({ node: reference.identifier, message: "'{{name}}' is a class.", data: { name: reference.identifier.name } }); }); } /** * Finds and reports references that are non initializer and writable. * @param {ASTNode} node - A ClassDeclaration/ClassExpression node to check. * @returns {void} */ function checkForClass(node) { context.getDeclaredVariables(node).forEach(checkVariable); } return { ClassDeclaration: checkForClass, ClassExpression: checkForClass }; } }; },{"../ast-utils":67}],155:[function(require,module,exports){ /** * @fileoverview The rule should warn against code that tries to compare against -0. * @author Aladdin-ADD */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow comparing against -0", category: "Possible Errors", recommended: true }, fixable: null, schema: [] }, create: function create(context) { //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Checks a given node is -0 * * @param {ASTNode} node - A node to check. * @returns {boolean} `true` if the node is -0. */ function isNegZero(node) { return node.type === "UnaryExpression" && node.operator === "-" && node.argument.type === "Literal" && node.argument.value === 0; } var OPERATORS_TO_CHECK = new Set([">", ">=", "<", "<=", "==", "===", "!=", "!=="]); return { BinaryExpression: function BinaryExpression(node) { if (OPERATORS_TO_CHECK.has(node.operator)) { if (isNegZero(node.left) || isNegZero(node.right)) { context.report({ node: node, message: "Do not use the '{{operator}}' operator to compare against -0.", data: { operator: node.operator } }); } } } }; } }; },{}],156:[function(require,module,exports){ /** * @fileoverview Rule to flag assignment in a conditional statement's test expression * @author Stephen Murray */ "use strict"; var astUtils = require("../ast-utils"); var NODE_DESCRIPTIONS = { DoWhileStatement: "a 'do...while' statement", ForStatement: "a 'for' statement", IfStatement: "an 'if' statement", WhileStatement: "a 'while' statement" }; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow assignment operators in conditional expressions", category: "Possible Errors", recommended: true }, schema: [{ enum: ["except-parens", "always"] }] }, create: function create(context) { var prohibitAssign = context.options[0] || "except-parens"; var sourceCode = context.getSourceCode(); /** * Check whether an AST node is the test expression for a conditional statement. * @param {!Object} node The node to test. * @returns {boolean} `true` if the node is the text expression for a conditional statement; otherwise, `false`. */ function isConditionalTestExpression(node) { return node.parent && node.parent.test && node === node.parent.test; } /** * Given an AST node, perform a bottom-up search for the first ancestor that represents a conditional statement. * @param {!Object} node The node to use at the start of the search. * @returns {?Object} The closest ancestor node that represents a conditional statement. */ function findConditionalAncestor(node) { var currentAncestor = node; do { if (isConditionalTestExpression(currentAncestor)) { return currentAncestor.parent; } } while ((currentAncestor = currentAncestor.parent) && !astUtils.isFunction(currentAncestor)); return null; } /** * Check whether the code represented by an AST node is enclosed in two sets of parentheses. * @param {!Object} node The node to test. * @returns {boolean} `true` if the code is enclosed in two sets of parentheses; otherwise, `false`. */ function isParenthesisedTwice(node) { var previousToken = sourceCode.getTokenBefore(node, 1), nextToken = sourceCode.getTokenAfter(node, 1); return astUtils.isParenthesised(sourceCode, node) && astUtils.isOpeningParenToken(previousToken) && previousToken.range[1] <= node.range[0] && astUtils.isClosingParenToken(nextToken) && nextToken.range[0] >= node.range[1]; } /** * Check a conditional statement's test expression for top-level assignments that are not enclosed in parentheses. * @param {!Object} node The node for the conditional statement. * @returns {void} */ function testForAssign(node) { if (node.test && node.test.type === "AssignmentExpression" && (node.type === "ForStatement" ? !astUtils.isParenthesised(sourceCode, node.test) : !isParenthesisedTwice(node.test))) { // must match JSHint's error message context.report({ node: node, loc: node.test.loc.start, message: "Expected a conditional expression and instead saw an assignment." }); } } /** * Check whether an assignment expression is descended from a conditional statement's test expression. * @param {!Object} node The node for the assignment expression. * @returns {void} */ function testForConditionalAncestor(node) { var ancestor = findConditionalAncestor(node); if (ancestor) { context.report({ node: ancestor, message: "Unexpected assignment within {{type}}.", data: { type: NODE_DESCRIPTIONS[ancestor.type] || ancestor.type } }); } } if (prohibitAssign === "always") { return { AssignmentExpression: testForConditionalAncestor }; } return { DoWhileStatement: testForAssign, ForStatement: testForAssign, IfStatement: testForAssign, WhileStatement: testForAssign }; } }; },{"../ast-utils":67}],157:[function(require,module,exports){ /** * @fileoverview A rule to warn against using arrow functions when they could be * confused with comparisions * @author Jxck */ "use strict"; var astUtils = require("../ast-utils.js"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Checks whether or not a node is a conditional expression. * @param {ASTNode} node - node to test * @returns {boolean} `true` if the node is a conditional expression. */ function isConditional(node) { return node && node.type === "ConditionalExpression"; } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow arrow functions where they could be confused with comparisons", category: "ECMAScript 6", recommended: false }, fixable: "code", schema: [{ type: "object", properties: { allowParens: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var config = context.options[0] || {}; var sourceCode = context.getSourceCode(); /** * Reports if an arrow function contains an ambiguous conditional. * @param {ASTNode} node - A node to check and report. * @returns {void} */ function checkArrowFunc(node) { var body = node.body; if (isConditional(body) && !(config.allowParens && astUtils.isParenthesised(sourceCode, body))) { context.report({ node: node, message: "Arrow function used ambiguously with a conditional expression.", fix: function fix(fixer) { // if `allowParens` is not set to true dont bother wrapping in parens return config.allowParens && fixer.replaceText(node.body, "(" + sourceCode.getText(node.body) + ")"); } }); } } return { ArrowFunctionExpression: checkArrowFunc }; } }; },{"../ast-utils.js":67}],158:[function(require,module,exports){ /** * @fileoverview Rule to flag use of console object * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow the use of `console`", category: "Possible Errors", recommended: true }, schema: [{ type: "object", properties: { allow: { type: "array", items: { type: "string" }, minItems: 1, uniqueItems: true } }, additionalProperties: false }] }, create: function create(context) { var options = context.options[0] || {}; var allowed = options.allow || []; /** * Checks whether the given reference is 'console' or not. * * @param {eslint-scope.Reference} reference - The reference to check. * @returns {boolean} `true` if the reference is 'console'. */ function isConsole(reference) { var id = reference.identifier; return id && id.name === "console"; } /** * Checks whether the property name of the given MemberExpression node * is allowed by options or not. * * @param {ASTNode} node - The MemberExpression node to check. * @returns {boolean} `true` if the property name of the node is allowed. */ function isAllowed(node) { var propertyName = astUtils.getStaticPropertyName(node); return propertyName && allowed.indexOf(propertyName) !== -1; } /** * Checks whether the given reference is a member access which is not * allowed by options or not. * * @param {eslint-scope.Reference} reference - The reference to check. * @returns {boolean} `true` if the reference is a member access which * is not allowed by options. */ function isMemberAccessExceptAllowed(reference) { var node = reference.identifier; var parent = node.parent; return parent.type === "MemberExpression" && parent.object === node && !isAllowed(parent); } /** * Reports the given reference as a violation. * * @param {eslint-scope.Reference} reference - The reference to report. * @returns {void} */ function report(reference) { var node = reference.identifier.parent; context.report({ node: node, loc: node.loc, message: "Unexpected console statement." }); } return { "Program:exit": function ProgramExit() { var scope = context.getScope(); var consoleVar = astUtils.getVariableByName(scope, "console"); var shadowed = consoleVar && consoleVar.defs.length > 0; /* 'scope.through' includes all references to undefined * variables. If the variable 'console' is not defined, it uses * 'scope.through'. */ var references = consoleVar ? consoleVar.references : scope.through.filter(isConsole); if (!shadowed) { references.filter(isMemberAccessExceptAllowed).forEach(report); } } }; } }; },{"../ast-utils":67}],159:[function(require,module,exports){ /** * @fileoverview A rule to disallow modifying variables that are declared using `const` * @author Toru Nagashima */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow reassigning `const` variables", category: "ECMAScript 6", recommended: true }, schema: [] }, create: function create(context) { /** * Finds and reports references that are non initializer and writable. * @param {Variable} variable - A variable to check. * @returns {void} */ function checkVariable(variable) { astUtils.getModifyingReferences(variable.references).forEach(function (reference) { context.report({ node: reference.identifier, message: "'{{name}}' is constant.", data: { name: reference.identifier.name } }); }); } return { VariableDeclaration: function VariableDeclaration(node) { if (node.kind === "const") { context.getDeclaredVariables(node).forEach(checkVariable); } } }; } }; },{"../ast-utils":67}],160:[function(require,module,exports){ /** * @fileoverview Rule to flag use constant conditions * @author Christian Schulz */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow constant expressions in conditions", category: "Possible Errors", recommended: true }, schema: [{ type: "object", properties: { checkLoops: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var options = context.options[0] || {}, checkLoops = options.checkLoops !== false; //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Checks if a branch node of LogicalExpression short circuits the whole condition * @param {ASTNode} node The branch of main condition which needs to be checked * @param {string} operator The operator of the main LogicalExpression. * @returns {boolean} true when condition short circuits whole condition */ function isLogicalIdentity(node, operator) { switch (node.type) { case "Literal": return operator === "||" && node.value === true || operator === "&&" && node.value === false; case "UnaryExpression": return operator === "&&" && node.operator === "void"; case "LogicalExpression": return isLogicalIdentity(node.left, node.operator) || isLogicalIdentity(node.right, node.operator); // no default } return false; } /** * Checks if a node has a constant truthiness value. * @param {ASTNode} node The AST node to check. * @param {boolean} inBooleanPosition `false` if checking branch of a condition. * `true` in all other cases * @returns {Bool} true when node's truthiness is constant * @private */ function isConstant(node, inBooleanPosition) { switch (node.type) { case "Literal": case "ArrowFunctionExpression": case "FunctionExpression": case "ObjectExpression": case "ArrayExpression": return true; case "UnaryExpression": if (node.operator === "void") { return true; } return node.operator === "typeof" && inBooleanPosition || isConstant(node.argument, true); case "BinaryExpression": return isConstant(node.left, false) && isConstant(node.right, false) && node.operator !== "in"; case "LogicalExpression": { var isLeftConstant = isConstant(node.left, inBooleanPosition); var isRightConstant = isConstant(node.right, inBooleanPosition); var isLeftShortCircuit = isLeftConstant && isLogicalIdentity(node.left, node.operator); var isRightShortCircuit = isRightConstant && isLogicalIdentity(node.right, node.operator); return isLeftConstant && isRightConstant || isLeftShortCircuit || isRightShortCircuit; } case "AssignmentExpression": return node.operator === "=" && isConstant(node.right, inBooleanPosition); case "SequenceExpression": return isConstant(node.expressions[node.expressions.length - 1], inBooleanPosition); // no default } return false; } /** * Reports when the given node contains a constant condition. * @param {ASTNode} node The AST node to check. * @returns {void} * @private */ function checkConstantCondition(node) { if (node.test && isConstant(node.test, true)) { context.report({ node: node, message: "Unexpected constant condition." }); } } /** * Checks node when checkLoops option is enabled * @param {ASTNode} node The AST node to check. * @returns {void} * @private */ function checkLoop(node) { if (checkLoops) { checkConstantCondition(node); } } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { ConditionalExpression: checkConstantCondition, IfStatement: checkConstantCondition, WhileStatement: checkLoop, DoWhileStatement: checkLoop, ForStatement: checkLoop }; } }; },{}],161:[function(require,module,exports){ /** * @fileoverview Rule to flag use of continue statement * @author Borislav Zhivkov */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow `continue` statements", category: "Stylistic Issues", recommended: false }, schema: [] }, create: function create(context) { return { ContinueStatement: function ContinueStatement(node) { context.report({ node: node, message: "Unexpected use of continue statement." }); } }; } }; },{}],162:[function(require,module,exports){ /** * @fileoverview Rule to forbid control charactes from regular expressions. * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow control characters in regular expressions", category: "Possible Errors", recommended: true }, schema: [] }, create: function create(context) { /** * Get the regex expression * @param {ASTNode} node node to evaluate * @returns {*} Regex if found else null * @private */ function getRegExp(node) { if (node.value instanceof RegExp) { return node.value; } else if (typeof node.value === "string") { var parent = context.getAncestors().pop(); if ((parent.type === "NewExpression" || parent.type === "CallExpression") && parent.callee.type === "Identifier" && parent.callee.name === "RegExp") { // there could be an invalid regular expression string try { return new RegExp(node.value); } catch (ex) { return null; } } } return null; } var controlChar = /[\x00-\x1f]/g; // eslint-disable-line no-control-regex var consecutiveSlashes = /\\+/g; var consecutiveSlashesAtEnd = /\\+$/g; var stringControlChar = /\\x[01][0-9a-f]/ig; var stringControlCharWithoutSlash = /x[01][0-9a-f]/ig; /** * Return a list of the control characters in the given regex string * @param {string} regexStr regex as string to check * @returns {array} returns a list of found control characters on given string * @private */ function getControlCharacters(regexStr) { // check control characters, if RegExp object used var controlChars = regexStr.match(controlChar) || []; var stringControlChars = []; // check substr, if regex literal used var subStrIndex = regexStr.search(stringControlChar); if (subStrIndex > -1) { // is it escaped, check backslash count var possibleEscapeCharacters = regexStr.slice(0, subStrIndex).match(consecutiveSlashesAtEnd); var hasControlChars = possibleEscapeCharacters === null || !(possibleEscapeCharacters[0].length % 2); if (hasControlChars) { stringControlChars = regexStr.slice(subStrIndex, -1).split(consecutiveSlashes).filter(Boolean).map(function (x) { var match = x.match(stringControlCharWithoutSlash) || [x]; return "\\" + match[0]; }); } } return controlChars.map(function (x) { var hexCode = ("0" + x.charCodeAt(0).toString(16)).slice(-2); return "\\x" + hexCode; }).concat(stringControlChars); } return { Literal: function Literal(node) { var regex = getRegExp(node); if (regex) { var computedValue = regex.toString(); var controlCharacters = getControlCharacters(computedValue); if (controlCharacters.length > 0) { context.report({ node: node, message: "Unexpected control character(s) in regular expression: {{controlChars}}.", data: { controlChars: controlCharacters.join(", ") } }); } } } }; } }; },{}],163:[function(require,module,exports){ /** * @fileoverview Rule to flag use of a debugger statement * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow the use of `debugger`", category: "Possible Errors", recommended: true }, fixable: "code", schema: [] }, create: function create(context) { return { DebuggerStatement: function DebuggerStatement(node) { context.report({ node: node, message: "Unexpected 'debugger' statement.", fix: function fix(fixer) { return fixer.remove(node); } }); } }; } }; },{}],164:[function(require,module,exports){ /** * @fileoverview Rule to flag when deleting variables * @author Ilya Volodin */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow deleting variables", category: "Variables", recommended: true }, schema: [] }, create: function create(context) { return { UnaryExpression: function UnaryExpression(node) { if (node.operator === "delete" && node.argument.type === "Identifier") { context.report({ node: node, message: "Variables should not be deleted." }); } } }; } }; },{}],165:[function(require,module,exports){ /** * @fileoverview Rule to check for ambiguous div operator in regexes * @author Matt DuVall */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow division operators explicitly at the beginning of regular expressions", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { var sourceCode = context.getSourceCode(); return { Literal: function Literal(node) { var token = sourceCode.getFirstToken(node); if (token.type === "RegularExpression" && token.value[1] === "=") { context.report({ node: node, message: "A regular expression literal can be confused with '/='." }); } } }; } }; },{}],166:[function(require,module,exports){ /** * @fileoverview Rule to flag duplicate arguments * @author Jamund Ferguson */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow duplicate arguments in `function` definitions", category: "Possible Errors", recommended: true }, schema: [] }, create: function create(context) { //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Checks whether or not a given definition is a parameter's. * @param {eslint-scope.DefEntry} def - A definition to check. * @returns {boolean} `true` if the definition is a parameter's. */ function isParameter(def) { return def.type === "Parameter"; } /** * Determines if a given node has duplicate parameters. * @param {ASTNode} node The node to check. * @returns {void} * @private */ function checkParams(node) { var variables = context.getDeclaredVariables(node); for (var i = 0; i < variables.length; ++i) { var variable = variables[i]; // Checks and reports duplications. var defs = variable.defs.filter(isParameter); if (defs.length >= 2) { context.report({ node: node, message: "Duplicate param '{{name}}'.", data: { name: variable.name } }); } } } //-------------------------------------------------------------------------- // Public API //-------------------------------------------------------------------------- return { FunctionDeclaration: checkParams, FunctionExpression: checkParams }; } }; },{}],167:[function(require,module,exports){ /** * @fileoverview A rule to disallow duplicate name in class members. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow duplicate class members", category: "ECMAScript 6", recommended: true }, schema: [] }, create: function create(context) { var stack = []; /** * Gets state of a given member name. * @param {string} name - A name of a member. * @param {boolean} isStatic - A flag which specifies that is a static member. * @returns {Object} A state of a given member name. * - retv.init {boolean} A flag which shows the name is declared as normal member. * - retv.get {boolean} A flag which shows the name is declared as getter. * - retv.set {boolean} A flag which shows the name is declared as setter. */ function getState(name, isStatic) { var stateMap = stack[stack.length - 1]; var key = "$" + name; // to avoid "__proto__". if (!stateMap[key]) { stateMap[key] = { nonStatic: { init: false, get: false, set: false }, static: { init: false, get: false, set: false } }; } return stateMap[key][isStatic ? "static" : "nonStatic"]; } /** * Gets the name text of a given node. * * @param {ASTNode} node - A node to get the name. * @returns {string} The name text of the node. */ function getName(node) { switch (node.type) { case "Identifier": return node.name; case "Literal": return String(node.value); /* istanbul ignore next: syntax error */ default: return ""; } } return { // Initializes the stack of state of member declarations. Program: function Program() { stack = []; }, // Initializes state of member declarations for the class. ClassBody: function ClassBody() { stack.push(Object.create(null)); }, // Disposes the state for the class. "ClassBody:exit": function ClassBodyExit() { stack.pop(); }, // Reports the node if its name has been declared already. MethodDefinition: function MethodDefinition(node) { if (node.computed) { return; } var name = getName(node.key); var state = getState(name, node.static); var isDuplicate = false; if (node.kind === "get") { isDuplicate = state.init || state.get; state.get = true; } else if (node.kind === "set") { isDuplicate = state.init || state.set; state.set = true; } else { isDuplicate = state.init || state.get || state.set; state.init = true; } if (isDuplicate) { context.report({ node: node, message: "Duplicate name '{{name}}'.", data: { name: name } }); } } }; } }; },{}],168:[function(require,module,exports){ /** * @fileoverview Rule to flag use of duplicate keys in an object. * @author Ian Christian Myers */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var GET_KIND = /^(?:init|get)$/; var SET_KIND = /^(?:init|set)$/; /** * The class which stores properties' information of an object. */ var ObjectInfo = function () { /** * @param {ObjectInfo|null} upper - The information of the outer object. * @param {ASTNode} node - The ObjectExpression node of this information. */ function ObjectInfo(upper, node) { _classCallCheck(this, ObjectInfo); this.upper = upper; this.node = node; this.properties = new Map(); } /** * Gets the information of the given Property node. * @param {ASTNode} node - The Property node to get. * @returns {{get: boolean, set: boolean}} The information of the property. */ _createClass(ObjectInfo, [{ key: "getPropertyInfo", value: function getPropertyInfo(node) { var name = astUtils.getStaticPropertyName(node); if (!this.properties.has(name)) { this.properties.set(name, { get: false, set: false }); } return this.properties.get(name); } /** * Checks whether the given property has been defined already or not. * @param {ASTNode} node - The Property node to check. * @returns {boolean} `true` if the property has been defined. */ }, { key: "isPropertyDefined", value: function isPropertyDefined(node) { var entry = this.getPropertyInfo(node); return GET_KIND.test(node.kind) && entry.get || SET_KIND.test(node.kind) && entry.set; } /** * Defines the given property. * @param {ASTNode} node - The Property node to define. * @returns {void} */ }, { key: "defineProperty", value: function defineProperty(node) { var entry = this.getPropertyInfo(node); if (GET_KIND.test(node.kind)) { entry.get = true; } if (SET_KIND.test(node.kind)) { entry.set = true; } } }]); return ObjectInfo; }(); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow duplicate keys in object literals", category: "Possible Errors", recommended: true }, schema: [] }, create: function create(context) { var info = null; return { ObjectExpression: function ObjectExpression(node) { info = new ObjectInfo(info, node); }, "ObjectExpression:exit": function ObjectExpressionExit() { info = info.upper; }, Property: function Property(node) { var name = astUtils.getStaticPropertyName(node); // Skip destructuring. if (node.parent.type !== "ObjectExpression") { return; } // Skip if the name is not static. if (!name) { return; } // Reports if the name is defined already. if (info.isPropertyDefined(node)) { context.report({ node: info.node, loc: node.key.loc, message: "Duplicate key '{{name}}'.", data: { name: name } }); } // Update info. info.defineProperty(node); } }; } }; },{"../ast-utils":67}],169:[function(require,module,exports){ /** * @fileoverview Rule to disallow a duplicate case label. * @author Dieter Oberkofler * @author Burak Yigit Kaya */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow duplicate case labels", category: "Possible Errors", recommended: true }, schema: [] }, create: function create(context) { var sourceCode = context.getSourceCode(); return { SwitchStatement: function SwitchStatement(node) { var mapping = {}; node.cases.forEach(function (switchCase) { var key = sourceCode.getText(switchCase.test); if (mapping[key]) { context.report({ node: switchCase, message: "Duplicate case label." }); } else { mapping[key] = switchCase; } }); } }; } }; },{}],170:[function(require,module,exports){ /** * @fileoverview Restrict usage of duplicate imports. * @author Simen Bekkhus */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ /** * Returns the name of the module imported or re-exported. * * @param {ASTNode} node - A node to get. * @returns {string} the name of the module, or empty string if no name. */ function getValue(node) { if (node && node.source && node.source.value) { return node.source.value.trim(); } return ""; } /** * Checks if the name of the import or export exists in the given array, and reports if so. * * @param {RuleContext} context - The ESLint rule context object. * @param {ASTNode} node - A node to get. * @param {string} value - The name of the imported or exported module. * @param {string[]} array - The array containing other imports or exports in the file. * @param {string} message - A message to be reported after the name of the module * * @returns {void} No return value */ function checkAndReport(context, node, value, array, message) { if (array.indexOf(value) !== -1) { context.report({ node: node, message: "'{{module}}' {{message}}", data: { module: value, message: message } }); } } /** * @callback nodeCallback * @param {ASTNode} node - A node to handle. */ /** * Returns a function handling the imports of a given file * * @param {RuleContext} context - The ESLint rule context object. * @param {boolean} includeExports - Whether or not to check for exports in addition to imports. * @param {string[]} importsInFile - The array containing other imports in the file. * @param {string[]} exportsInFile - The array containing other exports in the file. * * @returns {nodeCallback} A function passed to ESLint to handle the statement. */ function handleImports(context, includeExports, importsInFile, exportsInFile) { return function (node) { var value = getValue(node); if (value) { checkAndReport(context, node, value, importsInFile, "import is duplicated."); if (includeExports) { checkAndReport(context, node, value, exportsInFile, "import is duplicated as export."); } importsInFile.push(value); } }; } /** * Returns a function handling the exports of a given file * * @param {RuleContext} context - The ESLint rule context object. * @param {string[]} importsInFile - The array containing other imports in the file. * @param {string[]} exportsInFile - The array containing other exports in the file. * * @returns {nodeCallback} A function passed to ESLint to handle the statement. */ function handleExports(context, importsInFile, exportsInFile) { return function (node) { var value = getValue(node); if (value) { checkAndReport(context, node, value, exportsInFile, "export is duplicated."); checkAndReport(context, node, value, importsInFile, "export is duplicated as import."); exportsInFile.push(value); } }; } module.exports = { meta: { docs: { description: "disallow duplicate module imports", category: "ECMAScript 6", recommended: false }, schema: [{ type: "object", properties: { includeExports: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var includeExports = (context.options[0] || {}).includeExports, importsInFile = [], exportsInFile = []; var handlers = { ImportDeclaration: handleImports(context, includeExports, importsInFile, exportsInFile) }; if (includeExports) { handlers.ExportNamedDeclaration = handleExports(context, importsInFile, exportsInFile); handlers.ExportAllDeclaration = handleExports(context, importsInFile, exportsInFile); } return handlers; } }; },{}],171:[function(require,module,exports){ /** * @fileoverview Rule to flag `else` after a `return` in `if` * @author Ian Christian Myers */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); var FixTracker = require("../util/fix-tracker"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow `else` blocks after `return` statements in `if` statements", category: "Best Practices", recommended: false }, schema: [], fixable: "code" }, create: function create(context) { //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Display the context report if rule is violated * * @param {Node} node The 'else' node * @returns {void} */ function displayReport(node) { context.report({ node: node, message: "Unnecessary 'else' after 'return'.", fix: function fix(fixer) { var sourceCode = context.getSourceCode(); var startToken = sourceCode.getFirstToken(node); var elseToken = sourceCode.getTokenBefore(startToken); var source = sourceCode.getText(node); var lastIfToken = sourceCode.getTokenBefore(elseToken); var fixedSource = void 0, firstTokenOfElseBlock = void 0; if (startToken.type === "Punctuator" && startToken.value === "{") { firstTokenOfElseBlock = sourceCode.getTokenAfter(startToken); } else { firstTokenOfElseBlock = startToken; } // If the if block does not have curly braces and does not end in a semicolon // and the else block starts with (, [, /, +, ` or -, then it is not // safe to remove the else keyword, because ASI will not add a semicolon // after the if block var ifBlockMaybeUnsafe = node.parent.consequent.type !== "BlockStatement" && lastIfToken.value !== ";"; var elseBlockUnsafe = /^[([/+`-]/.test(firstTokenOfElseBlock.value); if (ifBlockMaybeUnsafe && elseBlockUnsafe) { return null; } var endToken = sourceCode.getLastToken(node); var lastTokenOfElseBlock = sourceCode.getTokenBefore(endToken); if (lastTokenOfElseBlock.value !== ";") { var nextToken = sourceCode.getTokenAfter(endToken); var nextTokenUnsafe = nextToken && /^[([/+`-]/.test(nextToken.value); var nextTokenOnSameLine = nextToken && nextToken.loc.start.line === lastTokenOfElseBlock.loc.start.line; // If the else block contents does not end in a semicolon, // and the else block starts with (, [, /, +, ` or -, then it is not // safe to remove the else block, because ASI will not add a semicolon // after the remaining else block contents if (nextTokenUnsafe || nextTokenOnSameLine && nextToken.value !== "}") { return null; } } if (startToken.type === "Punctuator" && startToken.value === "{") { fixedSource = source.slice(1, -1); } else { fixedSource = source; } // Extend the replacement range to include the entire // function to avoid conflicting with no-useless-return. // https://github.com/eslint/eslint/issues/8026 return new FixTracker(fixer, sourceCode).retainEnclosingFunction(node).replaceTextRange([elseToken.start, node.end], fixedSource); } }); } /** * Check to see if the node is a ReturnStatement * * @param {Node} node The node being evaluated * @returns {boolean} True if node is a return */ function checkForReturn(node) { return node.type === "ReturnStatement"; } /** * Naive return checking, does not iterate through the whole * BlockStatement because we make the assumption that the ReturnStatement * will be the last node in the body of the BlockStatement. * * @param {Node} node The consequent/alternate node * @returns {boolean} True if it has a return */ function naiveHasReturn(node) { if (node.type === "BlockStatement") { var body = node.body, lastChildNode = body[body.length - 1]; return lastChildNode && checkForReturn(lastChildNode); } return checkForReturn(node); } /** * Check to see if the node is valid for evaluation, * meaning it has an else and not an else-if * * @param {Node} node The node being evaluated * @returns {boolean} True if the node is valid */ function hasElse(node) { return node.alternate && node.consequent && node.alternate.type !== "IfStatement"; } /** * If the consequent is an IfStatement, check to see if it has an else * and both its consequent and alternate path return, meaning this is * a nested case of rule violation. If-Else not considered currently. * * @param {Node} node The consequent node * @returns {boolean} True if this is a nested rule violation */ function checkForIf(node) { return node.type === "IfStatement" && hasElse(node) && naiveHasReturn(node.alternate) && naiveHasReturn(node.consequent); } /** * Check the consequent/body node to make sure it is not * a ReturnStatement or an IfStatement that returns on both * code paths. * * @param {Node} node The consequent or body node * @param {Node} alternate The alternate node * @returns {boolean} `true` if it is a Return/If node that always returns. */ function checkForReturnOrIf(node) { return checkForReturn(node) || checkForIf(node); } /** * Check whether a node returns in every codepath. * @param {Node} node The node to be checked * @returns {boolean} `true` if it returns on every codepath. */ function alwaysReturns(node) { if (node.type === "BlockStatement") { // If we have a BlockStatement, check each consequent body node. return node.body.some(checkForReturnOrIf); } /* * If not a block statement, make sure the consequent isn't a * ReturnStatement or an IfStatement with returns on both paths. */ return checkForReturnOrIf(node); } /** * Check the if statement * @returns {void} * @param {Node} node The node for the if statement to check * @private */ function IfStatement(node) { var parent = context.getAncestors().pop(); var consequents = void 0, alternate = void 0; /* * Fixing this would require splitting one statement into two, so no error should * be reported if this node is in a position where only one statement is allowed. */ if (!astUtils.STATEMENT_LIST_PARENTS.has(parent.type)) { return; } for (consequents = []; node.type === "IfStatement"; node = node.alternate) { if (!node.alternate) { return; } consequents.push(node.consequent); alternate = node.alternate; } if (consequents.every(alwaysReturns)) { displayReport(alternate); } } //-------------------------------------------------------------------------- // Public API //-------------------------------------------------------------------------- return { "IfStatement:exit": IfStatement }; } }; },{"../ast-utils":67,"../util/fix-tracker":348}],172:[function(require,module,exports){ /** * @fileoverview Rule to flag the use of empty character classes in regular expressions * @author Ian Christian Myers */ "use strict"; //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /* plain-English description of the following regexp: 0. `^` fix the match at the beginning of the string 1. `\/`: the `/` that begins the regexp 2. `([^\\[]|\\.|\[([^\\\]]|\\.)+\])*`: regexp contents; 0 or more of the following 2.0. `[^\\[]`: any character that's not a `\` or a `[` (anything but escape sequences and character classes) 2.1. `\\.`: an escape sequence 2.2. `\[([^\\\]]|\\.)+\]`: a character class that isn't empty 3. `\/` the `/` that ends the regexp 4. `[gimuy]*`: optional regexp flags 5. `$`: fix the match at the end of the string */ var regex = /^\/([^\\[]|\\.|\[([^\\\]]|\\.)+])*\/[gimuy]*$/; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow empty character classes in regular expressions", category: "Possible Errors", recommended: true }, schema: [] }, create: function create(context) { var sourceCode = context.getSourceCode(); return { Literal: function Literal(node) { var token = sourceCode.getFirstToken(node); if (token.type === "RegularExpression" && !regex.test(token.value)) { context.report({ node: node, message: "Empty class." }); } } }; } }; },{}],173:[function(require,module,exports){ /** * @fileoverview Rule to disallow empty functions. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var ALLOW_OPTIONS = Object.freeze(["functions", "arrowFunctions", "generatorFunctions", "methods", "generatorMethods", "getters", "setters", "constructors"]); /** * Gets the kind of a given function node. * * @param {ASTNode} node - A function node to get. This is one of * an ArrowFunctionExpression, a FunctionDeclaration, or a * FunctionExpression. * @returns {string} The kind of the function. This is one of "functions", * "arrowFunctions", "generatorFunctions", "asyncFunctions", "methods", * "generatorMethods", "asyncMethods", "getters", "setters", and * "constructors". */ function getKind(node) { var parent = node.parent; var kind = ""; if (node.type === "ArrowFunctionExpression") { return "arrowFunctions"; } // Detects main kind. if (parent.type === "Property") { if (parent.kind === "get") { return "getters"; } if (parent.kind === "set") { return "setters"; } kind = parent.method ? "methods" : "functions"; } else if (parent.type === "MethodDefinition") { if (parent.kind === "get") { return "getters"; } if (parent.kind === "set") { return "setters"; } if (parent.kind === "constructor") { return "constructors"; } kind = "methods"; } else { kind = "functions"; } // Detects prefix. var prefix = ""; if (node.generator) { prefix = "generator"; } else if (node.async) { prefix = "async"; } else { return kind; } return prefix + kind[0].toUpperCase() + kind.slice(1); } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow empty functions", category: "Best Practices", recommended: false }, schema: [{ type: "object", properties: { allow: { type: "array", items: { enum: ALLOW_OPTIONS }, uniqueItems: true } }, additionalProperties: false }] }, create: function create(context) { var options = context.options[0] || {}; var allowed = options.allow || []; var sourceCode = context.getSourceCode(); /** * Reports a given function node if the node matches the following patterns. * * - Not allowed by options. * - The body is empty. * - The body doesn't have any comments. * * @param {ASTNode} node - A function node to report. This is one of * an ArrowFunctionExpression, a FunctionDeclaration, or a * FunctionExpression. * @returns {void} */ function reportIfEmpty(node) { var kind = getKind(node); var name = astUtils.getFunctionNameWithKind(node); var innerComments = sourceCode.getTokens(node.body, { includeComments: true, filter: astUtils.isCommentToken }); if (allowed.indexOf(kind) === -1 && node.body.type === "BlockStatement" && node.body.body.length === 0 && innerComments.length === 0) { context.report({ node: node, loc: node.body.loc.start, message: "Unexpected empty {{name}}.", data: { name: name } }); } } return { ArrowFunctionExpression: reportIfEmpty, FunctionDeclaration: reportIfEmpty, FunctionExpression: reportIfEmpty }; } }; },{"../ast-utils":67}],174:[function(require,module,exports){ /** * @fileoverview Rule to disallow an empty pattern * @author Alberto Rodríguez */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow empty destructuring patterns", category: "Best Practices", recommended: true }, schema: [] }, create: function create(context) { return { ObjectPattern: function ObjectPattern(node) { if (node.properties.length === 0) { context.report({ node: node, message: "Unexpected empty object pattern." }); } }, ArrayPattern: function ArrayPattern(node) { if (node.elements.length === 0) { context.report({ node: node, message: "Unexpected empty array pattern." }); } } }; } }; },{}],175:[function(require,module,exports){ /** * @fileoverview Rule to flag use of an empty block statement * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow empty block statements", category: "Possible Errors", recommended: true }, schema: [{ type: "object", properties: { allowEmptyCatch: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var options = context.options[0] || {}, allowEmptyCatch = options.allowEmptyCatch || false; var sourceCode = context.getSourceCode(); return { BlockStatement: function BlockStatement(node) { // if the body is not empty, we can just return immediately if (node.body.length !== 0) { return; } // a function is generally allowed to be empty if (astUtils.isFunction(node.parent)) { return; } if (allowEmptyCatch && node.parent.type === "CatchClause") { return; } // any other block is only allowed to be empty, if it contains a comment if (sourceCode.getCommentsInside(node).length > 0) { return; } context.report({ node: node, message: "Empty block statement." }); }, SwitchStatement: function SwitchStatement(node) { if (typeof node.cases === "undefined" || node.cases.length === 0) { context.report({ node: node, message: "Empty switch statement." }); } } }; } }; },{"../ast-utils":67}],176:[function(require,module,exports){ /** * @fileoverview Rule to flag comparisons to null without a type-checking * operator. * @author Ian Christian Myers */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow `null` comparisons without type-checking operators", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { return { BinaryExpression: function BinaryExpression(node) { var badOperator = node.operator === "==" || node.operator === "!="; if (node.right.type === "Literal" && node.right.raw === "null" && badOperator || node.left.type === "Literal" && node.left.raw === "null" && badOperator) { context.report({ node: node, message: "Use ‘===’ to compare with ‘null’." }); } } }; } }; },{}],177:[function(require,module,exports){ /** * @fileoverview Rule to flag use of eval() statement * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var candidatesOfGlobalObject = Object.freeze(["global", "window"]); /** * Checks a given node is a Identifier node of the specified name. * * @param {ASTNode} node - A node to check. * @param {string} name - A name to check. * @returns {boolean} `true` if the node is a Identifier node of the name. */ function isIdentifier(node, name) { return node.type === "Identifier" && node.name === name; } /** * Checks a given node is a Literal node of the specified string value. * * @param {ASTNode} node - A node to check. * @param {string} name - A name to check. * @returns {boolean} `true` if the node is a Literal node of the name. */ function isConstant(node, name) { switch (node.type) { case "Literal": return node.value === name; case "TemplateLiteral": return node.expressions.length === 0 && node.quasis[0].value.cooked === name; default: return false; } } /** * Checks a given node is a MemberExpression node which has the specified name's * property. * * @param {ASTNode} node - A node to check. * @param {string} name - A name to check. * @returns {boolean} `true` if the node is a MemberExpression node which has * the specified name's property */ function isMember(node, name) { return node.type === "MemberExpression" && (node.computed ? isConstant : isIdentifier)(node.property, name); } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow the use of `eval()`", category: "Best Practices", recommended: false }, schema: [{ type: "object", properties: { allowIndirect: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var allowIndirect = Boolean(context.options[0] && context.options[0].allowIndirect); var sourceCode = context.getSourceCode(); var funcInfo = null; /** * Pushs a variable scope (Program or Function) information to the stack. * * This is used in order to check whether or not `this` binding is a * reference to the global object. * * @param {ASTNode} node - A node of the scope. This is one of Program, * FunctionDeclaration, FunctionExpression, and ArrowFunctionExpression. * @returns {void} */ function enterVarScope(node) { var strict = context.getScope().isStrict; funcInfo = { upper: funcInfo, node: node, strict: strict, defaultThis: false, initialized: strict }; } /** * Pops a variable scope from the stack. * * @returns {void} */ function exitVarScope() { funcInfo = funcInfo.upper; } /** * Reports a given node. * * `node` is `Identifier` or `MemberExpression`. * The parent of `node` might be `CallExpression`. * * The location of the report is always `eval` `Identifier` (or possibly * `Literal`). The type of the report is `CallExpression` if the parent is * `CallExpression`. Otherwise, it's the given node type. * * @param {ASTNode} node - A node to report. * @returns {void} */ function report(node) { var locationNode = node; var parent = node.parent; if (node.type === "MemberExpression") { locationNode = node.property; } if (parent.type === "CallExpression" && parent.callee === node) { node = parent; } context.report({ node: node, loc: locationNode.loc.start, message: "eval can be harmful." }); } /** * Reports accesses of `eval` via the global object. * * @param {eslint-scope.Scope} globalScope - The global scope. * @returns {void} */ function reportAccessingEvalViaGlobalObject(globalScope) { for (var i = 0; i < candidatesOfGlobalObject.length; ++i) { var name = candidatesOfGlobalObject[i]; var variable = astUtils.getVariableByName(globalScope, name); if (!variable) { continue; } var references = variable.references; for (var j = 0; j < references.length; ++j) { var identifier = references[j].identifier; var node = identifier.parent; // To detect code like `window.window.eval`. while (isMember(node, name)) { node = node.parent; } // Reports. if (isMember(node, "eval")) { report(node); } } } } /** * Reports all accesses of `eval` (excludes direct calls to eval). * * @param {eslint-scope.Scope} globalScope - The global scope. * @returns {void} */ function reportAccessingEval(globalScope) { var variable = astUtils.getVariableByName(globalScope, "eval"); if (!variable) { return; } var references = variable.references; for (var i = 0; i < references.length; ++i) { var reference = references[i]; var id = reference.identifier; if (id.name === "eval" && !astUtils.isCallee(id)) { // Is accessing to eval (excludes direct calls to eval) report(id); } } } if (allowIndirect) { // Checks only direct calls to eval. It's simple! return { "CallExpression:exit": function CallExpressionExit(node) { var callee = node.callee; if (isIdentifier(callee, "eval")) { report(callee); } } }; } return { "CallExpression:exit": function CallExpressionExit(node) { var callee = node.callee; if (isIdentifier(callee, "eval")) { report(callee); } }, Program: function Program(node) { var scope = context.getScope(), features = context.parserOptions.ecmaFeatures || {}, strict = scope.isStrict || node.sourceType === "module" || features.globalReturn && scope.childScopes[0].isStrict; funcInfo = { upper: null, node: node, strict: strict, defaultThis: true, initialized: true }; }, "Program:exit": function ProgramExit() { var globalScope = context.getScope(); exitVarScope(); reportAccessingEval(globalScope); reportAccessingEvalViaGlobalObject(globalScope); }, FunctionDeclaration: enterVarScope, "FunctionDeclaration:exit": exitVarScope, FunctionExpression: enterVarScope, "FunctionExpression:exit": exitVarScope, ArrowFunctionExpression: enterVarScope, "ArrowFunctionExpression:exit": exitVarScope, ThisExpression: function ThisExpression(node) { if (!isMember(node.parent, "eval")) { return; } /* * `this.eval` is found. * Checks whether or not the value of `this` is the global object. */ if (!funcInfo.initialized) { funcInfo.initialized = true; funcInfo.defaultThis = astUtils.isDefaultThisBinding(funcInfo.node, sourceCode); } if (!funcInfo.strict && funcInfo.defaultThis) { // `this.eval` is possible built-in `eval`. report(node.parent); } } }; } }; },{"../ast-utils":67}],178:[function(require,module,exports){ /** * @fileoverview Rule to flag assignment of the exception parameter * @author Stephen Murray */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow reassigning exceptions in `catch` clauses", category: "Possible Errors", recommended: true }, schema: [] }, create: function create(context) { /** * Finds and reports references that are non initializer and writable. * @param {Variable} variable - A variable to check. * @returns {void} */ function checkVariable(variable) { astUtils.getModifyingReferences(variable.references).forEach(function (reference) { context.report({ node: reference.identifier, message: "Do not assign to the exception parameter." }); }); } return { CatchClause: function CatchClause(node) { context.getDeclaredVariables(node).forEach(checkVariable); } }; } }; },{"../ast-utils":67}],179:[function(require,module,exports){ /** * @fileoverview Rule to flag adding properties to native object's prototypes. * @author David Nelson */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); var globals = require("globals"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var propertyDefinitionMethods = new Set(["defineProperty", "defineProperties"]); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow extending native types", category: "Best Practices", recommended: false }, schema: [{ type: "object", properties: { exceptions: { type: "array", items: { type: "string" }, uniqueItems: true } }, additionalProperties: false }] }, create: function create(context) { var config = context.options[0] || {}; var exceptions = new Set(config.exceptions || []); var modifiedBuiltins = new Set(Object.keys(globals.builtin).filter(function (builtin) { return builtin[0].toUpperCase() === builtin[0]; }).filter(function (builtin) { return !exceptions.has(builtin); })); /** * Reports a lint error for the given node. * @param {ASTNode} node The node to report. * @param {string} builtin The name of the native builtin being extended. * @returns {void} */ function reportNode(node, builtin) { context.report({ node: node, message: "{{builtin}} prototype is read only, properties should not be added.", data: { builtin: builtin } }); } /** * Check to see if the `prototype` property of the given object * identifier node is being accessed. * @param {ASTNode} identifierNode The Identifier representing the object * to check. * @returns {boolean} True if the identifier is the object of a * MemberExpression and its `prototype` property is being accessed, * false otherwise. */ function isPrototypePropertyAccessed(identifierNode) { return Boolean(identifierNode && identifierNode.parent && identifierNode.parent.type === "MemberExpression" && identifierNode.parent.object === identifierNode && astUtils.getStaticPropertyName(identifierNode.parent) === "prototype"); } /** * Checks that an identifier is an object of a prototype whose member * is being assigned in an AssignmentExpression. * Example: Object.prototype.foo = "bar" * @param {ASTNode} identifierNode The identifier to check. * @returns {boolean} True if the identifier's prototype is modified. */ function isInPrototypePropertyAssignment(identifierNode) { return Boolean(isPrototypePropertyAccessed(identifierNode) && identifierNode.parent.parent.type === "MemberExpression" && identifierNode.parent.parent.parent.type === "AssignmentExpression" && identifierNode.parent.parent.parent.left === identifierNode.parent.parent); } /** * Checks that an identifier is an object of a prototype whose member * is being extended via the Object.defineProperty() or * Object.defineProperties() methods. * Example: Object.defineProperty(Array.prototype, "foo", ...) * Example: Object.defineProperties(Array.prototype, ...) * @param {ASTNode} identifierNode The identifier to check. * @returns {boolean} True if the identifier's prototype is modified. */ function isInDefinePropertyCall(identifierNode) { return Boolean(isPrototypePropertyAccessed(identifierNode) && identifierNode.parent.parent.type === "CallExpression" && identifierNode.parent.parent.arguments[0] === identifierNode.parent && identifierNode.parent.parent.callee.type === "MemberExpression" && identifierNode.parent.parent.callee.object.type === "Identifier" && identifierNode.parent.parent.callee.object.name === "Object" && identifierNode.parent.parent.callee.property.type === "Identifier" && propertyDefinitionMethods.has(identifierNode.parent.parent.callee.property.name)); } /** * Check to see if object prototype access is part of a prototype * extension. There are three ways a prototype can be extended: * 1. Assignment to prototype property (Object.prototype.foo = 1) * 2. Object.defineProperty()/Object.defineProperties() on a prototype * If prototype extension is detected, report the AssignmentExpression * or CallExpression node. * @param {ASTNode} identifierNode The Identifier representing the object * which prototype is being accessed and possibly extended. * @returns {void} */ function checkAndReportPrototypeExtension(identifierNode) { if (isInPrototypePropertyAssignment(identifierNode)) { // Identifier --> MemberExpression --> MemberExpression --> AssignmentExpression reportNode(identifierNode.parent.parent.parent, identifierNode.name); } else if (isInDefinePropertyCall(identifierNode)) { // Identifier --> MemberExpression --> CallExpression reportNode(identifierNode.parent.parent, identifierNode.name); } } return { "Program:exit": function ProgramExit() { var globalScope = context.getScope(); modifiedBuiltins.forEach(function (builtin) { var builtinVar = globalScope.set.get(builtin); if (builtinVar && builtinVar.references) { builtinVar.references.map(function (ref) { return ref.identifier; }).forEach(checkAndReportPrototypeExtension); } }); } }; } }; },{"../ast-utils":67,"globals":38}],180:[function(require,module,exports){ /** * @fileoverview Rule to flag unnecessary bind calls * @author Bence Dányi */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow unnecessary calls to `.bind()`", category: "Best Practices", recommended: false }, schema: [], fixable: "code" }, create: function create(context) { var scopeInfo = null; /** * Reports a given function node. * * @param {ASTNode} node - A node to report. This is a FunctionExpression or * an ArrowFunctionExpression. * @returns {void} */ function report(node) { context.report({ node: node.parent.parent, message: "The function binding is unnecessary.", loc: node.parent.property.loc.start, fix: function fix(fixer) { var firstTokenToRemove = context.getSourceCode().getFirstTokenBetween(node.parent.object, node.parent.property, astUtils.isNotClosingParenToken); return fixer.removeRange([firstTokenToRemove.range[0], node.parent.parent.range[1]]); } }); } /** * Checks whether or not a given function node is the callee of `.bind()` * method. * * e.g. `(function() {}.bind(foo))` * * @param {ASTNode} node - A node to report. This is a FunctionExpression or * an ArrowFunctionExpression. * @returns {boolean} `true` if the node is the callee of `.bind()` method. */ function isCalleeOfBindMethod(node) { var parent = node.parent; var grandparent = parent.parent; return grandparent && grandparent.type === "CallExpression" && grandparent.callee === parent && grandparent.arguments.length === 1 && parent.type === "MemberExpression" && parent.object === node && astUtils.getStaticPropertyName(parent) === "bind"; } /** * Adds a scope information object to the stack. * * @param {ASTNode} node - A node to add. This node is a FunctionExpression * or a FunctionDeclaration node. * @returns {void} */ function enterFunction(node) { scopeInfo = { isBound: isCalleeOfBindMethod(node), thisFound: false, upper: scopeInfo }; } /** * Removes the scope information object from the top of the stack. * At the same time, this reports the function node if the function has * `.bind()` and the `this` keywords found. * * @param {ASTNode} node - A node to remove. This node is a * FunctionExpression or a FunctionDeclaration node. * @returns {void} */ function exitFunction(node) { if (scopeInfo.isBound && !scopeInfo.thisFound) { report(node); } scopeInfo = scopeInfo.upper; } /** * Reports a given arrow function if the function is callee of `.bind()` * method. * * @param {ASTNode} node - A node to report. This node is an * ArrowFunctionExpression. * @returns {void} */ function exitArrowFunction(node) { if (isCalleeOfBindMethod(node)) { report(node); } } /** * Set the mark as the `this` keyword was found in this scope. * * @returns {void} */ function markAsThisFound() { if (scopeInfo) { scopeInfo.thisFound = true; } } return { "ArrowFunctionExpression:exit": exitArrowFunction, FunctionDeclaration: enterFunction, "FunctionDeclaration:exit": exitFunction, FunctionExpression: enterFunction, "FunctionExpression:exit": exitFunction, ThisExpression: markAsThisFound }; } }; },{"../ast-utils":67}],181:[function(require,module,exports){ /** * @fileoverview Rule to flag unnecessary double negation in Boolean contexts * @author Brandon Mills */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow unnecessary boolean casts", category: "Possible Errors", recommended: true }, schema: [], fixable: "code" }, create: function create(context) { var sourceCode = context.getSourceCode(); // Node types which have a test which will coerce values to booleans. var BOOLEAN_NODE_TYPES = ["IfStatement", "DoWhileStatement", "WhileStatement", "ConditionalExpression", "ForStatement"]; /** * Check if a node is in a context where its value would be coerced to a boolean at runtime. * * @param {Object} node The node * @param {Object} parent Its parent * @returns {boolean} If it is in a boolean context */ function isInBooleanContext(node, parent) { return BOOLEAN_NODE_TYPES.indexOf(parent.type) !== -1 && node === parent.test || // ! parent.type === "UnaryExpression" && parent.operator === "!"; } return { UnaryExpression: function UnaryExpression(node) { var ancestors = context.getAncestors(), parent = ancestors.pop(), grandparent = ancestors.pop(); // Exit early if it's guaranteed not to match if (node.operator !== "!" || parent.type !== "UnaryExpression" || parent.operator !== "!") { return; } if (isInBooleanContext(parent, grandparent) || // Boolean() and new Boolean() (grandparent.type === "CallExpression" || grandparent.type === "NewExpression") && grandparent.callee.type === "Identifier" && grandparent.callee.name === "Boolean") { context.report({ node: node, message: "Redundant double negation.", fix: function fix(fixer) { return fixer.replaceText(parent, sourceCode.getText(node.argument)); } }); } }, CallExpression: function CallExpression(node) { var parent = node.parent; if (node.callee.type !== "Identifier" || node.callee.name !== "Boolean") { return; } if (isInBooleanContext(node, parent)) { context.report({ node: node, message: "Redundant Boolean call.", fix: function fix(fixer) { if (!node.arguments.length) { return fixer.replaceText(parent, "true"); } if (node.arguments.length > 1 || node.arguments[0].type === "SpreadElement") { return null; } var argument = node.arguments[0]; if (astUtils.getPrecedence(argument) < astUtils.getPrecedence(node.parent)) { return fixer.replaceText(node, "(" + sourceCode.getText(argument) + ")"); } return fixer.replaceText(node, sourceCode.getText(argument)); } }); } } }; } }; },{"../ast-utils":67}],182:[function(require,module,exports){ /** * @fileoverview Rule to disallow unnecessary labels * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow unnecessary labels", category: "Best Practices", recommended: false }, schema: [], fixable: "code" }, create: function create(context) { var sourceCode = context.getSourceCode(); var scopeInfo = null; /** * Creates a new scope with a breakable statement. * * @param {ASTNode} node - A node to create. This is a BreakableStatement. * @returns {void} */ function enterBreakableStatement(node) { scopeInfo = { label: node.parent.type === "LabeledStatement" ? node.parent.label : null, breakable: true, upper: scopeInfo }; } /** * Removes the top scope of the stack. * * @returns {void} */ function exitBreakableStatement() { scopeInfo = scopeInfo.upper; } /** * Creates a new scope with a labeled statement. * * This ignores it if the body is a breakable statement. * In this case it's handled in the `enterBreakableStatement` function. * * @param {ASTNode} node - A node to create. This is a LabeledStatement. * @returns {void} */ function enterLabeledStatement(node) { if (!astUtils.isBreakableStatement(node.body)) { scopeInfo = { label: node.label, breakable: false, upper: scopeInfo }; } } /** * Removes the top scope of the stack. * * This ignores it if the body is a breakable statement. * In this case it's handled in the `exitBreakableStatement` function. * * @param {ASTNode} node - A node. This is a LabeledStatement. * @returns {void} */ function exitLabeledStatement(node) { if (!astUtils.isBreakableStatement(node.body)) { scopeInfo = scopeInfo.upper; } } /** * Reports a given control node if it's unnecessary. * * @param {ASTNode} node - A node. This is a BreakStatement or a * ContinueStatement. * @returns {void} */ function reportIfUnnecessary(node) { if (!node.label) { return; } var labelNode = node.label; for (var info = scopeInfo; info !== null; info = info.upper) { if (info.breakable || info.label && info.label.name === labelNode.name) { if (info.breakable && info.label && info.label.name === labelNode.name) { context.report({ node: labelNode, message: "This label '{{name}}' is unnecessary.", data: labelNode, fix: function fix(fixer) { return fixer.removeRange([sourceCode.getFirstToken(node).range[1], labelNode.range[1]]); } }); } return; } } } return { WhileStatement: enterBreakableStatement, "WhileStatement:exit": exitBreakableStatement, DoWhileStatement: enterBreakableStatement, "DoWhileStatement:exit": exitBreakableStatement, ForStatement: enterBreakableStatement, "ForStatement:exit": exitBreakableStatement, ForInStatement: enterBreakableStatement, "ForInStatement:exit": exitBreakableStatement, ForOfStatement: enterBreakableStatement, "ForOfStatement:exit": exitBreakableStatement, SwitchStatement: enterBreakableStatement, "SwitchStatement:exit": exitBreakableStatement, LabeledStatement: enterLabeledStatement, "LabeledStatement:exit": exitLabeledStatement, BreakStatement: reportIfUnnecessary, ContinueStatement: reportIfUnnecessary }; } }; },{"../ast-utils":67}],183:[function(require,module,exports){ /** * @fileoverview Disallow parenthesising higher precedence subexpressions. * @author Michael Ficarra */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ var astUtils = require("../ast-utils.js"); module.exports = { meta: { docs: { description: "disallow unnecessary parentheses", category: "Possible Errors", recommended: false }, fixable: "code", schema: { anyOf: [{ type: "array", items: [{ enum: ["functions"] }], minItems: 0, maxItems: 1 }, { type: "array", items: [{ enum: ["all"] }, { type: "object", properties: { conditionalAssign: { type: "boolean" }, nestedBinaryExpressions: { type: "boolean" }, returnAssign: { type: "boolean" }, ignoreJSX: { enum: ["none", "all", "single-line", "multi-line"] } }, additionalProperties: false }], minItems: 0, maxItems: 2 }] } }, create: function create(context) { var sourceCode = context.getSourceCode(); var tokensToIgnore = new WeakSet(); var isParenthesised = astUtils.isParenthesised.bind(astUtils, sourceCode); var precedence = astUtils.getPrecedence; var ALL_NODES = context.options[0] !== "functions"; var EXCEPT_COND_ASSIGN = ALL_NODES && context.options[1] && context.options[1].conditionalAssign === false; var NESTED_BINARY = ALL_NODES && context.options[1] && context.options[1].nestedBinaryExpressions === false; var EXCEPT_RETURN_ASSIGN = ALL_NODES && context.options[1] && context.options[1].returnAssign === false; var IGNORE_JSX = ALL_NODES && context.options[1] && context.options[1].ignoreJSX; var PRECEDENCE_OF_ASSIGNMENT_EXPR = precedence({ type: "AssignmentExpression" }); var PRECEDENCE_OF_UPDATE_EXPR = precedence({ type: "UpdateExpression" }); /** * Determines if this rule should be enforced for a node given the current configuration. * @param {ASTNode} node - The node to be checked. * @returns {boolean} True if the rule should be enforced for this node. * @private */ function ruleApplies(node) { if (node.type === "JSXElement") { var isSingleLine = node.loc.start.line === node.loc.end.line; switch (IGNORE_JSX) { // Exclude this JSX element from linting case "all": return false; // Exclude this JSX element if it is multi-line element case "multi-line": return isSingleLine; // Exclude this JSX element if it is single-line element case "single-line": return !isSingleLine; // Nothing special to be done for JSX elements case "none": break; // no default } } return ALL_NODES || node.type === "FunctionExpression" || node.type === "ArrowFunctionExpression"; } /** * Determines if a node is surrounded by parentheses twice. * @param {ASTNode} node - The node to be checked. * @returns {boolean} True if the node is doubly parenthesised. * @private */ function isParenthesisedTwice(node) { var previousToken = sourceCode.getTokenBefore(node, 1), nextToken = sourceCode.getTokenAfter(node, 1); return isParenthesised(node) && previousToken && nextToken && astUtils.isOpeningParenToken(previousToken) && previousToken.range[1] <= node.range[0] && astUtils.isClosingParenToken(nextToken) && nextToken.range[0] >= node.range[1]; } /** * Determines if a node is surrounded by (potentially) invalid parentheses. * @param {ASTNode} node - The node to be checked. * @returns {boolean} True if the node is incorrectly parenthesised. * @private */ function hasExcessParens(node) { return ruleApplies(node) && isParenthesised(node); } /** * Determines if a node that is expected to be parenthesised is surrounded by * (potentially) invalid extra parentheses. * @param {ASTNode} node - The node to be checked. * @returns {boolean} True if the node is has an unexpected extra pair of parentheses. * @private */ function hasDoubleExcessParens(node) { return ruleApplies(node) && isParenthesisedTwice(node); } /** * Determines if a node test expression is allowed to have a parenthesised assignment * @param {ASTNode} node - The node to be checked. * @returns {boolean} True if the assignment can be parenthesised. * @private */ function isCondAssignException(node) { return EXCEPT_COND_ASSIGN && node.test.type === "AssignmentExpression"; } /** * Determines if a node is in a return statement * @param {ASTNode} node - The node to be checked. * @returns {boolean} True if the node is in a return statement. * @private */ function isInReturnStatement(node) { while (node) { if (node.type === "ReturnStatement" || node.type === "ArrowFunctionExpression" && node.body.type !== "BlockStatement") { return true; } node = node.parent; } return false; } /** * Determines if a constructor function is newed-up with parens * @param {ASTNode} newExpression - The NewExpression node to be checked. * @returns {boolean} True if the constructor is called with parens. * @private */ function isNewExpressionWithParens(newExpression) { var lastToken = sourceCode.getLastToken(newExpression); var penultimateToken = sourceCode.getTokenBefore(lastToken); return newExpression.arguments.length > 0 || astUtils.isOpeningParenToken(penultimateToken) && astUtils.isClosingParenToken(lastToken); } /** * Determines if a node is or contains an assignment expression * @param {ASTNode} node - The node to be checked. * @returns {boolean} True if the node is or contains an assignment expression. * @private */ function containsAssignment(node) { if (node.type === "AssignmentExpression") { return true; } else if (node.type === "ConditionalExpression" && (node.consequent.type === "AssignmentExpression" || node.alternate.type === "AssignmentExpression")) { return true; } else if (node.left && node.left.type === "AssignmentExpression" || node.right && node.right.type === "AssignmentExpression") { return true; } return false; } /** * Determines if a node is contained by or is itself a return statement and is allowed to have a parenthesised assignment * @param {ASTNode} node - The node to be checked. * @returns {boolean} True if the assignment can be parenthesised. * @private */ function isReturnAssignException(node) { if (!EXCEPT_RETURN_ASSIGN || !isInReturnStatement(node)) { return false; } if (node.type === "ReturnStatement") { return node.argument && containsAssignment(node.argument); } else if (node.type === "ArrowFunctionExpression" && node.body.type !== "BlockStatement") { return containsAssignment(node.body); } return containsAssignment(node); } /** * Determines if a node following a [no LineTerminator here] restriction is * surrounded by (potentially) invalid extra parentheses. * @param {Token} token - The token preceding the [no LineTerminator here] restriction. * @param {ASTNode} node - The node to be checked. * @returns {boolean} True if the node is incorrectly parenthesised. * @private */ function hasExcessParensNoLineTerminator(token, node) { if (token.loc.end.line === node.loc.start.line) { return hasExcessParens(node); } return hasDoubleExcessParens(node); } /** * Determines whether a node should be preceded by an additional space when removing parens * @param {ASTNode} node node to evaluate; must be surrounded by parentheses * @returns {boolean} `true` if a space should be inserted before the node * @private */ function requiresLeadingSpace(node) { var leftParenToken = sourceCode.getTokenBefore(node); var tokenBeforeLeftParen = sourceCode.getTokenBefore(node, 1); var firstToken = sourceCode.getFirstToken(node); return tokenBeforeLeftParen && tokenBeforeLeftParen.range[1] === leftParenToken.range[0] && leftParenToken.range[1] === firstToken.range[0] && !astUtils.canTokensBeAdjacent(tokenBeforeLeftParen, firstToken); } /** * Determines whether a node should be followed by an additional space when removing parens * @param {ASTNode} node node to evaluate; must be surrounded by parentheses * @returns {boolean} `true` if a space should be inserted after the node * @private */ function requiresTrailingSpace(node) { var nextTwoTokens = sourceCode.getTokensAfter(node, { count: 2 }); var rightParenToken = nextTwoTokens[0]; var tokenAfterRightParen = nextTwoTokens[1]; var tokenBeforeRightParen = sourceCode.getLastToken(node); return rightParenToken && tokenAfterRightParen && !sourceCode.isSpaceBetweenTokens(rightParenToken, tokenAfterRightParen) && !astUtils.canTokensBeAdjacent(tokenBeforeRightParen, tokenAfterRightParen); } /** * Report the node * @param {ASTNode} node node to evaluate * @returns {void} * @private */ function report(node) { var leftParenToken = sourceCode.getTokenBefore(node); var rightParenToken = sourceCode.getTokenAfter(node); if (tokensToIgnore.has(sourceCode.getFirstToken(node)) && !isParenthesisedTwice(node)) { return; } context.report({ node: node, loc: leftParenToken.loc.start, message: "Gratuitous parentheses around expression.", fix: function fix(fixer) { var parenthesizedSource = sourceCode.text.slice(leftParenToken.range[1], rightParenToken.range[0]); return fixer.replaceTextRange([leftParenToken.range[0], rightParenToken.range[1]], (requiresLeadingSpace(node) ? " " : "") + parenthesizedSource + (requiresTrailingSpace(node) ? " " : "")); } }); } /** * Evaluate Unary update * @param {ASTNode} node node to evaluate * @returns {void} * @private */ function checkUnaryUpdate(node) { if (node.type === "UnaryExpression" && node.argument.type === "BinaryExpression" && node.argument.operator === "**") { return; } if (hasExcessParens(node.argument) && precedence(node.argument) >= precedence(node)) { report(node.argument); } } /** * Evaluate a new call * @param {ASTNode} node node to evaluate * @returns {void} * @private */ function checkCallNew(node) { if (hasExcessParens(node.callee) && precedence(node.callee) >= precedence(node) && !(node.type === "CallExpression" && (node.callee.type === "FunctionExpression" || node.callee.type === "NewExpression" && !isNewExpressionWithParens(node.callee)) && // One set of parentheses are allowed for a function expression !hasDoubleExcessParens(node.callee))) { report(node.callee); } if (node.arguments.length === 1) { if (hasDoubleExcessParens(node.arguments[0]) && precedence(node.arguments[0]) >= PRECEDENCE_OF_ASSIGNMENT_EXPR) { report(node.arguments[0]); } } else { [].forEach.call(node.arguments, function (arg) { if (hasExcessParens(arg) && precedence(arg) >= PRECEDENCE_OF_ASSIGNMENT_EXPR) { report(arg); } }); } } /** * Evaluate binary logicals * @param {ASTNode} node node to evaluate * @returns {void} * @private */ function checkBinaryLogical(node) { var prec = precedence(node); var leftPrecedence = precedence(node.left); var rightPrecedence = precedence(node.right); var isExponentiation = node.operator === "**"; var shouldSkipLeft = NESTED_BINARY && (node.left.type === "BinaryExpression" || node.left.type === "LogicalExpression") || node.left.type === "UnaryExpression" && isExponentiation; var shouldSkipRight = NESTED_BINARY && (node.right.type === "BinaryExpression" || node.right.type === "LogicalExpression"); if (!shouldSkipLeft && hasExcessParens(node.left) && (leftPrecedence > prec || leftPrecedence === prec && !isExponentiation)) { report(node.left); } if (!shouldSkipRight && hasExcessParens(node.right) && (rightPrecedence > prec || rightPrecedence === prec && isExponentiation)) { report(node.right); } } /** * Check the parentheses around the super class of the given class definition. * @param {ASTNode} node The node of class declarations to check. * @returns {void} */ function checkClass(node) { if (!node.superClass) { return; } // If `node.superClass` is a LeftHandSideExpression, parentheses are extra. // Otherwise, parentheses are needed. var hasExtraParens = precedence(node.superClass) > PRECEDENCE_OF_UPDATE_EXPR ? hasExcessParens(node.superClass) : hasDoubleExcessParens(node.superClass); if (hasExtraParens) { report(node.superClass); } } /** * Check the parentheses around the argument of the given spread operator. * @param {ASTNode} node The node of spread elements/properties to check. * @returns {void} */ function checkSpreadOperator(node) { var hasExtraParens = precedence(node.argument) >= PRECEDENCE_OF_ASSIGNMENT_EXPR ? hasExcessParens(node.argument) : hasDoubleExcessParens(node.argument); if (hasExtraParens) { report(node.argument); } } /** * Checks the parentheses for an ExpressionStatement or ExportDefaultDeclaration * @param {ASTNode} node The ExpressionStatement.expression or ExportDefaultDeclaration.declaration node * @returns {void} */ function checkExpressionOrExportStatement(node) { var firstToken = isParenthesised(node) ? sourceCode.getTokenBefore(node) : sourceCode.getFirstToken(node); var secondToken = sourceCode.getTokenAfter(firstToken, astUtils.isNotOpeningParenToken); if (astUtils.isOpeningParenToken(firstToken) && (astUtils.isOpeningBraceToken(secondToken) || secondToken.type === "Keyword" && (secondToken.value === "function" || secondToken.value === "class" || secondToken.value === "let" && astUtils.isOpeningBracketToken(sourceCode.getTokenAfter(secondToken))))) { tokensToIgnore.add(secondToken); } if (hasExcessParens(node)) { report(node); } } return { ArrayExpression: function ArrayExpression(node) { [].forEach.call(node.elements, function (e) { if (e && hasExcessParens(e) && precedence(e) >= PRECEDENCE_OF_ASSIGNMENT_EXPR) { report(e); } }); }, ArrowFunctionExpression: function ArrowFunctionExpression(node) { if (isReturnAssignException(node)) { return; } if (node.body.type !== "BlockStatement") { var firstBodyToken = sourceCode.getFirstToken(node.body, astUtils.isNotOpeningParenToken); var tokenBeforeFirst = sourceCode.getTokenBefore(firstBodyToken); if (astUtils.isOpeningParenToken(tokenBeforeFirst) && astUtils.isOpeningBraceToken(firstBodyToken)) { tokensToIgnore.add(firstBodyToken); } if (hasExcessParens(node.body) && precedence(node.body) >= PRECEDENCE_OF_ASSIGNMENT_EXPR) { report(node.body); } } }, AssignmentExpression: function AssignmentExpression(node) { if (isReturnAssignException(node)) { return; } if (hasExcessParens(node.right) && precedence(node.right) >= precedence(node)) { report(node.right); } }, BinaryExpression: checkBinaryLogical, CallExpression: checkCallNew, ConditionalExpression: function ConditionalExpression(node) { if (isReturnAssignException(node)) { return; } if (hasExcessParens(node.test) && precedence(node.test) >= precedence({ type: "LogicalExpression", operator: "||" })) { report(node.test); } if (hasExcessParens(node.consequent) && precedence(node.consequent) >= PRECEDENCE_OF_ASSIGNMENT_EXPR) { report(node.consequent); } if (hasExcessParens(node.alternate) && precedence(node.alternate) >= PRECEDENCE_OF_ASSIGNMENT_EXPR) { report(node.alternate); } }, DoWhileStatement: function DoWhileStatement(node) { if (hasDoubleExcessParens(node.test) && !isCondAssignException(node)) { report(node.test); } }, ExportDefaultDeclaration: function ExportDefaultDeclaration(node) { return checkExpressionOrExportStatement(node.declaration); }, ExpressionStatement: function ExpressionStatement(node) { return checkExpressionOrExportStatement(node.expression); }, ForInStatement: function ForInStatement(node) { if (hasExcessParens(node.right)) { report(node.right); } if (hasExcessParens(node.left)) { report(node.left); } }, ForOfStatement: function ForOfStatement(node) { if (hasExcessParens(node.right)) { report(node.right); } if (hasExcessParens(node.left)) { report(node.left); } }, ForStatement: function ForStatement(node) { if (node.init && hasExcessParens(node.init)) { report(node.init); } if (node.test && hasExcessParens(node.test) && !isCondAssignException(node)) { report(node.test); } if (node.update && hasExcessParens(node.update)) { report(node.update); } }, IfStatement: function IfStatement(node) { if (hasDoubleExcessParens(node.test) && !isCondAssignException(node)) { report(node.test); } }, LogicalExpression: checkBinaryLogical, MemberExpression: function MemberExpression(node) { if (hasExcessParens(node.object) && precedence(node.object) >= precedence(node) && (node.computed || !(astUtils.isDecimalInteger(node.object) || // RegExp literal is allowed to have parens (#1589) node.object.type === "Literal" && node.object.regex))) { report(node.object); } if (node.computed && hasExcessParens(node.property)) { report(node.property); } }, NewExpression: checkCallNew, ObjectExpression: function ObjectExpression(node) { [].forEach.call(node.properties, function (e) { var v = e.value; if (v && hasExcessParens(v) && precedence(v) >= PRECEDENCE_OF_ASSIGNMENT_EXPR) { report(v); } }); }, ReturnStatement: function ReturnStatement(node) { var returnToken = sourceCode.getFirstToken(node); if (isReturnAssignException(node)) { return; } if (node.argument && hasExcessParensNoLineTerminator(returnToken, node.argument) && // RegExp literal is allowed to have parens (#1589) !(node.argument.type === "Literal" && node.argument.regex)) { report(node.argument); } }, SequenceExpression: function SequenceExpression(node) { [].forEach.call(node.expressions, function (e) { if (hasExcessParens(e) && precedence(e) >= precedence(node)) { report(e); } }); }, SwitchCase: function SwitchCase(node) { if (node.test && hasExcessParens(node.test)) { report(node.test); } }, SwitchStatement: function SwitchStatement(node) { if (hasDoubleExcessParens(node.discriminant)) { report(node.discriminant); } }, ThrowStatement: function ThrowStatement(node) { var throwToken = sourceCode.getFirstToken(node); if (hasExcessParensNoLineTerminator(throwToken, node.argument)) { report(node.argument); } }, UnaryExpression: checkUnaryUpdate, UpdateExpression: checkUnaryUpdate, AwaitExpression: checkUnaryUpdate, VariableDeclarator: function VariableDeclarator(node) { if (node.init && hasExcessParens(node.init) && precedence(node.init) >= PRECEDENCE_OF_ASSIGNMENT_EXPR && // RegExp literal is allowed to have parens (#1589) !(node.init.type === "Literal" && node.init.regex)) { report(node.init); } }, WhileStatement: function WhileStatement(node) { if (hasDoubleExcessParens(node.test) && !isCondAssignException(node)) { report(node.test); } }, WithStatement: function WithStatement(node) { if (hasDoubleExcessParens(node.object)) { report(node.object); } }, YieldExpression: function YieldExpression(node) { if (node.argument) { var yieldToken = sourceCode.getFirstToken(node); if (precedence(node.argument) >= precedence(node) && hasExcessParensNoLineTerminator(yieldToken, node.argument) || hasDoubleExcessParens(node.argument)) { report(node.argument); } } }, ClassDeclaration: checkClass, ClassExpression: checkClass, SpreadElement: checkSpreadOperator, SpreadProperty: checkSpreadOperator, ExperimentalSpreadProperty: checkSpreadOperator }; } }; },{"../ast-utils.js":67}],184:[function(require,module,exports){ /** * @fileoverview Rule to flag use of unnecessary semicolons * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var FixTracker = require("../util/fix-tracker"); var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow unnecessary semicolons", category: "Possible Errors", recommended: true }, fixable: "code", schema: [] }, create: function create(context) { var sourceCode = context.getSourceCode(); /** * Reports an unnecessary semicolon error. * @param {Node|Token} nodeOrToken - A node or a token to be reported. * @returns {void} */ function report(nodeOrToken) { context.report({ node: nodeOrToken, message: "Unnecessary semicolon.", fix: function fix(fixer) { // Expand the replacement range to include the surrounding // tokens to avoid conflicting with semi. // https://github.com/eslint/eslint/issues/7928 return new FixTracker(fixer, context.getSourceCode()).retainSurroundingTokens(nodeOrToken).remove(nodeOrToken); } }); } /** * Checks for a part of a class body. * This checks tokens from a specified token to a next MethodDefinition or the end of class body. * * @param {Token} firstToken - The first token to check. * @returns {void} */ function checkForPartOfClassBody(firstToken) { for (var token = firstToken; token.type === "Punctuator" && !astUtils.isClosingBraceToken(token); token = sourceCode.getTokenAfter(token)) { if (astUtils.isSemicolonToken(token)) { report(token); } } } return { /** * Reports this empty statement, except if the parent node is a loop. * @param {Node} node - A EmptyStatement node to be reported. * @returns {void} */ EmptyStatement: function EmptyStatement(node) { var parent = node.parent, allowedParentTypes = ["ForStatement", "ForInStatement", "ForOfStatement", "WhileStatement", "DoWhileStatement", "IfStatement", "LabeledStatement", "WithStatement"]; if (allowedParentTypes.indexOf(parent.type) === -1) { report(node); } }, /** * Checks tokens from the head of this class body to the first MethodDefinition or the end of this class body. * @param {Node} node - A ClassBody node to check. * @returns {void} */ ClassBody: function ClassBody(node) { checkForPartOfClassBody(sourceCode.getFirstToken(node, 1)); // 0 is `{`. }, /** * Checks tokens from this MethodDefinition to the next MethodDefinition or the end of this class body. * @param {Node} node - A MethodDefinition node of the start point. * @returns {void} */ MethodDefinition: function MethodDefinition(node) { checkForPartOfClassBody(sourceCode.getTokenAfter(node)); } }; } }; },{"../ast-utils":67,"../util/fix-tracker":348}],185:[function(require,module,exports){ /** * @fileoverview Rule to flag fall-through cases in switch statements. * @author Matt DuVall */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var lodash = require("lodash"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var DEFAULT_FALLTHROUGH_COMMENT = /falls?\s?through/i; /** * Checks whether or not a given node has a fallthrough comment. * @param {ASTNode} node - A SwitchCase node to get comments. * @param {RuleContext} context - A rule context which stores comments. * @param {RegExp} fallthroughCommentPattern - A pattern to match comment to. * @returns {boolean} `true` if the node has a valid fallthrough comment. */ function hasFallthroughComment(node, context, fallthroughCommentPattern) { var sourceCode = context.getSourceCode(); var comment = lodash.last(sourceCode.getCommentsBefore(node)); return Boolean(comment && fallthroughCommentPattern.test(comment.value)); } /** * Checks whether or not a given code path segment is reachable. * @param {CodePathSegment} segment - A CodePathSegment to check. * @returns {boolean} `true` if the segment is reachable. */ function isReachable(segment) { return segment.reachable; } /** * Checks whether a node and a token are separated by blank lines * @param {ASTNode} node - The node to check * @param {Token} token - The token to compare against * @returns {boolean} `true` if there are blank lines between node and token */ function hasBlankLinesBetween(node, token) { return token.loc.start.line > node.loc.end.line + 1; } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow fallthrough of `case` statements", category: "Best Practices", recommended: true }, schema: [{ type: "object", properties: { commentPattern: { type: "string" } }, additionalProperties: false }] }, create: function create(context) { var options = context.options[0] || {}; var currentCodePath = null; var sourceCode = context.getSourceCode(); /* * We need to use leading comments of the next SwitchCase node because * trailing comments is wrong if semicolons are omitted. */ var fallthroughCase = null; var fallthroughCommentPattern = null; if (options.commentPattern) { fallthroughCommentPattern = new RegExp(options.commentPattern); } else { fallthroughCommentPattern = DEFAULT_FALLTHROUGH_COMMENT; } return { onCodePathStart: function onCodePathStart(codePath) { currentCodePath = codePath; }, onCodePathEnd: function onCodePathEnd() { currentCodePath = currentCodePath.upper; }, SwitchCase: function SwitchCase(node) { /* * Checks whether or not there is a fallthrough comment. * And reports the previous fallthrough node if that does not exist. */ if (fallthroughCase && !hasFallthroughComment(node, context, fallthroughCommentPattern)) { context.report({ message: "Expected a 'break' statement before '{{type}}'.", data: { type: node.test ? "case" : "default" }, node: node }); } fallthroughCase = null; }, "SwitchCase:exit": function SwitchCaseExit(node) { var nextToken = sourceCode.getTokenAfter(node); /* * `reachable` meant fall through because statements preceded by * `break`, `return`, or `throw` are unreachable. * And allows empty cases and the last case. */ if (currentCodePath.currentSegments.some(isReachable) && (node.consequent.length > 0 || hasBlankLinesBetween(node, nextToken)) && lodash.last(node.parent.cases) !== node) { fallthroughCase = node; } } }; } }; },{"lodash":48}],186:[function(require,module,exports){ /** * @fileoverview Rule to flag use of a leading/trailing decimal point in a numeric literal * @author James Allardice */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow leading or trailing decimal points in numeric literals", category: "Best Practices", recommended: false }, schema: [], fixable: "code" }, create: function create(context) { var sourceCode = context.getSourceCode(); return { Literal: function Literal(node) { if (typeof node.value === "number") { if (node.raw.startsWith(".")) { context.report({ node: node, message: "A leading decimal point can be confused with a dot.", fix: function fix(fixer) { var tokenBefore = sourceCode.getTokenBefore(node); var needsSpaceBefore = tokenBefore && tokenBefore.range[1] === node.range[0] && !astUtils.canTokensBeAdjacent(tokenBefore, "0" + node.raw); return fixer.insertTextBefore(node, needsSpaceBefore ? " 0" : "0"); } }); } if (node.raw.indexOf(".") === node.raw.length - 1) { context.report({ node: node, message: "A trailing decimal point can be confused with a dot.", fix: function fix(fixer) { return fixer.insertTextAfter(node, "0"); } }); } } } }; } }; },{"../ast-utils":67}],187:[function(require,module,exports){ /** * @fileoverview Rule to flag use of function declaration identifiers as variables. * @author Ian Christian Myers */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow reassigning `function` declarations", category: "Possible Errors", recommended: true }, schema: [] }, create: function create(context) { /** * Reports a reference if is non initializer and writable. * @param {References} references - Collection of reference to check. * @returns {void} */ function checkReference(references) { astUtils.getModifyingReferences(references).forEach(function (reference) { context.report({ node: reference.identifier, message: "'{{name}}' is a function.", data: { name: reference.identifier.name } }); }); } /** * Finds and reports references that are non initializer and writable. * @param {Variable} variable - A variable to check. * @returns {void} */ function checkVariable(variable) { if (variable.defs[0].type === "FunctionName") { checkReference(variable.references); } } /** * Checks parameters of a given function node. * @param {ASTNode} node - A function node to check. * @returns {void} */ function checkForFunction(node) { context.getDeclaredVariables(node).forEach(checkVariable); } return { FunctionDeclaration: checkForFunction, FunctionExpression: checkForFunction }; } }; },{"../ast-utils":67}],188:[function(require,module,exports){ /** * @fileoverview Rule to disallow assignments to native objects or read-only global variables * @author Ilya Volodin */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow assignments to native objects or read-only global variables", category: "Best Practices", recommended: true }, schema: [{ type: "object", properties: { exceptions: { type: "array", items: { type: "string" }, uniqueItems: true } }, additionalProperties: false }] }, create: function create(context) { var config = context.options[0]; var exceptions = config && config.exceptions || []; /** * Reports write references. * @param {Reference} reference - A reference to check. * @param {int} index - The index of the reference in the references. * @param {Reference[]} references - The array that the reference belongs to. * @returns {void} */ function checkReference(reference, index, references) { var identifier = reference.identifier; if (reference.init === false && reference.isWrite() && ( // Destructuring assignments can have multiple default value, // so possibly there are multiple writeable references for the same identifier. index === 0 || references[index - 1].identifier !== identifier)) { context.report({ node: identifier, message: "Read-only global '{{name}}' should not be modified.", data: identifier }); } } /** * Reports write references if a given variable is read-only builtin. * @param {Variable} variable - A variable to check. * @returns {void} */ function checkVariable(variable) { if (variable.writeable === false && exceptions.indexOf(variable.name) === -1) { variable.references.forEach(checkReference); } } return { Program: function Program() { var globalScope = context.getScope(); globalScope.variables.forEach(checkVariable); } }; } }; },{}],189:[function(require,module,exports){ /** * @fileoverview A rule to disallow the type conversions with shorter notations. * @author Toru Nagashima */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var INDEX_OF_PATTERN = /^(?:i|lastI)ndexOf$/; var ALLOWABLE_OPERATORS = ["~", "!!", "+", "*"]; /** * Parses and normalizes an option object. * @param {Object} options - An option object to parse. * @returns {Object} The parsed and normalized option object. */ function parseOptions(options) { options = options || {}; return { boolean: "boolean" in options ? Boolean(options.boolean) : true, number: "number" in options ? Boolean(options.number) : true, string: "string" in options ? Boolean(options.string) : true, allow: options.allow || [] }; } /** * Checks whether or not a node is a double logical nigating. * @param {ASTNode} node - An UnaryExpression node to check. * @returns {boolean} Whether or not the node is a double logical nigating. */ function isDoubleLogicalNegating(node) { return node.operator === "!" && node.argument.type === "UnaryExpression" && node.argument.operator === "!"; } /** * Checks whether or not a node is a binary negating of `.indexOf()` method calling. * @param {ASTNode} node - An UnaryExpression node to check. * @returns {boolean} Whether or not the node is a binary negating of `.indexOf()` method calling. */ function isBinaryNegatingOfIndexOf(node) { return node.operator === "~" && node.argument.type === "CallExpression" && node.argument.callee.type === "MemberExpression" && node.argument.callee.property.type === "Identifier" && INDEX_OF_PATTERN.test(node.argument.callee.property.name); } /** * Checks whether or not a node is a multiplying by one. * @param {BinaryExpression} node - A BinaryExpression node to check. * @returns {boolean} Whether or not the node is a multiplying by one. */ function isMultiplyByOne(node) { return node.operator === "*" && (node.left.type === "Literal" && node.left.value === 1 || node.right.type === "Literal" && node.right.value === 1); } /** * Checks whether the result of a node is numeric or not * @param {ASTNode} node The node to test * @returns {boolean} true if the node is a number literal or a `Number()`, `parseInt` or `parseFloat` call */ function isNumeric(node) { return node.type === "Literal" && typeof node.value === "number" || node.type === "CallExpression" && (node.callee.name === "Number" || node.callee.name === "parseInt" || node.callee.name === "parseFloat"); } /** * Returns the first non-numeric operand in a BinaryExpression. Designed to be * used from bottom to up since it walks up the BinaryExpression trees using * node.parent to find the result. * @param {BinaryExpression} node The BinaryExpression node to be walked up on * @returns {ASTNode|null} The first non-numeric item in the BinaryExpression tree or null */ function getNonNumericOperand(node) { var left = node.left, right = node.right; if (right.type !== "BinaryExpression" && !isNumeric(right)) { return right; } if (left.type !== "BinaryExpression" && !isNumeric(left)) { return left; } return null; } /** * Checks whether a node is an empty string literal or not. * @param {ASTNode} node The node to check. * @returns {boolean} Whether or not the passed in node is an * empty string literal or not. */ function isEmptyString(node) { return astUtils.isStringLiteral(node) && (node.value === "" || node.type === "TemplateLiteral" && node.quasis.length === 1 && node.quasis[0].value.cooked === ""); } /** * Checks whether or not a node is a concatenating with an empty string. * @param {ASTNode} node - A BinaryExpression node to check. * @returns {boolean} Whether or not the node is a concatenating with an empty string. */ function isConcatWithEmptyString(node) { return node.operator === "+" && (isEmptyString(node.left) && !astUtils.isStringLiteral(node.right) || isEmptyString(node.right) && !astUtils.isStringLiteral(node.left)); } /** * Checks whether or not a node is appended with an empty string. * @param {ASTNode} node - An AssignmentExpression node to check. * @returns {boolean} Whether or not the node is appended with an empty string. */ function isAppendEmptyString(node) { return node.operator === "+=" && isEmptyString(node.right); } /** * Returns the operand that is not an empty string from a flagged BinaryExpression. * @param {ASTNode} node - The flagged BinaryExpression node to check. * @returns {ASTNode} The operand that is not an empty string from a flagged BinaryExpression. */ function getNonEmptyOperand(node) { return isEmptyString(node.left) ? node.right : node.left; } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow shorthand type conversions", category: "Best Practices", recommended: false }, fixable: "code", schema: [{ type: "object", properties: { boolean: { type: "boolean" }, number: { type: "boolean" }, string: { type: "boolean" }, allow: { type: "array", items: { enum: ALLOWABLE_OPERATORS }, uniqueItems: true } }, additionalProperties: false }] }, create: function create(context) { var options = parseOptions(context.options[0]); var sourceCode = context.getSourceCode(); /** * Reports an error and autofixes the node * @param {ASTNode} node - An ast node to report the error on. * @param {string} recommendation - The recommended code for the issue * @param {bool} shouldFix - Whether this report should fix the node * @returns {void} */ function report(node, recommendation, shouldFix) { shouldFix = typeof shouldFix === "undefined" ? true : shouldFix; context.report({ node: node, message: "use `{{recommendation}}` instead.", data: { recommendation: recommendation }, fix: function fix(fixer) { if (!shouldFix) { return null; } var tokenBefore = sourceCode.getTokenBefore(node); if (tokenBefore && tokenBefore.range[1] === node.range[0] && !astUtils.canTokensBeAdjacent(tokenBefore, recommendation)) { return fixer.replaceText(node, " " + recommendation); } return fixer.replaceText(node, recommendation); } }); } return { UnaryExpression: function UnaryExpression(node) { var operatorAllowed = void 0; // !!foo operatorAllowed = options.allow.indexOf("!!") >= 0; if (!operatorAllowed && options.boolean && isDoubleLogicalNegating(node)) { var recommendation = "Boolean(" + sourceCode.getText(node.argument.argument) + ")"; report(node, recommendation); } // ~foo.indexOf(bar) operatorAllowed = options.allow.indexOf("~") >= 0; if (!operatorAllowed && options.boolean && isBinaryNegatingOfIndexOf(node)) { var _recommendation = sourceCode.getText(node.argument) + " !== -1"; report(node, _recommendation, false); } // +foo operatorAllowed = options.allow.indexOf("+") >= 0; if (!operatorAllowed && options.number && node.operator === "+" && !isNumeric(node.argument)) { var _recommendation2 = "Number(" + sourceCode.getText(node.argument) + ")"; report(node, _recommendation2); } }, // Use `:exit` to prevent double reporting "BinaryExpression:exit": function BinaryExpressionExit(node) { var operatorAllowed = void 0; // 1 * foo operatorAllowed = options.allow.indexOf("*") >= 0; var nonNumericOperand = !operatorAllowed && options.number && isMultiplyByOne(node) && getNonNumericOperand(node); if (nonNumericOperand) { var recommendation = "Number(" + sourceCode.getText(nonNumericOperand) + ")"; report(node, recommendation); } // "" + foo operatorAllowed = options.allow.indexOf("+") >= 0; if (!operatorAllowed && options.string && isConcatWithEmptyString(node)) { var _recommendation3 = "String(" + sourceCode.getText(getNonEmptyOperand(node)) + ")"; report(node, _recommendation3); } }, AssignmentExpression: function AssignmentExpression(node) { // foo += "" var operatorAllowed = options.allow.indexOf("+") >= 0; if (!operatorAllowed && options.string && isAppendEmptyString(node)) { var code = sourceCode.getText(getNonEmptyOperand(node)); var recommendation = code + " = String(" + code + ")"; report(node, recommendation); } } }; } }; },{"../ast-utils":67}],190:[function(require,module,exports){ /** * @fileoverview Rule to check for implicit global variables and functions. * @author Joshua Peek */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow variable and `function` declarations in the global scope", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { return { Program: function Program() { var scope = context.getScope(); scope.variables.forEach(function (variable) { if (variable.writeable) { return; } variable.defs.forEach(function (def) { if (def.type === "FunctionName" || def.type === "Variable" && def.parent.kind === "var") { context.report({ node: def.node, message: "Implicit global variable, assign as global property instead." }); } }); }); scope.implicit.variables.forEach(function (variable) { var scopeVariable = scope.set.get(variable.name); if (scopeVariable && scopeVariable.writeable) { return; } variable.defs.forEach(function (def) { context.report({ node: def.node, message: "Implicit global variable, assign as global property instead." }); }); }); } }; } }; },{}],191:[function(require,module,exports){ /** * @fileoverview Rule to flag use of implied eval via setTimeout and setInterval * @author James Allardice */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow the use of `eval()`-like methods", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { var CALLEE_RE = /^(setTimeout|setInterval|execScript)$/; /* * Figures out if we should inspect a given binary expression. Is a stack * of stacks, where the first element in each substack is a CallExpression. */ var impliedEvalAncestorsStack = []; //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Get the last element of an array, without modifying arr, like pop(), but non-destructive. * @param {array} arr What to inspect * @returns {*} The last element of arr * @private */ function last(arr) { return arr ? arr[arr.length - 1] : null; } /** * Checks if the given MemberExpression node is a potentially implied eval identifier on window. * @param {ASTNode} node The MemberExpression node to check. * @returns {boolean} Whether or not the given node is potentially an implied eval. * @private */ function isImpliedEvalMemberExpression(node) { var object = node.object, property = node.property, hasImpliedEvalName = CALLEE_RE.test(property.name) || CALLEE_RE.test(property.value); return object.name === "window" && hasImpliedEvalName; } /** * Determines if a node represents a call to a potentially implied eval. * * This checks the callee name and that there's an argument, but not the type of the argument. * * @param {ASTNode} node The CallExpression to check. * @returns {boolean} True if the node matches, false if not. * @private */ function isImpliedEvalCallExpression(node) { var isMemberExpression = node.callee.type === "MemberExpression", isIdentifier = node.callee.type === "Identifier", isImpliedEvalCallee = isIdentifier && CALLEE_RE.test(node.callee.name) || isMemberExpression && isImpliedEvalMemberExpression(node.callee); return isImpliedEvalCallee && node.arguments.length; } /** * Checks that the parent is a direct descendent of an potential implied eval CallExpression, and if the parent is a CallExpression, that we're the first argument. * @param {ASTNode} node The node to inspect the parent of. * @returns {boolean} Was the parent a direct descendent, and is the child therefore potentially part of a dangerous argument? * @private */ function hasImpliedEvalParent(node) { // make sure our parent is marked return node.parent === last(last(impliedEvalAncestorsStack)) && ( // if our parent is a CallExpression, make sure we're the first argument node.parent.type !== "CallExpression" || node === node.parent.arguments[0]); } /** * Checks if our parent is marked as part of an implied eval argument. If * so, collapses the top of impliedEvalAncestorsStack and reports on the * original CallExpression. * @param {ASTNode} node The CallExpression to check. * @returns {boolean} True if the node matches, false if not. * @private */ function checkString(node) { if (hasImpliedEvalParent(node)) { // remove the entire substack, to avoid duplicate reports var substack = impliedEvalAncestorsStack.pop(); context.report({ node: substack[0], message: "Implied eval. Consider passing a function instead of a string." }); } } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { CallExpression: function CallExpression(node) { if (isImpliedEvalCallExpression(node)) { // call expressions create a new substack impliedEvalAncestorsStack.push([node]); } }, "CallExpression:exit": function CallExpressionExit(node) { if (node === last(last(impliedEvalAncestorsStack))) { /* Destroys the entire sub-stack, rather than just using * last(impliedEvalAncestorsStack).pop(), as a CallExpression is * always the bottom of a impliedEvalAncestorsStack substack. */ impliedEvalAncestorsStack.pop(); } }, BinaryExpression: function BinaryExpression(node) { if (node.operator === "+" && hasImpliedEvalParent(node)) { last(impliedEvalAncestorsStack).push(node); } }, "BinaryExpression:exit": function BinaryExpressionExit(node) { if (node === last(last(impliedEvalAncestorsStack))) { last(impliedEvalAncestorsStack).pop(); } }, Literal: function Literal(node) { if (typeof node.value === "string") { checkString(node); } }, TemplateLiteral: function TemplateLiteral(node) { checkString(node); } }; } }; },{}],192:[function(require,module,exports){ /** * @fileoverview Enforces or disallows inline comments. * @author Greg Cochard */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow inline comments after code", category: "Stylistic Issues", recommended: false }, schema: [] }, create: function create(context) { var sourceCode = context.getSourceCode(); /** * Will check that comments are not on lines starting with or ending with code * @param {ASTNode} node The comment node to check * @private * @returns {void} */ function testCodeAroundComment(node) { // Get the whole line and cut it off at the start of the comment var startLine = String(sourceCode.lines[node.loc.start.line - 1]); var endLine = String(sourceCode.lines[node.loc.end.line - 1]); var preamble = startLine.slice(0, node.loc.start.column).trim(); // Also check after the comment var postamble = endLine.slice(node.loc.end.column).trim(); // Check that this comment isn't an ESLint directive var isDirective = astUtils.isDirectiveComment(node); // Should be empty if there was only whitespace around the comment if (!isDirective && (preamble || postamble)) { context.report({ node: node, message: "Unexpected comment inline with code." }); } } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { Program: function Program() { var comments = sourceCode.getAllComments(); comments.filter(function (token) { return token.type !== "Shebang"; }).forEach(testCodeAroundComment); } }; } }; },{"../ast-utils":67}],193:[function(require,module,exports){ /** * @fileoverview Rule to enforce declarations in program or function body root. * @author Brandon Mills */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow variable or `function` declarations in nested blocks", category: "Possible Errors", recommended: true }, schema: [{ enum: ["functions", "both"] }] }, create: function create(context) { /** * Find the nearest Program or Function ancestor node. * @returns {Object} Ancestor's type and distance from node. */ function nearestBody() { var ancestors = context.getAncestors(); var ancestor = ancestors.pop(), generation = 1; while (ancestor && ["Program", "FunctionDeclaration", "FunctionExpression", "ArrowFunctionExpression"].indexOf(ancestor.type) < 0) { generation += 1; ancestor = ancestors.pop(); } return { // Type of containing ancestor type: ancestor.type, // Separation between ancestor and node distance: generation }; } /** * Ensure that a given node is at a program or function body's root. * @param {ASTNode} node Declaration node to check. * @returns {void} */ function check(node) { var body = nearestBody(), valid = body.type === "Program" && body.distance === 1 || body.distance === 2; if (!valid) { context.report({ node: node, message: "Move {{type}} declaration to {{body}} root.", data: { type: node.type === "FunctionDeclaration" ? "function" : "variable", body: body.type === "Program" ? "program" : "function body" } }); } } return { FunctionDeclaration: check, VariableDeclaration: function VariableDeclaration(node) { if (context.options[0] === "both" && node.kind === "var") { check(node); } } }; } }; },{}],194:[function(require,module,exports){ /** * @fileoverview Validate strings passed to the RegExp constructor * @author Michael Ficarra */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var espree = require("espree"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow invalid regular expression strings in `RegExp` constructors", category: "Possible Errors", recommended: true }, schema: [{ type: "object", properties: { allowConstructorFlags: { type: "array", items: { type: "string" } } }, additionalProperties: false }] }, create: function create(context) { var options = context.options[0]; var allowedFlags = ""; if (options && options.allowConstructorFlags) { allowedFlags = options.allowConstructorFlags.join(""); } /** * Check if node is a string * @param {ASTNode} node node to evaluate * @returns {boolean} True if its a string * @private */ function isString(node) { return node && node.type === "Literal" && typeof node.value === "string"; } /** * Validate strings passed to the RegExp constructor * @param {ASTNode} node node to evaluate * @returns {void} * @private */ function check(node) { if (node.callee.type === "Identifier" && node.callee.name === "RegExp" && isString(node.arguments[0])) { var flags = isString(node.arguments[1]) ? node.arguments[1].value : ""; if (allowedFlags) { flags = flags.replace(new RegExp("[" + allowedFlags + "]", "gi"), ""); } try { void new RegExp(node.arguments[0].value); } catch (e) { context.report({ node: node, message: "{{message}}.", data: e }); } if (flags) { try { espree.parse("/./" + flags, context.parserOptions); } catch (ex) { context.report({ node: node, message: "Invalid flags supplied to RegExp constructor '{{flags}}'.", data: { flags: flags } }); } } } } return { CallExpression: check, NewExpression: check }; } }; },{"espree":"espree"}],195:[function(require,module,exports){ /** * @fileoverview A rule to disallow `this` keywords outside of classes or class-like objects. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow `this` keywords outside of classes or class-like objects", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { var stack = [], sourceCode = context.getSourceCode(); /** * Gets the current checking context. * * The return value has a flag that whether or not `this` keyword is valid. * The flag is initialized when got at the first time. * * @returns {{valid: boolean}} * an object which has a flag that whether or not `this` keyword is valid. */ stack.getCurrent = function () { var current = this[this.length - 1]; if (!current.init) { current.init = true; current.valid = !astUtils.isDefaultThisBinding(current.node, sourceCode); } return current; }; /** * Pushs new checking context into the stack. * * The checking context is not initialized yet. * Because most functions don't have `this` keyword. * When `this` keyword was found, the checking context is initialized. * * @param {ASTNode} node - A function node that was entered. * @returns {void} */ function enterFunction(node) { // `this` can be invalid only under strict mode. stack.push({ init: !context.getScope().isStrict, node: node, valid: true }); } /** * Pops the current checking context from the stack. * @returns {void} */ function exitFunction() { stack.pop(); } return { /* * `this` is invalid only under strict mode. * Modules is always strict mode. */ Program: function Program(node) { var scope = context.getScope(), features = context.parserOptions.ecmaFeatures || {}; stack.push({ init: true, node: node, valid: !(scope.isStrict || node.sourceType === "module" || features.globalReturn && scope.childScopes[0].isStrict) }); }, "Program:exit": function ProgramExit() { stack.pop(); }, FunctionDeclaration: enterFunction, "FunctionDeclaration:exit": exitFunction, FunctionExpression: enterFunction, "FunctionExpression:exit": exitFunction, // Reports if `this` of the current context is invalid. ThisExpression: function ThisExpression(node) { var current = stack.getCurrent(); if (current && !current.valid) { context.report({ node: node, message: "Unexpected 'this'." }); } } }; } }; },{"../ast-utils":67}],196:[function(require,module,exports){ /** * @fileoverview Rule to disalow whitespace that is not a tab or space, whitespace inside strings and comments are allowed * @author Jonathan Kingston * @author Christophe Porteneuve */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Constants //------------------------------------------------------------------------------ var ALL_IRREGULARS = /[\f\v\u0085\ufeff\u00a0\u1680\u180e\u2000\u2001\u2002\u2003\u2004\u2005\u2006\u2007\u2008\u2009\u200a\u200b\u202f\u205f\u3000\u2028\u2029]/; var IRREGULAR_WHITESPACE = /[\f\v\u0085\ufeff\u00a0\u1680\u180e\u2000\u2001\u2002\u2003\u2004\u2005\u2006\u2007\u2008\u2009\u200a\u200b\u202f\u205f\u3000]+/mg; var IRREGULAR_LINE_TERMINATORS = /[\u2028\u2029]/mg; var LINE_BREAK = astUtils.createGlobalLinebreakMatcher(); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow irregular whitespace outside of strings and comments", category: "Possible Errors", recommended: true }, schema: [{ type: "object", properties: { skipComments: { type: "boolean" }, skipStrings: { type: "boolean" }, skipTemplates: { type: "boolean" }, skipRegExps: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { // Module store of errors that we have found var errors = []; // Lookup the `skipComments` option, which defaults to `false`. var options = context.options[0] || {}; var skipComments = !!options.skipComments; var skipStrings = options.skipStrings !== false; var skipRegExps = !!options.skipRegExps; var skipTemplates = !!options.skipTemplates; var sourceCode = context.getSourceCode(); var commentNodes = sourceCode.getAllComments(); /** * Removes errors that occur inside a string node * @param {ASTNode} node to check for matching errors. * @returns {void} * @private */ function removeWhitespaceError(node) { var locStart = node.loc.start; var locEnd = node.loc.end; errors = errors.filter(function (error) { var errorLoc = error[1]; if (errorLoc.line >= locStart.line && errorLoc.line <= locEnd.line) { if (errorLoc.column >= locStart.column && (errorLoc.column <= locEnd.column || errorLoc.line < locEnd.line)) { return false; } } return true; }); } /** * Checks identifier or literal nodes for errors that we are choosing to ignore and calls the relevant methods to remove the errors * @param {ASTNode} node to check for matching errors. * @returns {void} * @private */ function removeInvalidNodeErrorsInIdentifierOrLiteral(node) { var shouldCheckStrings = skipStrings && typeof node.value === "string"; var shouldCheckRegExps = skipRegExps && node.value instanceof RegExp; if (shouldCheckStrings || shouldCheckRegExps) { // If we have irregular characters remove them from the errors list if (ALL_IRREGULARS.test(node.raw)) { removeWhitespaceError(node); } } } /** * Checks template string literal nodes for errors that we are choosing to ignore and calls the relevant methods to remove the errors * @param {ASTNode} node to check for matching errors. * @returns {void} * @private */ function removeInvalidNodeErrorsInTemplateLiteral(node) { if (typeof node.value.raw === "string") { if (ALL_IRREGULARS.test(node.value.raw)) { removeWhitespaceError(node); } } } /** * Checks comment nodes for errors that we are choosing to ignore and calls the relevant methods to remove the errors * @param {ASTNode} node to check for matching errors. * @returns {void} * @private */ function removeInvalidNodeErrorsInComment(node) { if (ALL_IRREGULARS.test(node.value)) { removeWhitespaceError(node); } } /** * Checks the program source for irregular whitespace * @param {ASTNode} node The program node * @returns {void} * @private */ function checkForIrregularWhitespace(node) { var sourceLines = sourceCode.lines; sourceLines.forEach(function (sourceLine, lineIndex) { var lineNumber = lineIndex + 1; var match = void 0; while ((match = IRREGULAR_WHITESPACE.exec(sourceLine)) !== null) { var location = { line: lineNumber, column: match.index }; errors.push([node, location, "Irregular whitespace not allowed."]); } }); } /** * Checks the program source for irregular line terminators * @param {ASTNode} node The program node * @returns {void} * @private */ function checkForIrregularLineTerminators(node) { var source = sourceCode.getText(), sourceLines = sourceCode.lines, linebreaks = source.match(LINE_BREAK); var lastLineIndex = -1, match = void 0; while ((match = IRREGULAR_LINE_TERMINATORS.exec(source)) !== null) { var lineIndex = linebreaks.indexOf(match[0], lastLineIndex + 1) || 0; var location = { line: lineIndex + 1, column: sourceLines[lineIndex].length }; errors.push([node, location, "Irregular whitespace not allowed."]); lastLineIndex = lineIndex; } } /** * A no-op function to act as placeholder for comment accumulation when the `skipComments` option is `false`. * @returns {void} * @private */ function noop() {} var nodes = {}; if (ALL_IRREGULARS.test(sourceCode.getText())) { nodes.Program = function (node) { /* * As we can easily fire warnings for all white space issues with * all the source its simpler to fire them here. * This means we can check all the application code without having * to worry about issues caused in the parser tokens. * When writing this code also evaluating per node was missing out * connecting tokens in some cases. * We can later filter the errors when they are found to be not an * issue in nodes we don't care about. */ checkForIrregularWhitespace(node); checkForIrregularLineTerminators(node); }; nodes.Identifier = removeInvalidNodeErrorsInIdentifierOrLiteral; nodes.Literal = removeInvalidNodeErrorsInIdentifierOrLiteral; nodes.TemplateElement = skipTemplates ? removeInvalidNodeErrorsInTemplateLiteral : noop; nodes["Program:exit"] = function () { if (skipComments) { // First strip errors occurring in comment nodes. commentNodes.forEach(removeInvalidNodeErrorsInComment); } // If we have any errors remaining report on them errors.forEach(function (error) { context.report.apply(context, error); }); }; } else { nodes.Program = noop; } return nodes; } }; },{"../ast-utils":67}],197:[function(require,module,exports){ /** * @fileoverview Rule to flag usage of __iterator__ property * @author Ian Christian Myers */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow the use of the `__iterator__` property", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { return { MemberExpression: function MemberExpression(node) { if (node.property && node.property.type === "Identifier" && node.property.name === "__iterator__" && !node.computed || node.property.type === "Literal" && node.property.value === "__iterator__") { context.report({ node: node, message: "Reserved name '__iterator__'." }); } } }; } }; },{}],198:[function(require,module,exports){ /** * @fileoverview Rule to flag labels that are the same as an identifier * @author Ian Christian Myers */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow labels that share a name with a variable", category: "Variables", recommended: false }, schema: [] }, create: function create(context) { //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Check if the identifier is present inside current scope * @param {Object} scope current scope * @param {string} name To evaluate * @returns {boolean} True if its present * @private */ function findIdentifier(scope, name) { return astUtils.getVariableByName(scope, name) !== null; } //-------------------------------------------------------------------------- // Public API //-------------------------------------------------------------------------- return { LabeledStatement: function LabeledStatement(node) { // Fetch the innermost scope. var scope = context.getScope(); // Recursively find the identifier walking up the scope, starting // with the innermost scope. if (findIdentifier(scope, node.label.name)) { context.report({ node: node, message: "Found identifier with same name as label." }); } } }; } }; },{"../ast-utils":67}],199:[function(require,module,exports){ /** * @fileoverview Disallow Labeled Statements * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow labeled statements", category: "Best Practices", recommended: false }, schema: [{ type: "object", properties: { allowLoop: { type: "boolean" }, allowSwitch: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var options = context.options[0]; var allowLoop = Boolean(options && options.allowLoop); var allowSwitch = Boolean(options && options.allowSwitch); var scopeInfo = null; /** * Gets the kind of a given node. * * @param {ASTNode} node - A node to get. * @returns {string} The kind of the node. */ function getBodyKind(node) { if (astUtils.isLoop(node)) { return "loop"; } if (node.type === "SwitchStatement") { return "switch"; } return "other"; } /** * Checks whether the label of a given kind is allowed or not. * * @param {string} kind - A kind to check. * @returns {boolean} `true` if the kind is allowed. */ function isAllowed(kind) { switch (kind) { case "loop": return allowLoop; case "switch": return allowSwitch; default: return false; } } /** * Checks whether a given name is a label of a loop or not. * * @param {string} label - A name of a label to check. * @returns {boolean} `true` if the name is a label of a loop. */ function getKind(label) { var info = scopeInfo; while (info) { if (info.label === label) { return info.kind; } info = info.upper; } /* istanbul ignore next: syntax error */ return "other"; } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { LabeledStatement: function LabeledStatement(node) { scopeInfo = { label: node.label.name, kind: getBodyKind(node.body), upper: scopeInfo }; }, "LabeledStatement:exit": function LabeledStatementExit(node) { if (!isAllowed(scopeInfo.kind)) { context.report({ node: node, message: "Unexpected labeled statement." }); } scopeInfo = scopeInfo.upper; }, BreakStatement: function BreakStatement(node) { if (node.label && !isAllowed(getKind(node.label.name))) { context.report({ node: node, message: "Unexpected label in break statement." }); } }, ContinueStatement: function ContinueStatement(node) { if (node.label && !isAllowed(getKind(node.label.name))) { context.report({ node: node, message: "Unexpected label in continue statement." }); } } }; } }; },{"../ast-utils":67}],200:[function(require,module,exports){ /** * @fileoverview Rule to flag blocks with no reason to exist * @author Brandon Mills */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow unnecessary nested blocks", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { // A stack of lone blocks to be checked for block-level bindings var loneBlocks = []; var ruleDef = void 0; /** * Reports a node as invalid. * @param {ASTNode} node - The node to be reported. * @returns {void} */ function report(node) { var message = node.parent.type === "BlockStatement" ? "Nested block is redundant." : "Block is redundant."; context.report({ node: node, message: message }); } /** * Checks for any ocurrence of a BlockStatement in a place where lists of statements can appear * @param {ASTNode} node The node to check * @returns {boolean} True if the node is a lone block. */ function isLoneBlock(node) { return node.parent.type === "BlockStatement" || node.parent.type === "Program" || // Don't report blocks in switch cases if the block is the only statement of the case. node.parent.type === "SwitchCase" && !(node.parent.consequent[0] === node && node.parent.consequent.length === 1); } /** * Checks the enclosing block of the current node for block-level bindings, * and "marks it" as valid if any. * @returns {void} */ function markLoneBlock() { if (loneBlocks.length === 0) { return; } var block = context.getAncestors().pop(); if (loneBlocks[loneBlocks.length - 1] === block) { loneBlocks.pop(); } } // Default rule definition: report all lone blocks ruleDef = { BlockStatement: function BlockStatement(node) { if (isLoneBlock(node)) { report(node); } } }; // ES6: report blocks without block-level bindings if (context.parserOptions.ecmaVersion >= 6) { ruleDef = { BlockStatement: function BlockStatement(node) { if (isLoneBlock(node)) { loneBlocks.push(node); } }, "BlockStatement:exit": function BlockStatementExit(node) { if (loneBlocks.length > 0 && loneBlocks[loneBlocks.length - 1] === node) { loneBlocks.pop(); report(node); } } }; ruleDef.VariableDeclaration = function (node) { if (node.kind === "let" || node.kind === "const") { markLoneBlock(); } }; ruleDef.FunctionDeclaration = function () { if (context.getScope().isStrict) { markLoneBlock(); } }; ruleDef.ClassDeclaration = markLoneBlock; } return ruleDef; } }; },{}],201:[function(require,module,exports){ /** * @fileoverview Rule to disallow if as the only statmenet in an else block * @author Brandon Mills */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow `if` statements as the only statement in `else` blocks", category: "Stylistic Issues", recommended: false }, schema: [], fixable: "code" }, create: function create(context) { var sourceCode = context.getSourceCode(); return { IfStatement: function IfStatement(node) { var ancestors = context.getAncestors(), parent = ancestors.pop(), grandparent = ancestors.pop(); if (parent && parent.type === "BlockStatement" && parent.body.length === 1 && grandparent && grandparent.type === "IfStatement" && parent === grandparent.alternate) { context.report({ node: node, message: "Unexpected if as the only statement in an else block.", fix: function fix(fixer) { var openingElseCurly = sourceCode.getFirstToken(parent); var closingElseCurly = sourceCode.getLastToken(parent); var elseKeyword = sourceCode.getTokenBefore(openingElseCurly); var tokenAfterElseBlock = sourceCode.getTokenAfter(closingElseCurly); var lastIfToken = sourceCode.getLastToken(node.consequent); var sourceText = sourceCode.getText(); if (sourceText.slice(openingElseCurly.range[1], node.range[0]).trim() || sourceText.slice(node.range[1], closingElseCurly.range[0]).trim()) { // Don't fix if there are any non-whitespace characters interfering (e.g. comments) return null; } if (node.consequent.type !== "BlockStatement" && lastIfToken.value !== ";" && tokenAfterElseBlock && (node.consequent.loc.end.line === tokenAfterElseBlock.loc.start.line || /^[([/+`-]/.test(tokenAfterElseBlock.value) || lastIfToken.value === "++" || lastIfToken.value === "--")) { /* * If the `if` statement has no block, and is not followed by a semicolon, make sure that fixing * the issue would not change semantics due to ASI. If this would happen, don't do a fix. */ return null; } return fixer.replaceTextRange([openingElseCurly.range[0], closingElseCurly.range[1]], (elseKeyword.range[1] === openingElseCurly.range[0] ? " " : "") + sourceCode.getText(node)); } }); } } }; } }; },{}],202:[function(require,module,exports){ /** * @fileoverview Rule to flag creation of function inside a loop * @author Ilya Volodin */ "use strict"; //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Gets the containing loop node of a specified node. * * We don't need to check nested functions, so this ignores those. * `Scope.through` contains references of nested functions. * * @param {ASTNode} node - An AST node to get. * @returns {ASTNode|null} The containing loop node of the specified node, or * `null`. */ function getContainingLoopNode(node) { var parent = node.parent; while (parent) { switch (parent.type) { case "WhileStatement": case "DoWhileStatement": return parent; case "ForStatement": // `init` is outside of the loop. if (parent.init !== node) { return parent; } break; case "ForInStatement": case "ForOfStatement": // `right` is outside of the loop. if (parent.right !== node) { return parent; } break; case "ArrowFunctionExpression": case "FunctionExpression": case "FunctionDeclaration": // We don't need to check nested functions. return null; default: break; } node = parent; parent = node.parent; } return null; } /** * Gets the containing loop node of a given node. * If the loop was nested, this returns the most outer loop. * * @param {ASTNode} node - A node to get. This is a loop node. * @param {ASTNode|null} excludedNode - A node that the result node should not * include. * @returns {ASTNode} The most outer loop node. */ function getTopLoopNode(node, excludedNode) { var retv = node; var border = excludedNode ? excludedNode.range[1] : 0; while (node && node.range[0] >= border) { retv = node; node = getContainingLoopNode(node); } return retv; } /** * Checks whether a given reference which refers to an upper scope's variable is * safe or not. * * @param {ASTNode} funcNode - A target function node. * @param {ASTNode} loopNode - A containing loop node. * @param {eslint-scope.Reference} reference - A reference to check. * @returns {boolean} `true` if the reference is safe or not. */ function isSafe(funcNode, loopNode, reference) { var variable = reference.resolved; var definition = variable && variable.defs[0]; var declaration = definition && definition.parent; var kind = declaration && declaration.type === "VariableDeclaration" ? declaration.kind : ""; // Variables which are declared by `const` is safe. if (kind === "const") { return true; } // Variables which are declared by `let` in the loop is safe. // It's a different instance from the next loop step's. if (kind === "let" && declaration.range[0] > loopNode.range[0] && declaration.range[1] < loopNode.range[1]) { return true; } // WriteReferences which exist after this border are unsafe because those // can modify the variable. var border = getTopLoopNode(loopNode, kind === "let" ? declaration : null).range[0]; /** * Checks whether a given reference is safe or not. * The reference is every reference of the upper scope's variable we are * looking now. * * It's safeafe if the reference matches one of the following condition. * - is readonly. * - doesn't exist inside a local function and after the border. * * @param {eslint-scope.Reference} upperRef - A reference to check. * @returns {boolean} `true` if the reference is safe. */ function isSafeReference(upperRef) { var id = upperRef.identifier; return !upperRef.isWrite() || variable.scope.variableScope === upperRef.from.variableScope && id.range[0] < border; } return Boolean(variable) && variable.references.every(isSafeReference); } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow `function` declarations and expressions inside loop statements", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { /** * Reports functions which match the following condition: * * - has a loop node in ancestors. * - has any references which refers to an unsafe variable. * * @param {ASTNode} node The AST node to check. * @returns {boolean} Whether or not the node is within a loop. */ function checkForLoops(node) { var loopNode = getContainingLoopNode(node); if (!loopNode) { return; } var references = context.getScope().through; if (references.length > 0 && !references.every(isSafe.bind(null, node, loopNode))) { context.report({ node: node, message: "Don't make functions within a loop." }); } } return { ArrowFunctionExpression: checkForLoops, FunctionExpression: checkForLoops, FunctionDeclaration: checkForLoops }; } }; },{}],203:[function(require,module,exports){ /** * @fileoverview Rule to flag statements that use magic numbers (adapted from https://github.com/danielstjules/buddy.js) * @author Vincent Lemeunier */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow magic numbers", category: "Best Practices", recommended: false }, schema: [{ type: "object", properties: { detectObjects: { type: "boolean" }, enforceConst: { type: "boolean" }, ignore: { type: "array", items: { type: "number" }, uniqueItems: true }, ignoreArrayIndexes: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var config = context.options[0] || {}, detectObjects = !!config.detectObjects, enforceConst = !!config.enforceConst, ignore = config.ignore || [], ignoreArrayIndexes = !!config.ignoreArrayIndexes; /** * Returns whether the node is number literal * @param {Node} node - the node literal being evaluated * @returns {boolean} true if the node is a number literal */ function isNumber(node) { return typeof node.value === "number"; } /** * Returns whether the number should be ignored * @param {number} num - the number * @returns {boolean} true if the number should be ignored */ function shouldIgnoreNumber(num) { return ignore.indexOf(num) !== -1; } /** * Returns whether the number should be ignored when used as a radix within parseInt() or Number.parseInt() * @param {ASTNode} parent - the non-"UnaryExpression" parent * @param {ASTNode} node - the node literal being evaluated * @returns {boolean} true if the number should be ignored */ function shouldIgnoreParseInt(parent, node) { return parent.type === "CallExpression" && node === parent.arguments[1] && (parent.callee.name === "parseInt" || parent.callee.type === "MemberExpression" && parent.callee.object.name === "Number" && parent.callee.property.name === "parseInt"); } /** * Returns whether the number should be ignored when used to define a JSX prop * @param {ASTNode} parent - the non-"UnaryExpression" parent * @returns {boolean} true if the number should be ignored */ function shouldIgnoreJSXNumbers(parent) { return parent.type.indexOf("JSX") === 0; } /** * Returns whether the number should be ignored when used as an array index with enabled 'ignoreArrayIndexes' option. * @param {ASTNode} parent - the non-"UnaryExpression" parent. * @returns {boolean} true if the number should be ignored */ function shouldIgnoreArrayIndexes(parent) { return parent.type === "MemberExpression" && ignoreArrayIndexes; } return { Literal: function Literal(node) { var parent = node.parent, value = node.value, raw = node.raw; var okTypes = detectObjects ? [] : ["ObjectExpression", "Property", "AssignmentExpression"]; if (!isNumber(node)) { return; } // For negative magic numbers: update the value and parent node if (parent.type === "UnaryExpression" && parent.operator === "-") { node = parent; parent = node.parent; value = -value; raw = "-" + raw; } if (shouldIgnoreNumber(value) || shouldIgnoreParseInt(parent, node) || shouldIgnoreArrayIndexes(parent) || shouldIgnoreJSXNumbers(parent)) { return; } if (parent.type === "VariableDeclarator") { if (enforceConst && parent.parent.kind !== "const") { context.report({ node: node, message: "Number constants declarations must use 'const'." }); } } else if (okTypes.indexOf(parent.type) === -1 || parent.type === "AssignmentExpression" && parent.left.type === "Identifier") { context.report({ node: node, message: "No magic number: {{raw}}.", data: { raw: raw } }); } } }; } }; },{}],204:[function(require,module,exports){ /** * @fileoverview Rule to disallow mixed binary operators. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils.js"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var ARITHMETIC_OPERATORS = ["+", "-", "*", "/", "%", "**"]; var BITWISE_OPERATORS = ["&", "|", "^", "~", "<<", ">>", ">>>"]; var COMPARISON_OPERATORS = ["==", "!=", "===", "!==", ">", ">=", "<", "<="]; var LOGICAL_OPERATORS = ["&&", "||"]; var RELATIONAL_OPERATORS = ["in", "instanceof"]; var ALL_OPERATORS = [].concat(ARITHMETIC_OPERATORS, BITWISE_OPERATORS, COMPARISON_OPERATORS, LOGICAL_OPERATORS, RELATIONAL_OPERATORS); var DEFAULT_GROUPS = [ARITHMETIC_OPERATORS, BITWISE_OPERATORS, COMPARISON_OPERATORS, LOGICAL_OPERATORS, RELATIONAL_OPERATORS]; var TARGET_NODE_TYPE = /^(?:Binary|Logical)Expression$/; /** * Normalizes options. * * @param {Object|undefined} options - A options object to normalize. * @returns {Object} Normalized option object. */ function normalizeOptions(options) { var hasGroups = options && options.groups && options.groups.length > 0; var groups = hasGroups ? options.groups : DEFAULT_GROUPS; var allowSamePrecedence = (options && options.allowSamePrecedence) !== false; return { groups: groups, allowSamePrecedence: allowSamePrecedence }; } /** * Checks whether any group which includes both given operator exists or not. * * @param {Array.} groups - A list of groups to check. * @param {string} left - An operator. * @param {string} right - Another operator. * @returns {boolean} `true` if such group existed. */ function includesBothInAGroup(groups, left, right) { return groups.some(function (group) { return group.indexOf(left) !== -1 && group.indexOf(right) !== -1; }); } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow mixed binary operators", category: "Stylistic Issues", recommended: false }, schema: [{ type: "object", properties: { groups: { type: "array", items: { type: "array", items: { enum: ALL_OPERATORS }, minItems: 2, uniqueItems: true }, uniqueItems: true }, allowSamePrecedence: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var sourceCode = context.getSourceCode(); var options = normalizeOptions(context.options[0]); /** * Checks whether a given node should be ignored by options or not. * * @param {ASTNode} node - A node to check. This is a BinaryExpression * node or a LogicalExpression node. This parent node is one of * them, too. * @returns {boolean} `true` if the node should be ignored. */ function shouldIgnore(node) { var a = node; var b = node.parent; return !includesBothInAGroup(options.groups, a.operator, b.operator) || options.allowSamePrecedence && astUtils.getPrecedence(a) === astUtils.getPrecedence(b); } /** * Checks whether the operator of a given node is mixed with parent * node's operator or not. * * @param {ASTNode} node - A node to check. This is a BinaryExpression * node or a LogicalExpression node. This parent node is one of * them, too. * @returns {boolean} `true` if the node was mixed. */ function isMixedWithParent(node) { return node.operator !== node.parent.operator && !astUtils.isParenthesised(sourceCode, node); } /** * Gets the operator token of a given node. * * @param {ASTNode} node - A node to check. This is a BinaryExpression * node or a LogicalExpression node. * @returns {Token} The operator token of the node. */ function getOperatorToken(node) { return sourceCode.getTokenAfter(node.left, astUtils.isNotClosingParenToken); } /** * Reports both the operator of a given node and the operator of the * parent node. * * @param {ASTNode} node - A node to check. This is a BinaryExpression * node or a LogicalExpression node. This parent node is one of * them, too. * @returns {void} */ function reportBothOperators(node) { var parent = node.parent; var left = parent.left === node ? node : parent; var right = parent.left !== node ? node : parent; var message = "Unexpected mix of '{{leftOperator}}' and '{{rightOperator}}'."; var data = { leftOperator: left.operator, rightOperator: right.operator }; context.report({ node: left, loc: getOperatorToken(left).loc.start, message: message, data: data }); context.report({ node: right, loc: getOperatorToken(right).loc.start, message: message, data: data }); } /** * Checks between the operator of this node and the operator of the * parent node. * * @param {ASTNode} node - A node to check. * @returns {void} */ function check(node) { if (TARGET_NODE_TYPE.test(node.parent.type) && isMixedWithParent(node) && !shouldIgnore(node)) { reportBothOperators(node); } } return { BinaryExpression: check, LogicalExpression: check }; } }; },{"../ast-utils.js":67}],205:[function(require,module,exports){ /** * @fileoverview Rule to enforce grouped require statements for Node.JS * @author Raphael Pigulla */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; module.exports = { meta: { docs: { description: "disallow `require` calls to be mixed with regular variable declarations", category: "Node.js and CommonJS", recommended: false }, schema: [{ oneOf: [{ type: "boolean" }, { type: "object", properties: { grouping: { type: "boolean" }, allowCall: { type: "boolean" } }, additionalProperties: false }] }] }, create: function create(context) { var options = context.options[0]; var grouping = false, allowCall = false; if ((typeof options === "undefined" ? "undefined" : _typeof(options)) === "object") { grouping = options.grouping; allowCall = options.allowCall; } else { grouping = !!options; } /** * Returns the list of built-in modules. * * @returns {string[]} An array of built-in Node.js modules. */ function getBuiltinModules() { /* * This list is generated using: * `require("repl")._builtinLibs.concat('repl').sort()` * This particular list is as per nodejs v0.12.2 and iojs v0.7.1 */ return ["assert", "buffer", "child_process", "cluster", "crypto", "dgram", "dns", "domain", "events", "fs", "http", "https", "net", "os", "path", "punycode", "querystring", "readline", "repl", "smalloc", "stream", "string_decoder", "tls", "tty", "url", "util", "v8", "vm", "zlib"]; } var BUILTIN_MODULES = getBuiltinModules(); var DECL_REQUIRE = "require", DECL_UNINITIALIZED = "uninitialized", DECL_OTHER = "other"; var REQ_CORE = "core", REQ_FILE = "file", REQ_MODULE = "module", REQ_COMPUTED = "computed"; /** * Determines the type of a declaration statement. * @param {ASTNode} initExpression The init node of the VariableDeclarator. * @returns {string} The type of declaration represented by the expression. */ function getDeclarationType(initExpression) { if (!initExpression) { // "var x;" return DECL_UNINITIALIZED; } if (initExpression.type === "CallExpression" && initExpression.callee.type === "Identifier" && initExpression.callee.name === "require") { // "var x = require('util');" return DECL_REQUIRE; } else if (allowCall && initExpression.type === "CallExpression" && initExpression.callee.type === "CallExpression") { // "var x = require('diagnose')('sub-module');" return getDeclarationType(initExpression.callee); } else if (initExpression.type === "MemberExpression") { // "var x = require('glob').Glob;" return getDeclarationType(initExpression.object); } // "var x = 42;" return DECL_OTHER; } /** * Determines the type of module that is loaded via require. * @param {ASTNode} initExpression The init node of the VariableDeclarator. * @returns {string} The module type. */ function inferModuleType(initExpression) { if (initExpression.type === "MemberExpression") { // "var x = require('glob').Glob;" return inferModuleType(initExpression.object); } else if (initExpression.arguments.length === 0) { // "var x = require();" return REQ_COMPUTED; } var arg = initExpression.arguments[0]; if (arg.type !== "Literal" || typeof arg.value !== "string") { // "var x = require(42);" return REQ_COMPUTED; } if (BUILTIN_MODULES.indexOf(arg.value) !== -1) { // "var fs = require('fs');" return REQ_CORE; } else if (/^\.{0,2}\//.test(arg.value)) { // "var utils = require('./utils');" return REQ_FILE; } // "var async = require('async');" return REQ_MODULE; } /** * Check if the list of variable declarations is mixed, i.e. whether it * contains both require and other declarations. * @param {ASTNode} declarations The list of VariableDeclarators. * @returns {boolean} True if the declarations are mixed, false if not. */ function isMixed(declarations) { var contains = {}; declarations.forEach(function (declaration) { var type = getDeclarationType(declaration.init); contains[type] = true; }); return !!(contains[DECL_REQUIRE] && (contains[DECL_UNINITIALIZED] || contains[DECL_OTHER])); } /** * Check if all require declarations in the given list are of the same * type. * @param {ASTNode} declarations The list of VariableDeclarators. * @returns {boolean} True if the declarations are grouped, false if not. */ function isGrouped(declarations) { var found = {}; declarations.forEach(function (declaration) { if (getDeclarationType(declaration.init) === DECL_REQUIRE) { found[inferModuleType(declaration.init)] = true; } }); return Object.keys(found).length <= 1; } return { VariableDeclaration: function VariableDeclaration(node) { if (isMixed(node.declarations)) { context.report({ node: node, message: "Do not mix 'require' and other declarations." }); } else if (grouping && !isGrouped(node.declarations)) { context.report({ node: node, message: "Do not mix core, module, file and computed requires." }); } } }; } }; },{}],206:[function(require,module,exports){ /** * @fileoverview Disallow mixed spaces and tabs for indentation * @author Jary Niebur */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow mixed spaces and tabs for indentation", category: "Stylistic Issues", recommended: true }, schema: [{ enum: ["smart-tabs", true, false] }] }, create: function create(context) { var sourceCode = context.getSourceCode(); var smartTabs = void 0; var ignoredLocs = []; switch (context.options[0]) { case true: // Support old syntax, maybe add deprecation warning here case "smart-tabs": smartTabs = true; break; default: smartTabs = false; } /** * Determines if a given line and column are before a location. * @param {Location} loc The location object from an AST node. * @param {int} line The line to check. * @param {int} column The column to check. * @returns {boolean} True if the line and column are before the location, false if not. * @private */ function beforeLoc(loc, line, column) { if (line < loc.start.line) { return true; } return line === loc.start.line && column < loc.start.column; } /** * Determines if a given line and column are after a location. * @param {Location} loc The location object from an AST node. * @param {int} line The line to check. * @param {int} column The column to check. * @returns {boolean} True if the line and column are after the location, false if not. * @private */ function afterLoc(loc, line, column) { if (line > loc.end.line) { return true; } return line === loc.end.line && column > loc.end.column; } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { TemplateElement: function TemplateElement(node) { ignoredLocs.push(node.loc); }, "Program:exit": function ProgramExit(node) { /* * At least one space followed by a tab * or the reverse before non-tab/-space * characters begin. */ var regex = /^(?=[\t ]*(\t | \t))/; var lines = sourceCode.lines, comments = sourceCode.getAllComments(); comments.forEach(function (comment) { ignoredLocs.push(comment.loc); }); ignoredLocs.sort(function (first, second) { if (beforeLoc(first, second.start.line, second.start.column)) { return 1; } if (beforeLoc(second, first.start.line, second.start.column)) { return -1; } return 0; }); if (smartTabs) { /* * At least one space followed by a tab * before non-tab/-space characters begin. */ regex = /^(?=[\t ]* \t)/; } lines.forEach(function (line, i) { var match = regex.exec(line); if (match) { var lineNumber = i + 1, column = match.index + 1; for (var j = 0; j < ignoredLocs.length; j++) { if (beforeLoc(ignoredLocs[j], lineNumber, column)) { continue; } if (afterLoc(ignoredLocs[j], lineNumber, column)) { continue; } return; } context.report({ node: node, loc: { line: lineNumber, column: column }, message: "Mixed spaces and tabs." }); } }); } }; } }; },{}],207:[function(require,module,exports){ /** * @fileoverview Rule to check use of chained assignment expressions * @author Stewart Rand */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow use of chained assignment expressions", category: "Stylistic Issues", recommended: false }, schema: [] }, create: function create(context) { //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { AssignmentExpression: function AssignmentExpression(node) { if (["AssignmentExpression", "VariableDeclarator"].indexOf(node.parent.type) !== -1) { context.report({ node: node, message: "Unexpected chained assignment." }); } } }; } }; },{}],208:[function(require,module,exports){ /** * @fileoverview Disallow use of multiple spaces. * @author Nicholas C. Zakas */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow multiple spaces", category: "Best Practices", recommended: false }, fixable: "whitespace", schema: [{ type: "object", properties: { exceptions: { type: "object", patternProperties: { "^([A-Z][a-z]*)+$": { type: "boolean" } }, additionalProperties: false }, ignoreEOLComments: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { // the index of the last comment that was checked var sourceCode = context.getSourceCode(), exceptions = { Property: true }, options = context.options[0] || {}, ignoreEOLComments = options.ignoreEOLComments; var hasExceptions = true, lastCommentIndex = 0; if (options && options.exceptions) { Object.keys(options.exceptions).forEach(function (key) { if (options.exceptions[key]) { exceptions[key] = true; } else { delete exceptions[key]; } }); hasExceptions = Object.keys(exceptions).length > 0; } /** * Checks if a given token is the last token of the line or not. * @param {Token} token The token to check. * @returns {boolean} Whether or not a token is at the end of the line it occurs in. * @private */ function isLastTokenOfLine(token) { var nextToken = sourceCode.getTokenAfter(token, { includeComments: true }); // nextToken is null if the comment is the last token in the program. if (!nextToken) { return true; } return !astUtils.isTokenOnSameLine(token, nextToken); } /** * Determines if a given source index is in a comment or not by checking * the index against the comment range. Since the check goes straight * through the file, once an index is passed a certain comment, we can * go to the next comment to check that. * @param {int} index The source index to check. * @param {ASTNode[]} comments An array of comment nodes. * @returns {boolean} True if the index is within a comment, false if not. * @private */ function isIndexInComment(index, comments) { while (lastCommentIndex < comments.length) { var comment = comments[lastCommentIndex]; if (comment.range[0] < index && index < comment.range[1]) { return true; } else if (index > comment.range[1]) { lastCommentIndex++; } else { break; } } return false; } /** * Formats value of given comment token for error message by truncating its length. * @param {Token} token comment token * @returns {string} formatted value * @private */ function formatReportedCommentValue(token) { var valueLines = token.value.split("\n"); var value = valueLines[0]; var formattedValue = value.substring(0, 12) + "..."; return valueLines.length === 1 && value.length <= 12 ? value : formattedValue; } /** * Creates a fix function that removes the multiple spaces between the two tokens * @param {Token} leftToken left token * @param {Token} rightToken right token * @returns {Function} fix function * @private */ function createFix(leftToken, rightToken) { return function (fixer) { return fixer.replaceTextRange([leftToken.range[1], rightToken.range[0]], " "); }; } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { Program: function Program() { var source = sourceCode.getText(), allComments = sourceCode.getAllComments(), pattern = /[^\s].*? {2,}/g; var parent = void 0; while (pattern.test(source)) { // do not flag anything inside of comments if (!isIndexInComment(pattern.lastIndex, allComments)) { var token = sourceCode.getTokenByRangeStart(pattern.lastIndex, { includeComments: true }); if (token) { if (ignoreEOLComments && astUtils.isCommentToken(token) && isLastTokenOfLine(token)) { return; } var previousToken = sourceCode.getTokenBefore(token, { includeComments: true }); if (hasExceptions) { parent = sourceCode.getNodeByRangeIndex(pattern.lastIndex - 1); } if (!parent || !exceptions[parent.type]) { var value = token.value; if (token.type === "Block") { value = "/*" + formatReportedCommentValue(token) + "*/"; } else if (token.type === "Line") { value = "//" + formatReportedCommentValue(token); } context.report({ node: token, loc: token.loc.start, message: "Multiple spaces found before '{{value}}'.", data: { value: value }, fix: createFix(previousToken, token) }); } } } } } }; } }; },{"../ast-utils":67}],209:[function(require,module,exports){ /** * @fileoverview Rule to flag when using multiline strings * @author Ilya Volodin */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow multiline strings", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { /** * Determines if a given node is part of JSX syntax. * @param {ASTNode} node The node to check. * @returns {boolean} True if the node is a JSX node, false if not. * @private */ function isJSXElement(node) { return node.type.indexOf("JSX") === 0; } //-------------------------------------------------------------------------- // Public API //-------------------------------------------------------------------------- return { Literal: function Literal(node) { if (astUtils.LINEBREAK_MATCHER.test(node.raw) && !isJSXElement(node.parent)) { context.report({ node: node, message: "Multiline support is limited to browsers supporting ES5 only." }); } } }; } }; },{"../ast-utils":67}],210:[function(require,module,exports){ /** * @fileoverview Disallows multiple blank lines. * implementation adapted from the no-trailing-spaces rule. * @author Greg Cochard */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow multiple empty lines", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ type: "object", properties: { max: { type: "integer", minimum: 0 }, maxEOF: { type: "integer", minimum: 0 }, maxBOF: { type: "integer", minimum: 0 } }, required: ["max"], additionalProperties: false }] }, create: function create(context) { // Use options.max or 2 as default var max = 2, maxEOF = max, maxBOF = max; if (context.options.length) { max = context.options[0].max; maxEOF = typeof context.options[0].maxEOF !== "undefined" ? context.options[0].maxEOF : max; maxBOF = typeof context.options[0].maxBOF !== "undefined" ? context.options[0].maxBOF : max; } var sourceCode = context.getSourceCode(); // Swallow the final newline, as some editors add it automatically and we don't want it to cause an issue var allLines = sourceCode.lines[sourceCode.lines.length - 1] === "" ? sourceCode.lines.slice(0, -1) : sourceCode.lines; var templateLiteralLines = new Set(); //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { TemplateLiteral: function TemplateLiteral(node) { node.quasis.forEach(function (literalPart) { // Empty lines have a semantic meaning if they're inside template literals. Don't count these as empty lines. for (var ignoredLine = literalPart.loc.start.line; ignoredLine < literalPart.loc.end.line; ignoredLine++) { templateLiteralLines.add(ignoredLine); } }); }, "Program:exit": function ProgramExit(node) { return allLines // Given a list of lines, first get a list of line numbers that are non-empty. .reduce(function (nonEmptyLineNumbers, line, index) { if (line.trim() || templateLiteralLines.has(index + 1)) { nonEmptyLineNumbers.push(index + 1); } return nonEmptyLineNumbers; }, [] // Add a value at the end to allow trailing empty lines to be checked. ).concat(allLines.length + 1 // Given two line numbers of non-empty lines, report the lines between if the difference is too large. ).reduce(function (lastLineNumber, lineNumber) { var message = void 0, maxAllowed = void 0; if (lastLineNumber === 0) { message = "Too many blank lines at the beginning of file. Max of {{max}} allowed."; maxAllowed = maxBOF; } else if (lineNumber === allLines.length + 1) { message = "Too many blank lines at the end of file. Max of {{max}} allowed."; maxAllowed = maxEOF; } else { message = "More than {{max}} blank {{pluralizedLines}} not allowed."; maxAllowed = max; } if (lineNumber - lastLineNumber - 1 > maxAllowed) { context.report({ node: node, loc: { start: { line: lastLineNumber + 1, column: 0 }, end: { line: lineNumber, column: 0 } }, message: message, data: { max: maxAllowed, pluralizedLines: maxAllowed === 1 ? "line" : "lines" }, fix: function fix(fixer) { var rangeStart = sourceCode.getIndexFromLoc({ line: lastLineNumber + 1, column: 0 }); /* * The end of the removal range is usually the start index of the next line. * However, at the end of the file there is no next line, so the end of the * range is just the length of the text. */ var lineNumberAfterRemovedLines = lineNumber - maxAllowed; var rangeEnd = lineNumberAfterRemovedLines <= allLines.length ? sourceCode.getIndexFromLoc({ line: lineNumberAfterRemovedLines, column: 0 }) : sourceCode.text.length; return fixer.removeRange([rangeStart, rangeEnd]); } }); } return lineNumber; }, 0); } }; } }; },{}],211:[function(require,module,exports){ /** * @fileoverview Rule to disallow assignments to native objects or read-only global variables * @author Ilya Volodin * @deprecated in ESLint v3.3.0 */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow assignments to native objects or read-only global variables", category: "Best Practices", recommended: false, replacedBy: ["no-global-assign"] }, deprecated: true, schema: [{ type: "object", properties: { exceptions: { type: "array", items: { type: "string" }, uniqueItems: true } }, additionalProperties: false }] }, create: function create(context) { var config = context.options[0]; var exceptions = config && config.exceptions || []; /** * Reports write references. * @param {Reference} reference - A reference to check. * @param {int} index - The index of the reference in the references. * @param {Reference[]} references - The array that the reference belongs to. * @returns {void} */ function checkReference(reference, index, references) { var identifier = reference.identifier; if (reference.init === false && reference.isWrite() && ( // Destructuring assignments can have multiple default value, // so possibly there are multiple writeable references for the same identifier. index === 0 || references[index - 1].identifier !== identifier)) { context.report({ node: identifier, message: "Read-only global '{{name}}' should not be modified.", data: identifier }); } } /** * Reports write references if a given variable is read-only builtin. * @param {Variable} variable - A variable to check. * @returns {void} */ function checkVariable(variable) { if (variable.writeable === false && exceptions.indexOf(variable.name) === -1) { variable.references.forEach(checkReference); } } return { Program: function Program() { var globalScope = context.getScope(); globalScope.variables.forEach(checkVariable); } }; } }; },{}],212:[function(require,module,exports){ /** * @fileoverview Rule to disallow a negated condition * @author Alberto Rodríguez */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow negated conditions", category: "Stylistic Issues", recommended: false }, schema: [] }, create: function create(context) { /** * Determines if a given node is an if-else without a condition on the else * @param {ASTNode} node The node to check. * @returns {boolean} True if the node has an else without an if. * @private */ function hasElseWithoutCondition(node) { return node.alternate && node.alternate.type !== "IfStatement"; } /** * Determines if a given node is a negated unary expression * @param {Object} test The test object to check. * @returns {boolean} True if the node is a negated unary expression. * @private */ function isNegatedUnaryExpression(test) { return test.type === "UnaryExpression" && test.operator === "!"; } /** * Determines if a given node is a negated binary expression * @param {Test} test The test to check. * @returns {boolean} True if the node is a negated binary expression. * @private */ function isNegatedBinaryExpression(test) { return test.type === "BinaryExpression" && (test.operator === "!=" || test.operator === "!=="); } /** * Determines if a given node has a negated if expression * @param {ASTNode} node The node to check. * @returns {boolean} True if the node has a negated if expression. * @private */ function isNegatedIf(node) { return isNegatedUnaryExpression(node.test) || isNegatedBinaryExpression(node.test); } return { IfStatement: function IfStatement(node) { if (!hasElseWithoutCondition(node)) { return; } if (isNegatedIf(node)) { context.report({ node: node, message: "Unexpected negated condition." }); } }, ConditionalExpression: function ConditionalExpression(node) { if (isNegatedIf(node)) { context.report({ node: node, message: "Unexpected negated condition." }); } } }; } }; },{}],213:[function(require,module,exports){ /** * @fileoverview A rule to disallow negated left operands of the `in` operator * @author Michael Ficarra * @deprecated in ESLint v3.3.0 */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow negating the left operand in `in` expressions", category: "Possible Errors", recommended: false, replacedBy: ["no-unsafe-negation"] }, deprecated: true, schema: [] }, create: function create(context) { return { BinaryExpression: function BinaryExpression(node) { if (node.operator === "in" && node.left.type === "UnaryExpression" && node.left.operator === "!") { context.report({ node: node, message: "The 'in' expression's left operand is negated." }); } } }; } }; },{}],214:[function(require,module,exports){ /** * @fileoverview Rule to flag nested ternary expressions * @author Ian Christian Myers */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow nested ternary expressions", category: "Stylistic Issues", recommended: false }, schema: [] }, create: function create(context) { return { ConditionalExpression: function ConditionalExpression(node) { if (node.alternate.type === "ConditionalExpression" || node.consequent.type === "ConditionalExpression") { context.report({ node: node, message: "Do not nest ternary expressions." }); } } }; } }; },{}],215:[function(require,module,exports){ /** * @fileoverview Rule to flag when using new Function * @author Ilya Volodin */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow `new` operators with the `Function` object", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Reports a node. * @param {ASTNode} node The node to report * @returns {void} * @private */ function report(node) { context.report({ node: node, message: "The Function constructor is eval." }); } return { "NewExpression[callee.name = 'Function']": report, "CallExpression[callee.name = 'Function']": report }; } }; },{}],216:[function(require,module,exports){ /** * @fileoverview A rule to disallow calls to the Object constructor * @author Matt DuVall */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow `Object` constructors", category: "Stylistic Issues", recommended: false }, schema: [] }, create: function create(context) { return { NewExpression: function NewExpression(node) { if (node.callee.name === "Object") { context.report({ node: node, message: "The object literal notation {} is preferrable." }); } } }; } }; },{}],217:[function(require,module,exports){ /** * @fileoverview Rule to disallow use of new operator with the `require` function * @author Wil Moore III */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow `new` operators with calls to `require`", category: "Node.js and CommonJS", recommended: false }, schema: [] }, create: function create(context) { return { NewExpression: function NewExpression(node) { if (node.callee.type === "Identifier" && node.callee.name === "require") { context.report({ node: node, message: "Unexpected use of new with require." }); } } }; } }; },{}],218:[function(require,module,exports){ /** * @fileoverview Rule to disallow use of the new operator with the `Symbol` object * @author Alberto Rodríguez */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow `new` operators with the `Symbol` object", category: "ECMAScript 6", recommended: true }, schema: [] }, create: function create(context) { return { "Program:exit": function ProgramExit() { var globalScope = context.getScope(); var variable = globalScope.set.get("Symbol"); if (variable && variable.defs.length === 0) { variable.references.forEach(function (ref) { var node = ref.identifier; if (node.parent && node.parent.type === "NewExpression") { context.report({ node: node, message: "`Symbol` cannot be called as a constructor." }); } }); } } }; } }; },{}],219:[function(require,module,exports){ /** * @fileoverview Rule to flag when using constructor for wrapper objects * @author Ilya Volodin */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow `new` operators with the `String`, `Number`, and `Boolean` objects", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { return { NewExpression: function NewExpression(node) { var wrapperObjects = ["String", "Number", "Boolean", "Math", "JSON"]; if (wrapperObjects.indexOf(node.callee.name) > -1) { context.report({ node: node, message: "Do not use {{fn}} as a constructor.", data: { fn: node.callee.name } }); } } }; } }; },{}],220:[function(require,module,exports){ /** * @fileoverview Rule to flag statements with function invocation preceded by * "new" and not part of assignment * @author Ilya Volodin */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow `new` operators outside of assignments or comparisons", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { return { "ExpressionStatement > NewExpression": function ExpressionStatementNewExpression(node) { context.report({ node: node.parent, message: "Do not use 'new' for side effects." }); } }; } }; },{}],221:[function(require,module,exports){ /** * @fileoverview Rule to flag use of an object property of the global object (Math and JSON) as a function * @author James Allardice */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow calling global object properties as functions", category: "Possible Errors", recommended: true }, schema: [] }, create: function create(context) { return { CallExpression: function CallExpression(node) { if (node.callee.type === "Identifier") { var name = node.callee.name; if (name === "Math" || name === "JSON" || name === "Reflect") { context.report({ node: node, message: "'{{name}}' is not a function.", data: { name: name } }); } } } }; } }; },{}],222:[function(require,module,exports){ /** * @fileoverview Rule to flag octal escape sequences in string literals. * @author Ian Christian Myers */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow octal escape sequences in string literals", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { return { Literal: function Literal(node) { if (typeof node.value !== "string") { return; } var match = node.raw.match(/^([^\\]|\\[^0-7])*\\([0-3][0-7]{1,2}|[4-7][0-7]|[0-7])/); if (match) { var octalDigit = match[2]; // \0 is actually not considered an octal if (match[2] !== "0" || typeof match[3] !== "undefined") { context.report({ node: node, message: "Don't use octal: '\\{{octalDigit}}'. Use '\\u....' instead.", data: { octalDigit: octalDigit } }); } } } }; } }; },{}],223:[function(require,module,exports){ /** * @fileoverview Rule to flag when initializing octal literal * @author Ilya Volodin */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow octal literals", category: "Best Practices", recommended: true }, schema: [] }, create: function create(context) { return { Literal: function Literal(node) { if (typeof node.value === "number" && /^0[0-7]/.test(node.raw)) { context.report({ node: node, message: "Octal literals should not be used." }); } } }; } }; },{}],224:[function(require,module,exports){ /** * @fileoverview Disallow reassignment of function parameters. * @author Nat Burns */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ var stopNodePattern = /(?:Statement|Declaration|Function(?:Expression)?|Program)$/; module.exports = { meta: { docs: { description: "disallow reassigning `function` parameters", category: "Best Practices", recommended: false }, schema: [{ oneOf: [{ type: "object", properties: { props: { enum: [false] } }, additionalProperties: false }, { type: "object", properties: { props: { enum: [true] }, ignorePropertyModificationsFor: { type: "array", items: { type: "string" }, uniqueItems: true } }, additionalProperties: false }] }] }, create: function create(context) { var props = context.options[0] && Boolean(context.options[0].props); var ignoredPropertyAssignmentsFor = context.options[0] && context.options[0].ignorePropertyModificationsFor || []; /** * Checks whether or not the reference modifies properties of its variable. * @param {Reference} reference - A reference to check. * @returns {boolean} Whether or not the reference modifies properties of its variable. */ function isModifyingProp(reference) { var node = reference.identifier; var parent = node.parent; while (parent && !stopNodePattern.test(parent.type)) { switch (parent.type) { // e.g. foo.a = 0; case "AssignmentExpression": return parent.left === node; // e.g. ++foo.a; case "UpdateExpression": return true; // e.g. delete foo.a; case "UnaryExpression": if (parent.operator === "delete") { return true; } break; // EXCLUDES: e.g. cache.get(foo.a).b = 0; case "CallExpression": if (parent.callee !== node) { return false; } break; // EXCLUDES: e.g. cache[foo.a] = 0; case "MemberExpression": if (parent.property === node) { return false; } break; // EXCLUDES: e.g. ({ [foo]: a }) = bar; case "Property": if (parent.key === node) { return false; } break; // no default } node = parent; parent = node.parent; } return false; } /** * Reports a reference if is non initializer and writable. * @param {Reference} reference - A reference to check. * @param {int} index - The index of the reference in the references. * @param {Reference[]} references - The array that the reference belongs to. * @returns {void} */ function checkReference(reference, index, references) { var identifier = reference.identifier; if (identifier && !reference.init && ( // Destructuring assignments can have multiple default value, // so possibly there are multiple writeable references for the same identifier. index === 0 || references[index - 1].identifier !== identifier)) { if (reference.isWrite()) { context.report({ node: identifier, message: "Assignment to function parameter '{{name}}'.", data: { name: identifier.name } }); } else if (props && isModifyingProp(reference) && ignoredPropertyAssignmentsFor.indexOf(identifier.name) === -1) { context.report({ node: identifier, message: "Assignment to property of function parameter '{{name}}'.", data: { name: identifier.name } }); } } } /** * Finds and reports references that are non initializer and writable. * @param {Variable} variable - A variable to check. * @returns {void} */ function checkVariable(variable) { if (variable.defs[0].type === "Parameter") { variable.references.forEach(checkReference); } } /** * Checks parameters of a given function node. * @param {ASTNode} node - A function node to check. * @returns {void} */ function checkForFunction(node) { context.getDeclaredVariables(node).forEach(checkVariable); } return { // `:exit` is needed for the `node.parent` property of identifier nodes. "FunctionDeclaration:exit": checkForFunction, "FunctionExpression:exit": checkForFunction, "ArrowFunctionExpression:exit": checkForFunction }; } }; },{}],225:[function(require,module,exports){ /** * @fileoverview Disallow string concatenation when using __dirname and __filename * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow string concatenation with `__dirname` and `__filename`", category: "Node.js and CommonJS", recommended: false }, schema: [] }, create: function create(context) { var MATCHER = /^__(?:dir|file)name$/; //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { BinaryExpression: function BinaryExpression(node) { var left = node.left, right = node.right; if (node.operator === "+" && (left.type === "Identifier" && MATCHER.test(left.name) || right.type === "Identifier" && MATCHER.test(right.name))) { context.report({ node: node, message: "Use path.join() or path.resolve() instead of + to create paths." }); } } }; } }; },{}],226:[function(require,module,exports){ /** * @fileoverview Rule to flag use of unary increment and decrement operators. * @author Ian Christian Myers * @author Brody McKee (github.com/mrmckeb) */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; module.exports = { meta: { docs: { description: "disallow the unary operators `++` and `--`", category: "Stylistic Issues", recommended: false }, schema: [{ type: "object", properties: { allowForLoopAfterthoughts: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var config = context.options[0]; var allowInForAfterthought = false; if ((typeof config === "undefined" ? "undefined" : _typeof(config)) === "object") { allowInForAfterthought = config.allowForLoopAfterthoughts === true; } return { UpdateExpression: function UpdateExpression(node) { if (allowInForAfterthought && node.parent.type === "ForStatement") { return; } context.report({ node: node, message: "Unary operator '{{operator}}' used.", data: { operator: node.operator } }); } }; } }; },{}],227:[function(require,module,exports){ /** * @fileoverview Disallow the use of process.env() * @author Vignesh Anand */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow the use of `process.env`", category: "Node.js and CommonJS", recommended: false }, schema: [] }, create: function create(context) { return { MemberExpression: function MemberExpression(node) { var objectName = node.object.name, propertyName = node.property.name; if (objectName === "process" && !node.computed && propertyName && propertyName === "env") { context.report({ node: node, message: "Unexpected use of process.env." }); } } }; } }; },{}],228:[function(require,module,exports){ /** * @fileoverview Disallow the use of process.exit() * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow the use of `process.exit()`", category: "Node.js and CommonJS", recommended: false }, schema: [] }, create: function create(context) { //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { "CallExpression > MemberExpression.callee[object.name = 'process'][property.name = 'exit']": function CallExpressionMemberExpressionCalleeObjectNameProcessPropertyNameExit(node) { context.report({ node: node.parent, message: "Don't use process.exit(); throw an error instead." }); } }; } }; },{}],229:[function(require,module,exports){ /** * @fileoverview Rule to flag usage of __proto__ property * @author Ilya Volodin */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow the use of the `__proto__` property", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { return { MemberExpression: function MemberExpression(node) { if (node.property && node.property.type === "Identifier" && node.property.name === "__proto__" && !node.computed || node.property.type === "Literal" && node.property.value === "__proto__") { context.report({ node: node, message: "The '__proto__' property is deprecated." }); } } }; } }; },{}],230:[function(require,module,exports){ /** * @fileoverview Rule to disallow use of Object.prototype builtins on objects * @author Andrew Levine */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow calling some `Object.prototype` methods directly on objects", category: "Possible Errors", recommended: false }, schema: [] }, create: function create(context) { var DISALLOWED_PROPS = ["hasOwnProperty", "isPrototypeOf", "propertyIsEnumerable"]; /** * Reports if a disallowed property is used in a CallExpression * @param {ASTNode} node The CallExpression node. * @returns {void} */ function disallowBuiltIns(node) { if (node.callee.type !== "MemberExpression" || node.callee.computed) { return; } var propName = node.callee.property.name; if (DISALLOWED_PROPS.indexOf(propName) > -1) { context.report({ message: "Do not access Object.prototype method '{{prop}}' from target object.", loc: node.callee.property.loc.start, data: { prop: propName }, node: node }); } } return { CallExpression: disallowBuiltIns }; } }; },{}],231:[function(require,module,exports){ /** * @fileoverview Rule to flag when the same variable is declared more then once. * @author Ilya Volodin */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow variable redeclaration", category: "Best Practices", recommended: true }, schema: [{ type: "object", properties: { builtinGlobals: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var options = { builtinGlobals: Boolean(context.options[0] && context.options[0].builtinGlobals) }; /** * Find variables in a given scope and flag redeclared ones. * @param {Scope} scope - An eslint-scope scope object. * @returns {void} * @private */ function findVariablesInScope(scope) { scope.variables.forEach(function (variable) { var hasBuiltin = options.builtinGlobals && "writeable" in variable; var count = (hasBuiltin ? 1 : 0) + variable.identifiers.length; if (count >= 2) { variable.identifiers.sort(function (a, b) { return a.range[1] - b.range[1]; }); for (var i = hasBuiltin ? 0 : 1, l = variable.identifiers.length; i < l; i++) { context.report({ node: variable.identifiers[i], message: "'{{a}}' is already defined.", data: { a: variable.name } }); } } }); } /** * Find variables in the current scope. * @param {ASTNode} node - The Program node. * @returns {void} * @private */ function checkForGlobal(node) { var scope = context.getScope(), parserOptions = context.parserOptions, ecmaFeatures = parserOptions.ecmaFeatures || {}; // Nodejs env or modules has a special scope. if (ecmaFeatures.globalReturn || node.sourceType === "module") { findVariablesInScope(scope.childScopes[0]); } else { findVariablesInScope(scope); } } /** * Find variables in the current scope. * @returns {void} * @private */ function checkForBlock() { findVariablesInScope(context.getScope()); } if (context.parserOptions.ecmaVersion >= 6) { return { Program: checkForGlobal, BlockStatement: checkForBlock, SwitchStatement: checkForBlock }; } return { Program: checkForGlobal, FunctionDeclaration: checkForBlock, FunctionExpression: checkForBlock, ArrowFunctionExpression: checkForBlock }; } }; },{}],232:[function(require,module,exports){ /** * @fileoverview Rule to count multiple spaces in regular expressions * @author Matt DuVall */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow multiple spaces in regular expressions", category: "Possible Errors", recommended: true }, schema: [], fixable: "code" }, create: function create(context) { var sourceCode = context.getSourceCode(); /** * Validate regular expressions * @param {ASTNode} node node to validate * @param {string} value regular expression to validate * @param {number} valueStart The start location of the regex/string literal. It will always be the case that `sourceCode.getText().slice(valueStart, valueStart + value.length) === value` * @returns {void} * @private */ function checkRegex(node, value, valueStart) { var multipleSpacesRegex = /( {2,})+?/, regexResults = multipleSpacesRegex.exec(value); if (regexResults !== null) { var count = regexResults[0].length; context.report({ node: node, message: "Spaces are hard to count. Use {{{count}}}.", data: { count: count }, fix: function fix(fixer) { return fixer.replaceTextRange([valueStart + regexResults.index, valueStart + regexResults.index + count], " {" + count + "}"); } }); /* * TODO: (platinumazure) Fix message to use rule message * substitution when api.report is fixed in lib/eslint.js. */ } } /** * Validate regular expression literals * @param {ASTNode} node node to validate * @returns {void} * @private */ function checkLiteral(node) { var token = sourceCode.getFirstToken(node), nodeType = token.type, nodeValue = token.value; if (nodeType === "RegularExpression") { checkRegex(node, nodeValue, token.start); } } /** * Check if node is a string * @param {ASTNode} node node to evaluate * @returns {boolean} True if its a string * @private */ function isString(node) { return node && node.type === "Literal" && typeof node.value === "string"; } /** * Validate strings passed to the RegExp constructor * @param {ASTNode} node node to validate * @returns {void} * @private */ function checkFunction(node) { var scope = context.getScope(); var regExpVar = astUtils.getVariableByName(scope, "RegExp"); var shadowed = regExpVar && regExpVar.defs.length > 0; if (node.callee.type === "Identifier" && node.callee.name === "RegExp" && isString(node.arguments[0]) && !shadowed) { checkRegex(node, node.arguments[0].value, node.arguments[0].start + 1); } } return { Literal: checkLiteral, CallExpression: checkFunction, NewExpression: checkFunction }; } }; },{"../ast-utils":67}],233:[function(require,module,exports){ /** * @fileoverview Restrict usage of specified globals. * @author Benoît Zugmeyer */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow specified global variables", category: "Variables", recommended: false }, schema: { type: "array", items: { type: "string" }, uniqueItems: true } }, create: function create(context) { var restrictedGlobals = context.options; // if no globals are restricted we don't need to check if (restrictedGlobals.length === 0) { return {}; } /** * Report a variable to be used as a restricted global. * @param {Reference} reference the variable reference * @returns {void} * @private */ function reportReference(reference) { context.report({ node: reference.identifier, message: "Unexpected use of '{{name}}'.", data: { name: reference.identifier.name } }); } /** * Check if the given name is a restricted global name. * @param {string} name name of a variable * @returns {boolean} whether the variable is a restricted global or not * @private */ function isRestricted(name) { return restrictedGlobals.indexOf(name) >= 0; } return { Program: function Program() { var scope = context.getScope(); // Report variables declared elsewhere (ex: variables defined as "global" by eslint) scope.variables.forEach(function (variable) { if (!variable.defs.length && isRestricted(variable.name)) { variable.references.forEach(reportReference); } }); // Report variables not declared at all scope.through.forEach(function (reference) { if (isRestricted(reference.identifier.name)) { reportReference(reference); } }); } }; } }; },{}],234:[function(require,module,exports){ /** * @fileoverview Restrict usage of specified node imports. * @author Guy Ellis */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; var ignore = require("ignore"); var arrayOfStrings = { type: "array", items: { type: "string" }, uniqueItems: true }; module.exports = { meta: { docs: { description: "disallow specified modules when loaded by `import`", category: "ECMAScript 6", recommended: false }, schema: { anyOf: [arrayOfStrings, { type: "array", items: [{ type: "object", properties: { paths: arrayOfStrings, patterns: arrayOfStrings }, additionalProperties: false }], additionalItems: false }] } }, create: function create(context) { var options = Array.isArray(context.options) ? context.options : []; var isStringArray = _typeof(options[0]) !== "object"; var restrictedPaths = new Set(isStringArray ? context.options : options[0].paths || []); var restrictedPatterns = isStringArray ? [] : options[0].patterns || []; // if no imports are restricted we don"t need to check if (restrictedPaths.size === 0 && restrictedPatterns.length === 0) { return {}; } var ig = ignore().add(restrictedPatterns); return { ImportDeclaration: function ImportDeclaration(node) { if (node && node.source && node.source.value) { var importName = node.source.value.trim(); if (restrictedPaths.has(importName)) { context.report({ node: node, message: "'{{importName}}' import is restricted from being used.", data: { importName: importName } }); } if (restrictedPatterns.length > 0 && ig.ignores(importName)) { context.report({ node: node, message: "'{{importName}}' import is restricted from being used by a pattern.", data: { importName: importName } }); } } } }; } }; },{"ignore":39}],235:[function(require,module,exports){ /** * @fileoverview Restrict usage of specified node modules. * @author Christian Schulz */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; var ignore = require("ignore"); var arrayOfStrings = { type: "array", items: { type: "string" }, uniqueItems: true }; module.exports = { meta: { docs: { description: "disallow specified modules when loaded by `require`", category: "Node.js and CommonJS", recommended: false }, schema: { anyOf: [arrayOfStrings, { type: "array", items: [{ type: "object", properties: { paths: arrayOfStrings, patterns: arrayOfStrings }, additionalProperties: false }], additionalItems: false }] } }, create: function create(context) { var options = Array.isArray(context.options) ? context.options : []; var isStringArray = _typeof(options[0]) !== "object"; var restrictedPaths = new Set(isStringArray ? context.options : options[0].paths || []); var restrictedPatterns = isStringArray ? [] : options[0].patterns || []; // if no imports are restricted we don"t need to check if (restrictedPaths.size === 0 && restrictedPatterns.length === 0) { return {}; } var ig = ignore().add(restrictedPatterns); /** * Function to check if a node is a string literal. * @param {ASTNode} node The node to check. * @returns {boolean} If the node is a string literal. */ function isString(node) { return node && node.type === "Literal" && typeof node.value === "string"; } /** * Function to check if a node is a require call. * @param {ASTNode} node The node to check. * @returns {boolean} If the node is a require call. */ function isRequireCall(node) { return node.callee.type === "Identifier" && node.callee.name === "require"; } return { CallExpression: function CallExpression(node) { if (isRequireCall(node)) { // node has arguments and first argument is string if (node.arguments.length && isString(node.arguments[0])) { var moduleName = node.arguments[0].value.trim(); // check if argument value is in restricted modules array if (restrictedPaths.has(moduleName)) { context.report({ node: node, message: "'{{moduleName}}' module is restricted from being used.", data: { moduleName: moduleName } }); } if (restrictedPatterns.length > 0 && ig.ignores(moduleName)) { context.report({ node: node, message: "'{{moduleName}}' module is restricted from being used by a pattern.", data: { moduleName: moduleName } }); } } } } }; } }; },{"ignore":39}],236:[function(require,module,exports){ /** * @fileoverview Rule to disallow certain object properties * @author Will Klein & Eli White */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow certain properties on certain objects", category: "Best Practices", recommended: false }, schema: { type: "array", items: { anyOf: [// `object` and `property` are both optional, but at least one of them must be provided. { type: "object", properties: { object: { type: "string" }, property: { type: "string" }, message: { type: "string" } }, additionalProperties: false, required: ["object"] }, { type: "object", properties: { object: { type: "string" }, property: { type: "string" }, message: { type: "string" } }, additionalProperties: false, required: ["property"] }] }, uniqueItems: true } }, create: function create(context) { var restrictedCalls = context.options; if (restrictedCalls.length === 0) { return {}; } var restrictedProperties = new Map(); var globallyRestrictedObjects = new Map(); var globallyRestrictedProperties = new Map(); restrictedCalls.forEach(function (option) { var objectName = option.object; var propertyName = option.property; if (typeof objectName === "undefined") { globallyRestrictedProperties.set(propertyName, { message: option.message }); } else if (typeof propertyName === "undefined") { globallyRestrictedObjects.set(objectName, { message: option.message }); } else { if (!restrictedProperties.has(objectName)) { restrictedProperties.set(objectName, new Map()); } restrictedProperties.get(objectName).set(propertyName, { message: option.message }); } }); /** * Checks to see whether a property access is restricted, and reports it if so. * @param {ASTNode} node The node to report * @param {string} objectName The name of the object * @param {string} propertyName The name of the property * @returns {undefined} */ function checkPropertyAccess(node, objectName, propertyName) { if (propertyName === null) { return; } var matchedObject = restrictedProperties.get(objectName); var matchedObjectProperty = matchedObject ? matchedObject.get(propertyName) : globallyRestrictedObjects.get(objectName); var globalMatchedProperty = globallyRestrictedProperties.get(propertyName); if (matchedObjectProperty) { var message = matchedObjectProperty.message ? " " + matchedObjectProperty.message : ""; // eslint-disable-next-line eslint-plugin/report-message-format context.report({ node: node, message: "'{{objectName}}.{{propertyName}}' is restricted from being used.{{message}}", data: { objectName: objectName, propertyName: propertyName, message: message } }); } else if (globalMatchedProperty) { var _message = globalMatchedProperty.message ? " " + globalMatchedProperty.message : ""; // eslint-disable-next-line eslint-plugin/report-message-format context.report({ node: node, message: "'{{propertyName}}' is restricted from being used.{{message}}", data: { propertyName: propertyName, message: _message } }); } } /** * Checks property accesses in a destructuring assignment expression, e.g. `var foo; ({foo} = bar);` * @param {ASTNode} node An AssignmentExpression or AssignmentPattern node * @returns {undefined} */ function checkDestructuringAssignment(node) { if (node.right.type === "Identifier") { var objectName = node.right.name; if (node.left.type === "ObjectPattern") { node.left.properties.forEach(function (property) { checkPropertyAccess(node.left, objectName, astUtils.getStaticPropertyName(property)); }); } } } return { MemberExpression: function MemberExpression(node) { checkPropertyAccess(node, node.object && node.object.name, astUtils.getStaticPropertyName(node)); }, VariableDeclarator: function VariableDeclarator(node) { if (node.init && node.init.type === "Identifier") { var objectName = node.init.name; if (node.id.type === "ObjectPattern") { node.id.properties.forEach(function (property) { checkPropertyAccess(node.id, objectName, astUtils.getStaticPropertyName(property)); }); } } }, AssignmentExpression: checkDestructuringAssignment, AssignmentPattern: checkDestructuringAssignment }; } }; },{"../ast-utils":67}],237:[function(require,module,exports){ /** * @fileoverview Rule to flag use of certain node types * @author Burak Yigit Kaya */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; } module.exports = { meta: { docs: { description: "disallow specified syntax", category: "Stylistic Issues", recommended: false }, schema: { type: "array", items: [{ oneOf: [{ type: "string" }, { type: "object", properties: { selector: { type: "string" }, message: { type: "string" } }, required: ["selector"], additionalProperties: false }] }], uniqueItems: true, minItems: 0 } }, create: function create(context) { return context.options.reduce(function (result, selectorOrObject) { var isStringFormat = typeof selectorOrObject === "string"; var hasCustomMessage = !isStringFormat && Boolean(selectorOrObject.message); var selector = isStringFormat ? selectorOrObject : selectorOrObject.selector; var message = hasCustomMessage ? selectorOrObject.message : "Using '{{selector}}' is not allowed."; return Object.assign(result, _defineProperty({}, selector, function (node) { context.report({ node: node, message: message, data: hasCustomMessage ? {} : { selector: selector } }); })); }, {}); } }; },{}],238:[function(require,module,exports){ /** * @fileoverview Rule to flag when return statement contains assignment * @author Ilya Volodin */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var SENTINEL_TYPE = /^(?:[a-zA-Z]+?Statement|ArrowFunctionExpression|FunctionExpression|ClassExpression)$/; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow assignment operators in `return` statements", category: "Best Practices", recommended: false }, schema: [{ enum: ["except-parens", "always"] }] }, create: function create(context) { var always = (context.options[0] || "except-parens") !== "except-parens"; var sourceCode = context.getSourceCode(); return { AssignmentExpression: function AssignmentExpression(node) { if (!always && astUtils.isParenthesised(sourceCode, node)) { return; } var parent = node.parent; // Find ReturnStatement or ArrowFunctionExpression in ancestors. while (parent && !SENTINEL_TYPE.test(parent.type)) { node = parent; parent = parent.parent; } // Reports. if (parent && parent.type === "ReturnStatement") { context.report({ node: parent, message: "Return statement should not contain assignment." }); } else if (parent && parent.type === "ArrowFunctionExpression" && parent.body === node) { context.report({ node: parent, message: "Arrow function should not return assignment." }); } } }; } }; },{"../ast-utils":67}],239:[function(require,module,exports){ /** * @fileoverview Disallows unnecessary `return await` * @author Jordan Harband */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ var message = "Redundant use of `await` on a return value."; module.exports = { meta: { docs: { description: "disallow unnecessary `return await`", category: "Best Practices", recommended: false // TODO: set to true }, fixable: null, schema: [] }, create: function create(context) { /** * Reports a found unnecessary `await` expression. * @param {ASTNode} node The node representing the `await` expression to report * @returns {void} */ function reportUnnecessaryAwait(node) { context.report({ node: context.getSourceCode().getFirstToken(node), loc: node.loc, message: message }); } /** * Determines whether a thrown error from this node will be caught/handled within this function rather than immediately halting * this function. For example, a statement in a `try` block will always have an error handler. A statement in * a `catch` block will only have an error handler if there is also a `finally` block. * @param {ASTNode} node A node representing a location where an could be thrown * @returns {boolean} `true` if a thrown error will be caught/handled in this function */ function hasErrorHandler(node) { var ancestor = node; while (!astUtils.isFunction(ancestor) && ancestor.type !== "Program") { if (ancestor.parent.type === "TryStatement" && (ancestor === ancestor.parent.block || ancestor === ancestor.parent.handler && ancestor.parent.finalizer)) { return true; } ancestor = ancestor.parent; } return false; } /** * Checks if a node is placed in tail call position. Once `return` arguments (or arrow function expressions) can be a complex expression, * an `await` expression could or could not be unnecessary by the definition of this rule. So we're looking for `await` expressions that are in tail position. * @param {ASTNode} node A node representing the `await` expression to check * @returns {boolean} The checking result */ function isInTailCallPosition(node) { if (node.parent.type === "ArrowFunctionExpression") { return true; } if (node.parent.type === "ReturnStatement") { return !hasErrorHandler(node.parent); } if (node.parent.type === "ConditionalExpression" && (node === node.parent.consequent || node === node.parent.alternate)) { return isInTailCallPosition(node.parent); } if (node.parent.type === "LogicalExpression" && node === node.parent.right) { return isInTailCallPosition(node.parent); } if (node.parent.type === "SequenceExpression" && node === node.parent.expressions[node.parent.expressions.length - 1]) { return isInTailCallPosition(node.parent); } return false; } return { AwaitExpression: function AwaitExpression(node) { if (isInTailCallPosition(node) && !hasErrorHandler(node)) { reportUnnecessaryAwait(node); } } }; } }; },{"../ast-utils":67}],240:[function(require,module,exports){ /** * @fileoverview Rule to flag when using javascript: urls * @author Ilya Volodin */ /* jshint scripturl: true */ /* eslint no-script-url: 0 */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow `javascript:` urls", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { return { Literal: function Literal(node) { if (node.value && typeof node.value === "string") { var value = node.value.toLowerCase(); if (value.indexOf("javascript:") === 0) { context.report({ node: node, message: "Script URL is a form of eval." }); } } } }; } }; },{}],241:[function(require,module,exports){ /** * @fileoverview Rule to disallow assignments where both sides are exactly the same * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var SPACES = /\s+/g; /** * Checks whether the property of 2 given member expression nodes are the same * property or not. * * @param {ASTNode} left - A member expression node to check. * @param {ASTNode} right - Another member expression node to check. * @returns {boolean} `true` if the member expressions have the same property. */ function isSameProperty(left, right) { if (left.property.type === "Identifier" && left.property.type === right.property.type && left.property.name === right.property.name && left.computed === right.computed) { return true; } var lname = astUtils.getStaticPropertyName(left); var rname = astUtils.getStaticPropertyName(right); return lname !== null && lname === rname; } /** * Checks whether 2 given member expression nodes are the reference to the same * property or not. * * @param {ASTNode} left - A member expression node to check. * @param {ASTNode} right - Another member expression node to check. * @returns {boolean} `true` if the member expressions are the reference to the * same property or not. */ function isSameMember(left, right) { if (!isSameProperty(left, right)) { return false; } var lobj = left.object; var robj = right.object; if (lobj.type !== robj.type) { return false; } if (lobj.type === "MemberExpression") { return isSameMember(lobj, robj); } return lobj.type === "Identifier" && lobj.name === robj.name; } /** * Traverses 2 Pattern nodes in parallel, then reports self-assignments. * * @param {ASTNode|null} left - A left node to traverse. This is a Pattern or * a Property. * @param {ASTNode|null} right - A right node to traverse. This is a Pattern or * a Property. * @param {boolean} props - The flag to check member expressions as well. * @param {Function} report - A callback function to report. * @returns {void} */ function eachSelfAssignment(left, right, props, report) { if (!left || !right) { // do nothing } else if (left.type === "Identifier" && right.type === "Identifier" && left.name === right.name) { report(right); } else if (left.type === "ArrayPattern" && right.type === "ArrayExpression") { var end = Math.min(left.elements.length, right.elements.length); for (var i = 0; i < end; ++i) { var rightElement = right.elements[i]; eachSelfAssignment(left.elements[i], rightElement, props, report); // After a spread element, those indices are unknown. if (rightElement && rightElement.type === "SpreadElement") { break; } } } else if (left.type === "RestElement" && right.type === "SpreadElement") { eachSelfAssignment(left.argument, right.argument, props, report); } else if (left.type === "ObjectPattern" && right.type === "ObjectExpression" && right.properties.length >= 1) { // Gets the index of the last spread property. // It's possible to overwrite properties followed by it. var startJ = 0; for (var _i = right.properties.length - 1; _i >= 0; --_i) { if (right.properties[_i].type === "ExperimentalSpreadProperty") { startJ = _i + 1; break; } } for (var _i2 = 0; _i2 < left.properties.length; ++_i2) { for (var j = startJ; j < right.properties.length; ++j) { eachSelfAssignment(left.properties[_i2], right.properties[j], props, report); } } } else if (left.type === "Property" && right.type === "Property" && !left.computed && !right.computed && right.kind === "init" && !right.method && left.key.name === right.key.name) { eachSelfAssignment(left.value, right.value, props, report); } else if (props && left.type === "MemberExpression" && right.type === "MemberExpression" && isSameMember(left, right)) { report(right); } } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow assignments where both sides are exactly the same", category: "Best Practices", recommended: true }, schema: [{ type: "object", properties: { props: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var sourceCode = context.getSourceCode(); var options = context.options[0]; var props = Boolean(options && options.props); /** * Reports a given node as self assignments. * * @param {ASTNode} node - A node to report. This is an Identifier node. * @returns {void} */ function report(node) { context.report({ node: node, message: "'{{name}}' is assigned to itself.", data: { name: sourceCode.getText(node).replace(SPACES, "") } }); } return { AssignmentExpression: function AssignmentExpression(node) { if (node.operator === "=") { eachSelfAssignment(node.left, node.right, props, report); } } }; } }; },{"../ast-utils":67}],242:[function(require,module,exports){ /** * @fileoverview Rule to flag comparison where left part is the same as the right * part. * @author Ilya Volodin */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow comparisons where both sides are exactly the same", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { var sourceCode = context.getSourceCode(); /** * Determines whether two nodes are composed of the same tokens. * @param {ASTNode} nodeA The first node * @param {ASTNode} nodeB The second node * @returns {boolean} true if the nodes have identical token representations */ function hasSameTokens(nodeA, nodeB) { var tokensA = sourceCode.getTokens(nodeA); var tokensB = sourceCode.getTokens(nodeB); return tokensA.length === tokensB.length && tokensA.every(function (token, index) { return token.type === tokensB[index].type && token.value === tokensB[index].value; }); } return { BinaryExpression: function BinaryExpression(node) { var operators = new Set(["===", "==", "!==", "!=", ">", "<", ">=", "<="]); if (operators.has(node.operator) && hasSameTokens(node.left, node.right)) { context.report({ node: node, message: "Comparing to itself is potentially pointless." }); } } }; } }; },{}],243:[function(require,module,exports){ /** * @fileoverview Rule to flag use of comma operator * @author Brandon Mills */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow comma operators", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { var sourceCode = context.getSourceCode(); /** * Parts of the grammar that are required to have parens. */ var parenthesized = { DoWhileStatement: "test", IfStatement: "test", SwitchStatement: "discriminant", WhileStatement: "test", WithStatement: "object", ArrowFunctionExpression: "body" // Omitting CallExpression - commas are parsed as argument separators // Omitting NewExpression - commas are parsed as argument separators // Omitting ForInStatement - parts aren't individually parenthesised // Omitting ForStatement - parts aren't individually parenthesised }; /** * Determines whether a node is required by the grammar to be wrapped in * parens, e.g. the test of an if statement. * @param {ASTNode} node - The AST node * @returns {boolean} True if parens around node belong to parent node. */ function requiresExtraParens(node) { return node.parent && parenthesized[node.parent.type] && node === node.parent[parenthesized[node.parent.type]]; } /** * Check if a node is wrapped in parens. * @param {ASTNode} node - The AST node * @returns {boolean} True if the node has a paren on each side. */ function isParenthesised(node) { return astUtils.isParenthesised(sourceCode, node); } /** * Check if a node is wrapped in two levels of parens. * @param {ASTNode} node - The AST node * @returns {boolean} True if two parens surround the node on each side. */ function isParenthesisedTwice(node) { var previousToken = sourceCode.getTokenBefore(node, 1), nextToken = sourceCode.getTokenAfter(node, 1); return isParenthesised(node) && previousToken && nextToken && astUtils.isOpeningParenToken(previousToken) && previousToken.range[1] <= node.range[0] && astUtils.isClosingParenToken(nextToken) && nextToken.range[0] >= node.range[1]; } return { SequenceExpression: function SequenceExpression(node) { // Always allow sequences in for statement update if (node.parent.type === "ForStatement" && (node === node.parent.init || node === node.parent.update)) { return; } // Wrapping a sequence in extra parens indicates intent if (requiresExtraParens(node)) { if (isParenthesisedTwice(node)) { return; } } else { if (isParenthesised(node)) { return; } } var child = sourceCode.getTokenAfter(node.expressions[0]); context.report({ node: node, loc: child.loc.start, message: "Unexpected use of comma operator." }); } }; } }; },{"../ast-utils":67}],244:[function(require,module,exports){ /** * @fileoverview Disallow shadowing of NaN, undefined, and Infinity (ES5 section 15.1.1) * @author Michael Ficarra */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow identifiers from shadowing restricted names", category: "Variables", recommended: false }, schema: [] }, create: function create(context) { var RESTRICTED = ["undefined", "NaN", "Infinity", "arguments", "eval"]; /** * Check if the node name is present inside the restricted list * @param {ASTNode} id id to evaluate * @returns {void} * @private */ function checkForViolation(id) { if (RESTRICTED.indexOf(id.name) > -1) { context.report({ node: id, message: "Shadowing of global property '{{idName}}'.", data: { idName: id.name } }); } } return { VariableDeclarator: function VariableDeclarator(node) { checkForViolation(node.id); }, ArrowFunctionExpression: function ArrowFunctionExpression(node) { [].map.call(node.params, checkForViolation); }, FunctionExpression: function FunctionExpression(node) { if (node.id) { checkForViolation(node.id); } [].map.call(node.params, checkForViolation); }, FunctionDeclaration: function FunctionDeclaration(node) { if (node.id) { checkForViolation(node.id); [].map.call(node.params, checkForViolation); } }, CatchClause: function CatchClause(node) { checkForViolation(node.param); } }; } }; },{}],245:[function(require,module,exports){ /** * @fileoverview Rule to flag on declaring variables already declared in the outer scope * @author Ilya Volodin */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow variable declarations from shadowing variables declared in the outer scope", category: "Variables", recommended: false }, schema: [{ type: "object", properties: { builtinGlobals: { type: "boolean" }, hoist: { enum: ["all", "functions", "never"] }, allow: { type: "array", items: { type: "string" } } }, additionalProperties: false }] }, create: function create(context) { var options = { builtinGlobals: Boolean(context.options[0] && context.options[0].builtinGlobals), hoist: context.options[0] && context.options[0].hoist || "functions", allow: context.options[0] && context.options[0].allow || [] }; /** * Check if variable name is allowed. * * @param {ASTNode} variable The variable to check. * @returns {boolean} Whether or not the variable name is allowed. */ function isAllowed(variable) { return options.allow.indexOf(variable.name) !== -1; } /** * Checks if a variable of the class name in the class scope of ClassDeclaration. * * ClassDeclaration creates two variables of its name into its outer scope and its class scope. * So we should ignore the variable in the class scope. * * @param {Object} variable The variable to check. * @returns {boolean} Whether or not the variable of the class name in the class scope of ClassDeclaration. */ function isDuplicatedClassNameVariable(variable) { var block = variable.scope.block; return block.type === "ClassDeclaration" && block.id === variable.identifiers[0]; } /** * Checks if a variable is inside the initializer of scopeVar. * * To avoid reporting at declarations such as `var a = function a() {};`. * But it should report `var a = function(a) {};` or `var a = function() { function a() {} };`. * * @param {Object} variable The variable to check. * @param {Object} scopeVar The scope variable to look for. * @returns {boolean} Whether or not the variable is inside initializer of scopeVar. */ function isOnInitializer(variable, scopeVar) { var outerScope = scopeVar.scope; var outerDef = scopeVar.defs[0]; var outer = outerDef && outerDef.parent && outerDef.parent.range; var innerScope = variable.scope; var innerDef = variable.defs[0]; var inner = innerDef && innerDef.name.range; return outer && inner && outer[0] < inner[0] && inner[1] < outer[1] && (innerDef.type === "FunctionName" && innerDef.node.type === "FunctionExpression" || innerDef.node.type === "ClassExpression") && outerScope === innerScope.upper; } /** * Get a range of a variable's identifier node. * @param {Object} variable The variable to get. * @returns {Array|undefined} The range of the variable's identifier node. */ function getNameRange(variable) { var def = variable.defs[0]; return def && def.name.range; } /** * Checks if a variable is in TDZ of scopeVar. * @param {Object} variable The variable to check. * @param {Object} scopeVar The variable of TDZ. * @returns {boolean} Whether or not the variable is in TDZ of scopeVar. */ function isInTdz(variable, scopeVar) { var outerDef = scopeVar.defs[0]; var inner = getNameRange(variable); var outer = getNameRange(scopeVar); return inner && outer && inner[1] < outer[0] && ( // Excepts FunctionDeclaration if is {"hoist":"function"}. options.hoist !== "functions" || !outerDef || outerDef.node.type !== "FunctionDeclaration"); } /** * Checks the current context for shadowed variables. * @param {Scope} scope - Fixme * @returns {void} */ function checkForShadows(scope) { var variables = scope.variables; for (var i = 0; i < variables.length; ++i) { var variable = variables[i]; // Skips "arguments" or variables of a class name in the class scope of ClassDeclaration. if (variable.identifiers.length === 0 || isDuplicatedClassNameVariable(variable) || isAllowed(variable)) { continue; } // Gets shadowed variable. var shadowed = astUtils.getVariableByName(scope.upper, variable.name); if (shadowed && (shadowed.identifiers.length > 0 || options.builtinGlobals && "writeable" in shadowed) && !isOnInitializer(variable, shadowed) && !(options.hoist !== "all" && isInTdz(variable, shadowed))) { context.report({ node: variable.identifiers[0], message: "'{{name}}' is already declared in the upper scope.", data: variable }); } } } return { "Program:exit": function ProgramExit() { var globalScope = context.getScope(); var stack = globalScope.childScopes.slice(); while (stack.length) { var scope = stack.pop(); stack.push.apply(stack, scope.childScopes); checkForShadows(scope); } } }; } }; },{"../ast-utils":67}],246:[function(require,module,exports){ /** * @fileoverview Rule to check that spaced function application * @author Matt DuVall * @deprecated in ESLint v3.3.0 */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow spacing between function identifiers and their applications (deprecated)", category: "Stylistic Issues", recommended: false, replacedBy: ["func-call-spacing"] }, deprecated: true, fixable: "whitespace", schema: [] }, create: function create(context) { var sourceCode = context.getSourceCode(); /** * Check if open space is present in a function name * @param {ASTNode} node node to evaluate * @returns {void} * @private */ function detectOpenSpaces(node) { var lastCalleeToken = sourceCode.getLastToken(node.callee); var prevToken = lastCalleeToken, parenToken = sourceCode.getTokenAfter(lastCalleeToken); // advances to an open parenthesis. while (parenToken && parenToken.range[1] < node.range[1] && parenToken.value !== "(") { prevToken = parenToken; parenToken = sourceCode.getTokenAfter(parenToken); } // look for a space between the callee and the open paren if (parenToken && parenToken.range[1] < node.range[1] && sourceCode.isSpaceBetweenTokens(prevToken, parenToken)) { context.report({ node: node, loc: lastCalleeToken.loc.start, message: "Unexpected space between function name and paren.", fix: function fix(fixer) { return fixer.removeRange([prevToken.range[1], parenToken.range[0]]); } }); } } return { CallExpression: detectOpenSpaces, NewExpression: detectOpenSpaces }; } }; },{}],247:[function(require,module,exports){ /** * @fileoverview Disallow sparse arrays * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow sparse arrays", category: "Possible Errors", recommended: true }, schema: [] }, create: function create(context) { //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { ArrayExpression: function ArrayExpression(node) { var emptySpot = node.elements.indexOf(null) > -1; if (emptySpot) { context.report({ node: node, message: "Unexpected comma in middle of array." }); } } }; } }; },{}],248:[function(require,module,exports){ /** * @fileoverview Rule to check for properties whose identifier ends with the string Sync * @author Matt DuVall */ /* jshint node:true */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow synchronous methods", category: "Node.js and CommonJS", recommended: false }, schema: [] }, create: function create(context) { return { "MemberExpression[property.name=/.*Sync$/]": function MemberExpressionPropertyNameSync$(node) { context.report({ node: node, message: "Unexpected sync method: '{{propertyName}}'.", data: { propertyName: node.property.name } }); } }; } }; },{}],249:[function(require,module,exports){ /** * @fileoverview Rule to check for tabs inside a file * @author Gyandeep Singh */ "use strict"; //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var regex = /\t/; //------------------------------------------------------------------------------ // Public Interface //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow all tabs", category: "Stylistic Issues", recommended: false }, schema: [] }, create: function create(context) { return { Program: function Program(node) { context.getSourceLines().forEach(function (line, index) { var match = regex.exec(line); if (match) { context.report({ node: node, loc: { line: index + 1, column: match.index + 1 }, message: "Unexpected tab character." }); } }); } }; } }; },{}],250:[function(require,module,exports){ /** * @fileoverview Warn when using template string syntax in regular strings * @author Jeroen Engels */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow template literal placeholder syntax in regular strings", category: "Possible Errors", recommended: false }, schema: [] }, create: function create(context) { var regex = /\$\{[^}]+\}/; return { Literal: function Literal(node) { if (typeof node.value === "string" && regex.test(node.value)) { context.report({ node: node, message: "Unexpected template string expression." }); } } }; } }; },{}],251:[function(require,module,exports){ /** * @fileoverview Rule to flag use of ternary operators. * @author Ian Christian Myers */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow ternary operators", category: "Stylistic Issues", recommended: false }, schema: [] }, create: function create(context) { return { ConditionalExpression: function ConditionalExpression(node) { context.report({ node: node, message: "Ternary operator used." }); } }; } }; },{}],252:[function(require,module,exports){ /** * @fileoverview A rule to disallow using `this`/`super` before `super()`. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Checks whether or not a given node is a constructor. * @param {ASTNode} node - A node to check. This node type is one of * `Program`, `FunctionDeclaration`, `FunctionExpression`, and * `ArrowFunctionExpression`. * @returns {boolean} `true` if the node is a constructor. */ function isConstructorFunction(node) { return node.type === "FunctionExpression" && node.parent.type === "MethodDefinition" && node.parent.kind === "constructor"; } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow `this`/`super` before calling `super()` in constructors", category: "ECMAScript 6", recommended: true }, schema: [] }, create: function create(context) { /* * Information for each constructor. * - upper: Information of the upper constructor. * - hasExtends: A flag which shows whether the owner class has a valid * `extends` part. * - scope: The scope of the owner class. * - codePath: The code path of this constructor. */ var funcInfo = null; /* * Information for each code path segment. * Each key is the id of a code path segment. * Each value is an object: * - superCalled: The flag which shows `super()` called in all code paths. * - invalidNodes: The array of invalid ThisExpression and Super nodes. */ var segInfoMap = Object.create(null); /** * Gets whether or not `super()` is called in a given code path segment. * @param {CodePathSegment} segment - A code path segment to get. * @returns {boolean} `true` if `super()` is called. */ function isCalled(segment) { return !segment.reachable || segInfoMap[segment.id].superCalled; } /** * Checks whether or not this is in a constructor. * @returns {boolean} `true` if this is in a constructor. */ function isInConstructorOfDerivedClass() { return Boolean(funcInfo && funcInfo.isConstructor && funcInfo.hasExtends); } /** * Checks whether or not this is before `super()` is called. * @returns {boolean} `true` if this is before `super()` is called. */ function isBeforeCallOfSuper() { return isInConstructorOfDerivedClass() && !funcInfo.codePath.currentSegments.every(isCalled); } /** * Sets a given node as invalid. * @param {ASTNode} node - A node to set as invalid. This is one of * a ThisExpression and a Super. * @returns {void} */ function setInvalid(node) { var segments = funcInfo.codePath.currentSegments; for (var i = 0; i < segments.length; ++i) { var segment = segments[i]; if (segment.reachable) { segInfoMap[segment.id].invalidNodes.push(node); } } } /** * Sets the current segment as `super` was called. * @returns {void} */ function setSuperCalled() { var segments = funcInfo.codePath.currentSegments; for (var i = 0; i < segments.length; ++i) { var segment = segments[i]; if (segment.reachable) { segInfoMap[segment.id].superCalled = true; } } } return { /** * Adds information of a constructor into the stack. * @param {CodePath} codePath - A code path which was started. * @param {ASTNode} node - The current node. * @returns {void} */ onCodePathStart: function onCodePathStart(codePath, node) { if (isConstructorFunction(node)) { // Class > ClassBody > MethodDefinition > FunctionExpression var classNode = node.parent.parent.parent; funcInfo = { upper: funcInfo, isConstructor: true, hasExtends: Boolean(classNode.superClass && !astUtils.isNullOrUndefined(classNode.superClass)), codePath: codePath }; } else { funcInfo = { upper: funcInfo, isConstructor: false, hasExtends: false, codePath: codePath }; } }, /** * Removes the top of stack item. * * And this treverses all segments of this code path then reports every * invalid node. * * @param {CodePath} codePath - A code path which was ended. * @param {ASTNode} node - The current node. * @returns {void} */ onCodePathEnd: function onCodePathEnd(codePath) { var isDerivedClass = funcInfo.hasExtends; funcInfo = funcInfo.upper; if (!isDerivedClass) { return; } codePath.traverseSegments(function (segment, controller) { var info = segInfoMap[segment.id]; for (var i = 0; i < info.invalidNodes.length; ++i) { var invalidNode = info.invalidNodes[i]; context.report({ message: "'{{kind}}' is not allowed before 'super()'.", node: invalidNode, data: { kind: invalidNode.type === "Super" ? "super" : "this" } }); } if (info.superCalled) { controller.skip(); } }); }, /** * Initialize information of a given code path segment. * @param {CodePathSegment} segment - A code path segment to initialize. * @returns {void} */ onCodePathSegmentStart: function onCodePathSegmentStart(segment) { if (!isInConstructorOfDerivedClass()) { return; } // Initialize info. segInfoMap[segment.id] = { superCalled: segment.prevSegments.length > 0 && segment.prevSegments.every(isCalled), invalidNodes: [] }; }, /** * Update information of the code path segment when a code path was * looped. * @param {CodePathSegment} fromSegment - The code path segment of the * end of a loop. * @param {CodePathSegment} toSegment - A code path segment of the head * of a loop. * @returns {void} */ onCodePathSegmentLoop: function onCodePathSegmentLoop(fromSegment, toSegment) { if (!isInConstructorOfDerivedClass()) { return; } // Update information inside of the loop. funcInfo.codePath.traverseSegments({ first: toSegment, last: fromSegment }, function (segment, controller) { var info = segInfoMap[segment.id]; if (info.superCalled) { info.invalidNodes = []; controller.skip(); } else if (segment.prevSegments.length > 0 && segment.prevSegments.every(isCalled)) { info.superCalled = true; info.invalidNodes = []; } }); }, /** * Reports if this is before `super()`. * @param {ASTNode} node - A target node. * @returns {void} */ ThisExpression: function ThisExpression(node) { if (isBeforeCallOfSuper()) { setInvalid(node); } }, /** * Reports if this is before `super()`. * @param {ASTNode} node - A target node. * @returns {void} */ Super: function Super(node) { if (!astUtils.isCallee(node) && isBeforeCallOfSuper()) { setInvalid(node); } }, /** * Marks `super()` called. * @param {ASTNode} node - A target node. * @returns {void} */ "CallExpression:exit": function CallExpressionExit(node) { if (node.callee.type === "Super" && isBeforeCallOfSuper()) { setSuperCalled(); } }, /** * Resets state. * @returns {void} */ "Program:exit": function ProgramExit() { segInfoMap = Object.create(null); } }; } }; },{"../ast-utils":67}],253:[function(require,module,exports){ /** * @fileoverview Rule to restrict what can be thrown as an exception. * @author Dieter Oberkofler */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow throwing literals as exceptions", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { return { ThrowStatement: function ThrowStatement(node) { if (!astUtils.couldBeError(node.argument)) { context.report({ node: node, message: "Expected an object to be thrown." }); } else if (node.argument.type === "Identifier") { if (node.argument.name === "undefined") { context.report({ node: node, message: "Do not throw undefined." }); } } } }; } }; },{"../ast-utils":67}],254:[function(require,module,exports){ /** * @fileoverview Disallow trailing spaces at the end of lines. * @author Nodeca Team */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow trailing whitespace at the end of lines", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ type: "object", properties: { skipBlankLines: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var sourceCode = context.getSourceCode(); var BLANK_CLASS = "[ \t\xA0\u2000-\u200B\u3000]", SKIP_BLANK = "^" + BLANK_CLASS + "*$", NONBLANK = BLANK_CLASS + "+$"; var options = context.options[0] || {}, skipBlankLines = options.skipBlankLines || false; /** * Report the error message * @param {ASTNode} node node to report * @param {int[]} location range information * @param {int[]} fixRange Range based on the whole program * @returns {void} */ function report(node, location, fixRange) { /* * Passing node is a bit dirty, because message data will contain big * text in `source`. But... who cares :) ? * One more kludge will not make worse the bloody wizardry of this * plugin. */ context.report({ node: node, loc: location, message: "Trailing spaces not allowed.", fix: function fix(fixer) { return fixer.removeRange(fixRange); } }); } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { Program: function checkTrailingSpaces(node) { // Let's hack. Since Espree does not return whitespace nodes, // fetch the source code and do matching via regexps. var re = new RegExp(NONBLANK), skipMatch = new RegExp(SKIP_BLANK), lines = sourceCode.lines, linebreaks = sourceCode.getText().match(astUtils.createGlobalLinebreakMatcher()); var totalLength = 0, fixRange = []; for (var i = 0, ii = lines.length; i < ii; i++) { var matches = re.exec(lines[i]); // Always add linebreak length to line length to accommodate for line break (\n or \r\n) // Because during the fix time they also reserve one spot in the array. // Usually linebreak length is 2 for \r\n (CRLF) and 1 for \n (LF) var linebreakLength = linebreaks && linebreaks[i] ? linebreaks[i].length : 1; var lineLength = lines[i].length + linebreakLength; if (matches) { var location = { line: i + 1, column: matches.index }; var rangeStart = totalLength + location.column; var rangeEnd = totalLength + lineLength - linebreakLength; var containingNode = sourceCode.getNodeByRangeIndex(rangeStart); if (containingNode && containingNode.type === "TemplateElement" && rangeStart > containingNode.parent.range[0] && rangeEnd < containingNode.parent.range[1]) { totalLength += lineLength; continue; } // If the line has only whitespace, and skipBlankLines // is true, don't report it if (skipBlankLines && skipMatch.test(lines[i])) { totalLength += lineLength; continue; } fixRange = [rangeStart, rangeEnd]; report(node, location, fixRange); } totalLength += lineLength; } } }; } }; },{"../ast-utils":67}],255:[function(require,module,exports){ /** * @fileoverview Rule to flag when initializing to undefined * @author Ilya Volodin */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow initializing variables to `undefined`", category: "Variables", recommended: false }, schema: [], fixable: "code" }, create: function create(context) { var sourceCode = context.getSourceCode(); return { VariableDeclarator: function VariableDeclarator(node) { var name = sourceCode.getText(node.id), init = node.init && node.init.name, scope = context.getScope(), undefinedVar = astUtils.getVariableByName(scope, "undefined"), shadowed = undefinedVar && undefinedVar.defs.length > 0; if (init === "undefined" && node.parent.kind !== "const" && !shadowed) { context.report({ node: node, message: "It's not necessary to initialize '{{name}}' to undefined.", data: { name: name }, fix: function fix(fixer) { if (node.id.type === "ArrayPattern" || node.id.type === "ObjectPattern") { // Don't fix destructuring assignment to `undefined`. return null; } return fixer.removeRange([node.id.range[1], node.range[1]]); } }); } } }; } }; },{"../ast-utils":67}],256:[function(require,module,exports){ /** * @fileoverview Rule to flag references to undeclared variables. * @author Mark Macdonald */ "use strict"; //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Checks if the given node is the argument of a typeof operator. * @param {ASTNode} node The AST node being checked. * @returns {boolean} Whether or not the node is the argument of a typeof operator. */ function hasTypeOfOperator(node) { var parent = node.parent; return parent.type === "UnaryExpression" && parent.operator === "typeof"; } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow the use of undeclared variables unless mentioned in `/*global */` comments", category: "Variables", recommended: true }, schema: [{ type: "object", properties: { typeof: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var options = context.options[0]; var considerTypeOf = options && options.typeof === true || false; return { "Program:exit": function ProgramExit() /* node */{ var globalScope = context.getScope(); globalScope.through.forEach(function (ref) { var identifier = ref.identifier; if (!considerTypeOf && hasTypeOfOperator(identifier)) { return; } context.report({ node: identifier, message: "'{{name}}' is not defined.", data: identifier }); }); } }; } }; },{}],257:[function(require,module,exports){ /** * @fileoverview Rule to flag references to the undefined variable. * @author Michael Ficarra */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow the use of `undefined` as an identifier", category: "Variables", recommended: false }, schema: [] }, create: function create(context) { /** * Report an invalid "undefined" identifier node. * @param {ASTNode} node The node to report. * @returns {void} */ function report(node) { context.report({ node: node, message: "Unexpected use of undefined." }); } /** * Checks the given scope for references to `undefined` and reports * all references found. * @param {eslint-scope.Scope} scope The scope to check. * @returns {void} */ function checkScope(scope) { var undefinedVar = scope.set.get("undefined"); if (!undefinedVar) { return; } var references = undefinedVar.references; var defs = undefinedVar.defs; // Report non-initializing references (those are covered in defs below) references.filter(function (ref) { return !ref.init; }).forEach(function (ref) { return report(ref.identifier); }); defs.forEach(function (def) { return report(def.name); }); } return { "Program:exit": function ProgramExit() { var globalScope = context.getScope(); var stack = [globalScope]; while (stack.length) { var scope = stack.pop(); stack.push.apply(stack, scope.childScopes); checkScope(scope); } } }; } }; },{}],258:[function(require,module,exports){ /** * @fileoverview Rule to flag trailing underscores in variable declarations. * @author Matt DuVall */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow dangling underscores in identifiers", category: "Stylistic Issues", recommended: false }, schema: [{ type: "object", properties: { allow: { type: "array", items: { type: "string" } }, allowAfterThis: { type: "boolean" }, allowAfterSuper: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var options = context.options[0] || {}; var ALLOWED_VARIABLES = options.allow ? options.allow : []; var allowAfterThis = typeof options.allowAfterThis !== "undefined" ? options.allowAfterThis : false; var allowAfterSuper = typeof options.allowAfterSuper !== "undefined" ? options.allowAfterSuper : false; //------------------------------------------------------------------------- // Helpers //------------------------------------------------------------------------- /** * Check if identifier is present inside the allowed option * @param {string} identifier name of the node * @returns {boolean} true if its is present * @private */ function isAllowed(identifier) { return ALLOWED_VARIABLES.some(function (ident) { return ident === identifier; }); } /** * Check if identifier has a underscore at the end * @param {ASTNode} identifier node to evaluate * @returns {boolean} true if its is present * @private */ function hasTrailingUnderscore(identifier) { var len = identifier.length; return identifier !== "_" && (identifier[0] === "_" || identifier[len - 1] === "_"); } /** * Check if identifier is a special case member expression * @param {ASTNode} identifier node to evaluate * @returns {boolean} true if its is a special case * @private */ function isSpecialCaseIdentifierForMemberExpression(identifier) { return identifier === "__proto__"; } /** * Check if identifier is a special case variable expression * @param {ASTNode} identifier node to evaluate * @returns {boolean} true if its is a special case * @private */ function isSpecialCaseIdentifierInVariableExpression(identifier) { // Checks for the underscore library usage here return identifier === "_"; } /** * Check if function has a underscore at the end * @param {ASTNode} node node to evaluate * @returns {void} * @private */ function checkForTrailingUnderscoreInFunctionDeclaration(node) { if (node.id) { var identifier = node.id.name; if (typeof identifier !== "undefined" && hasTrailingUnderscore(identifier) && !isAllowed(identifier)) { context.report({ node: node, message: "Unexpected dangling '_' in '{{identifier}}'.", data: { identifier: identifier } }); } } } /** * Check if variable expression has a underscore at the end * @param {ASTNode} node node to evaluate * @returns {void} * @private */ function checkForTrailingUnderscoreInVariableExpression(node) { var identifier = node.id.name; if (typeof identifier !== "undefined" && hasTrailingUnderscore(identifier) && !isSpecialCaseIdentifierInVariableExpression(identifier) && !isAllowed(identifier)) { context.report({ node: node, message: "Unexpected dangling '_' in '{{identifier}}'.", data: { identifier: identifier } }); } } /** * Check if member expression has a underscore at the end * @param {ASTNode} node node to evaluate * @returns {void} * @private */ function checkForTrailingUnderscoreInMemberExpression(node) { var identifier = node.property.name, isMemberOfThis = node.object.type === "ThisExpression", isMemberOfSuper = node.object.type === "Super"; if (typeof identifier !== "undefined" && hasTrailingUnderscore(identifier) && !(isMemberOfThis && allowAfterThis) && !(isMemberOfSuper && allowAfterSuper) && !isSpecialCaseIdentifierForMemberExpression(identifier) && !isAllowed(identifier)) { context.report({ node: node, message: "Unexpected dangling '_' in '{{identifier}}'.", data: { identifier: identifier } }); } } //-------------------------------------------------------------------------- // Public API //-------------------------------------------------------------------------- return { FunctionDeclaration: checkForTrailingUnderscoreInFunctionDeclaration, VariableDeclarator: checkForTrailingUnderscoreInVariableExpression, MemberExpression: checkForTrailingUnderscoreInMemberExpression }; } }; },{}],259:[function(require,module,exports){ /** * @fileoverview Rule to spot scenarios where a newline looks like it is ending a statement, but is not. * @author Glen Mailer */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow confusing multiline expressions", category: "Possible Errors", recommended: true }, schema: [] }, create: function create(context) { var FUNCTION_MESSAGE = "Unexpected newline between function and ( of function call."; var PROPERTY_MESSAGE = "Unexpected newline between object and [ of property access."; var TAGGED_TEMPLATE_MESSAGE = "Unexpected newline between template tag and template literal."; var DIVISION_MESSAGE = "Unexpected newline between numerator and division operator."; var REGEX_FLAG_MATCHER = /^[gimuy]+$/; var sourceCode = context.getSourceCode(); /** * Check to see if there is a newline between the node and the following open bracket * line's expression * @param {ASTNode} node The node to check. * @param {string} msg The error message to use. * @returns {void} * @private */ function checkForBreakAfter(node, msg) { var openParen = sourceCode.getTokenAfter(node, astUtils.isNotClosingParenToken); var nodeExpressionEnd = sourceCode.getTokenBefore(openParen); if (openParen.loc.start.line !== nodeExpressionEnd.loc.end.line) { context.report({ node: node, loc: openParen.loc.start, message: msg, data: { char: openParen.value } }); } } //-------------------------------------------------------------------------- // Public API //-------------------------------------------------------------------------- return { MemberExpression: function MemberExpression(node) { if (!node.computed) { return; } checkForBreakAfter(node.object, PROPERTY_MESSAGE); }, TaggedTemplateExpression: function TaggedTemplateExpression(node) { if (node.tag.loc.end.line === node.quasi.loc.start.line) { return; } context.report({ node: node, loc: node.loc.start, message: TAGGED_TEMPLATE_MESSAGE }); }, CallExpression: function CallExpression(node) { if (node.arguments.length === 0) { return; } checkForBreakAfter(node.callee, FUNCTION_MESSAGE); }, "BinaryExpression[operator='/'] > BinaryExpression[operator='/'].left": function BinaryExpressionOperatorBinaryExpressionOperatorLeft(node) { var secondSlash = sourceCode.getTokenAfter(node, function (token) { return token.value === "/"; }); var tokenAfterOperator = sourceCode.getTokenAfter(secondSlash); if (tokenAfterOperator.type === "Identifier" && REGEX_FLAG_MATCHER.test(tokenAfterOperator.value) && secondSlash.range[1] === tokenAfterOperator.range[0]) { checkForBreakAfter(node.left, DIVISION_MESSAGE); } } }; } }; },{"../ast-utils":67}],260:[function(require,module,exports){ /** * @fileoverview Rule to disallow use of unmodified expressions in loop conditions * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var Traverser = require("../util/traverser"), astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var pushAll = Function.apply.bind(Array.prototype.push); var SENTINEL_PATTERN = /(?:(?:Call|Class|Function|Member|New|Yield)Expression|Statement|Declaration)$/; var LOOP_PATTERN = /^(?:DoWhile|For|While)Statement$/; // for-in/of statements don't have `test` property. var GROUP_PATTERN = /^(?:BinaryExpression|ConditionalExpression)$/; var SKIP_PATTERN = /^(?:ArrowFunction|Class|Function)Expression$/; var DYNAMIC_PATTERN = /^(?:Call|Member|New|TaggedTemplate|Yield)Expression$/; /** * @typedef {Object} LoopConditionInfo * @property {eslint-scope.Reference} reference - The reference. * @property {ASTNode} group - BinaryExpression or ConditionalExpression nodes * that the reference is belonging to. * @property {Function} isInLoop - The predicate which checks a given reference * is in this loop. * @property {boolean} modified - The flag that the reference is modified in * this loop. */ /** * Checks whether or not a given reference is a write reference. * * @param {eslint-scope.Reference} reference - A reference to check. * @returns {boolean} `true` if the reference is a write reference. */ function isWriteReference(reference) { if (reference.init) { var def = reference.resolved && reference.resolved.defs[0]; if (!def || def.type !== "Variable" || def.parent.kind !== "var") { return false; } } return reference.isWrite(); } /** * Checks whether or not a given loop condition info does not have the modified * flag. * * @param {LoopConditionInfo} condition - A loop condition info to check. * @returns {boolean} `true` if the loop condition info is "unmodified". */ function isUnmodified(condition) { return !condition.modified; } /** * Checks whether or not a given loop condition info does not have the modified * flag and does not have the group this condition belongs to. * * @param {LoopConditionInfo} condition - A loop condition info to check. * @returns {boolean} `true` if the loop condition info is "unmodified". */ function isUnmodifiedAndNotBelongToGroup(condition) { return !(condition.modified || condition.group); } /** * Checks whether or not a given reference is inside of a given node. * * @param {ASTNode} node - A node to check. * @param {eslint-scope.Reference} reference - A reference to check. * @returns {boolean} `true` if the reference is inside of the node. */ function isInRange(node, reference) { var or = node.range; var ir = reference.identifier.range; return or[0] <= ir[0] && ir[1] <= or[1]; } /** * Checks whether or not a given reference is inside of a loop node's condition. * * @param {ASTNode} node - A node to check. * @param {eslint-scope.Reference} reference - A reference to check. * @returns {boolean} `true` if the reference is inside of the loop node's * condition. */ var isInLoop = { WhileStatement: isInRange, DoWhileStatement: isInRange, ForStatement: function ForStatement(node, reference) { return isInRange(node, reference) && !(node.init && isInRange(node.init, reference)); } }; /** * Checks whether or not a given group node has any dynamic elements. * * @param {ASTNode} root - A node to check. * This node is one of BinaryExpression or ConditionalExpression. * @returns {boolean} `true` if the node is dynamic. */ function hasDynamicExpressions(root) { var retv = false; var traverser = new Traverser(); traverser.traverse(root, { enter: function enter(node) { if (DYNAMIC_PATTERN.test(node.type)) { retv = true; this.break(); } else if (SKIP_PATTERN.test(node.type)) { this.skip(); } } }); return retv; } /** * Creates the loop condition information from a given reference. * * @param {eslint-scope.Reference} reference - A reference to create. * @returns {LoopConditionInfo|null} Created loop condition info, or null. */ function toLoopCondition(reference) { if (reference.init) { return null; } var group = null; var child = reference.identifier; var node = child.parent; while (node) { if (SENTINEL_PATTERN.test(node.type)) { if (LOOP_PATTERN.test(node.type) && node.test === child) { // This reference is inside of a loop condition. return { reference: reference, group: group, isInLoop: isInLoop[node.type].bind(null, node), modified: false }; } // This reference is outside of a loop condition. break; } /* * If it's inside of a group, OK if either operand is modified. * So stores the group this reference belongs to. */ if (GROUP_PATTERN.test(node.type)) { // If this expression is dynamic, no need to check. if (hasDynamicExpressions(node)) { break; } else { group = node; } } child = node; node = node.parent; } return null; } /** * Gets the function which encloses a given reference. * This supports only FunctionDeclaration. * * @param {eslint-scope.Reference} reference - A reference to get. * @returns {ASTNode|null} The function node or null. */ function getEncloseFunctionDeclaration(reference) { var node = reference.identifier; while (node) { if (node.type === "FunctionDeclaration") { return node.id ? node : null; } node = node.parent; } return null; } /** * Updates the "modified" flags of given loop conditions with given modifiers. * * @param {LoopConditionInfo[]} conditions - The loop conditions to be updated. * @param {eslint-scope.Reference[]} modifiers - The references to update. * @returns {void} */ function updateModifiedFlag(conditions, modifiers) { var funcNode = void 0, funcVar = void 0; for (var i = 0; i < conditions.length; ++i) { var condition = conditions[i]; for (var j = 0; !condition.modified && j < modifiers.length; ++j) { var modifier = modifiers[j]; /* * Besides checking for the condition being in the loop, we want to * check the function that this modifier is belonging to is called * in the loop. * FIXME: This should probably be extracted to a function. */ var inLoop = condition.isInLoop(modifier) || Boolean((funcNode = getEncloseFunctionDeclaration(modifier)) && (funcVar = astUtils.getVariableByName(modifier.from.upper, funcNode.id.name)) && funcVar.references.some(condition.isInLoop)); condition.modified = inLoop; } } } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow unmodified loop conditions", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { var groupMap = null; /** * Reports a given condition info. * * @param {LoopConditionInfo} condition - A loop condition info to report. * @returns {void} */ function report(condition) { var node = condition.reference.identifier; context.report({ node: node, message: "'{{name}}' is not modified in this loop.", data: node }); } /** * Registers given conditions to the group the condition belongs to. * * @param {LoopConditionInfo[]} conditions - A loop condition info to * register. * @returns {void} */ function registerConditionsToGroup(conditions) { for (var i = 0; i < conditions.length; ++i) { var condition = conditions[i]; if (condition.group) { var group = groupMap.get(condition.group); if (!group) { group = []; groupMap.set(condition.group, group); } group.push(condition); } } } /** * Reports references which are inside of unmodified groups. * * @param {LoopConditionInfo[]} conditions - A loop condition info to report. * @returns {void} */ function checkConditionsInGroup(conditions) { if (conditions.every(isUnmodified)) { conditions.forEach(report); } } /** * Finds unmodified references which are inside of a loop condition. * Then reports the references which are outside of groups. * * @param {eslint-scope.Variable} variable - A variable to report. * @returns {void} */ function checkReferences(variable) { // Gets references that exist in loop conditions. var conditions = variable.references.map(toLoopCondition).filter(Boolean); if (conditions.length === 0) { return; } // Registers the conditions to belonging groups. registerConditionsToGroup(conditions); // Check the conditions are modified. var modifiers = variable.references.filter(isWriteReference); if (modifiers.length > 0) { updateModifiedFlag(conditions, modifiers); } /* * Reports the conditions which are not belonging to groups. * Others will be reported after all variables are done. */ conditions.filter(isUnmodifiedAndNotBelongToGroup).forEach(report); } return { "Program:exit": function ProgramExit() { var queue = [context.getScope()]; groupMap = new Map(); var scope = void 0; while (scope = queue.pop()) { pushAll(queue, scope.childScopes); scope.variables.forEach(checkReferences); } groupMap.forEach(checkConditionsInGroup); groupMap = null; } }; } }; },{"../ast-utils":67,"../util/traverser":354}],261:[function(require,module,exports){ /** * @fileoverview Rule to flag no-unneeded-ternary * @author Gyandeep Singh */ "use strict"; var astUtils = require("../ast-utils"); // Operators that always result in a boolean value var BOOLEAN_OPERATORS = new Set(["==", "===", "!=", "!==", ">", ">=", "<", "<=", "in", "instanceof"]); var OPERATOR_INVERSES = { "==": "!=", "!=": "==", "===": "!==", "!==": "===" // Operators like < and >= are not true inverses, since both will return false with NaN. }; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow ternary operators when simpler alternatives exist", category: "Stylistic Issues", recommended: false }, schema: [{ type: "object", properties: { defaultAssignment: { type: "boolean" } }, additionalProperties: false }], fixable: "code" }, create: function create(context) { var options = context.options[0] || {}; var defaultAssignment = options.defaultAssignment !== false; var sourceCode = context.getSourceCode(); /** * Test if the node is a boolean literal * @param {ASTNode} node - The node to report. * @returns {boolean} True if the its a boolean literal * @private */ function isBooleanLiteral(node) { return node.type === "Literal" && typeof node.value === "boolean"; } /** * Creates an expression that represents the boolean inverse of the expression represented by the original node * @param {ASTNode} node A node representing an expression * @returns {string} A string representing an inverted expression */ function invertExpression(node) { if (node.type === "BinaryExpression" && Object.prototype.hasOwnProperty.call(OPERATOR_INVERSES, node.operator)) { var operatorToken = sourceCode.getFirstTokenBetween(node.left, node.right, function (token) { return token.value === node.operator; }); return sourceCode.getText().slice(node.range[0], operatorToken.range[0]) + OPERATOR_INVERSES[node.operator] + sourceCode.getText().slice(operatorToken.range[1], node.range[1]); } if (astUtils.getPrecedence(node) < astUtils.getPrecedence({ type: "UnaryExpression" })) { return "!(" + astUtils.getParenthesisedText(sourceCode, node) + ")"; } return "!" + astUtils.getParenthesisedText(sourceCode, node); } /** * Tests if a given node always evaluates to a boolean value * @param {ASTNode} node - An expression node * @returns {boolean} True if it is determined that the node will always evaluate to a boolean value */ function isBooleanExpression(node) { return node.type === "BinaryExpression" && BOOLEAN_OPERATORS.has(node.operator) || node.type === "UnaryExpression" && node.operator === "!"; } /** * Test if the node matches the pattern id ? id : expression * @param {ASTNode} node - The ConditionalExpression to check. * @returns {boolean} True if the pattern is matched, and false otherwise * @private */ function matchesDefaultAssignment(node) { return node.test.type === "Identifier" && node.consequent.type === "Identifier" && node.test.name === node.consequent.name; } return { ConditionalExpression: function ConditionalExpression(node) { if (isBooleanLiteral(node.alternate) && isBooleanLiteral(node.consequent)) { context.report({ node: node, loc: node.consequent.loc.start, message: "Unnecessary use of boolean literals in conditional expression.", fix: function fix(fixer) { if (node.consequent.value === node.alternate.value) { // Replace `foo ? true : true` with just `true`, but don't replace `foo() ? true : true` return node.test.type === "Identifier" ? fixer.replaceText(node, node.consequent.value.toString()) : null; } if (node.alternate.value) { // Replace `foo() ? false : true` with `!(foo())` return fixer.replaceText(node, invertExpression(node.test)); } // Replace `foo ? true : false` with `foo` if `foo` is guaranteed to be a boolean, or `!!foo` otherwise. return fixer.replaceText(node, isBooleanExpression(node.test) ? astUtils.getParenthesisedText(sourceCode, node.test) : "!" + invertExpression(node.test)); } }); } else if (!defaultAssignment && matchesDefaultAssignment(node)) { context.report({ node: node, loc: node.consequent.loc.start, message: "Unnecessary use of conditional expression for default assignment.", fix: function fix(fixer) { var nodeAlternate = astUtils.getParenthesisedText(sourceCode, node.alternate); if (node.alternate.type === "ConditionalExpression") { var isAlternateParenthesised = astUtils.isParenthesised(sourceCode, node.alternate); nodeAlternate = isAlternateParenthesised ? nodeAlternate : "(" + nodeAlternate + ")"; } return fixer.replaceText(node, astUtils.getParenthesisedText(sourceCode, node.test) + " || " + nodeAlternate); } }); } } }; } }; },{"../ast-utils":67}],262:[function(require,module,exports){ /** * @fileoverview Checks for unreachable code due to return, throws, break, and continue. * @author Joel Feenstra */ "use strict"; //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Checks whether or not a given variable declarator has the initializer. * @param {ASTNode} node - A VariableDeclarator node to check. * @returns {boolean} `true` if the node has the initializer. */ var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } function isInitialized(node) { return Boolean(node.init); } /** * Checks whether or not a given code path segment is unreachable. * @param {CodePathSegment} segment - A CodePathSegment to check. * @returns {boolean} `true` if the segment is unreachable. */ function isUnreachable(segment) { return !segment.reachable; } /** * The class to distinguish consecutive unreachable statements. */ var ConsecutiveRange = function () { function ConsecutiveRange(sourceCode) { _classCallCheck(this, ConsecutiveRange); this.sourceCode = sourceCode; this.startNode = null; this.endNode = null; } /** * The location object of this range. * @type {Object} */ _createClass(ConsecutiveRange, [{ key: "contains", /** * Checks whether the given node is inside of this range. * @param {ASTNode|Token} node - The node to check. * @returns {boolean} `true` if the node is inside of this range. */ value: function contains(node) { return node.range[0] >= this.startNode.range[0] && node.range[1] <= this.endNode.range[1]; } /** * Checks whether the given node is consecutive to this range. * @param {ASTNode} node - The node to check. * @returns {boolean} `true` if the node is consecutive to this range. */ }, { key: "isConsecutive", value: function isConsecutive(node) { return this.contains(this.sourceCode.getTokenBefore(node)); } /** * Merges the given node to this range. * @param {ASTNode} node - The node to merge. * @returns {void} */ }, { key: "merge", value: function merge(node) { this.endNode = node; } /** * Resets this range by the given node or null. * @param {ASTNode|null} node - The node to reset, or null. * @returns {void} */ }, { key: "reset", value: function reset(node) { this.startNode = this.endNode = node; } }, { key: "location", get: function get() { return { start: this.startNode.loc.start, end: this.endNode.loc.end }; } /** * `true` if this range is empty. * @type {boolean} */ }, { key: "isEmpty", get: function get() { return !(this.startNode && this.endNode); } }]); return ConsecutiveRange; }(); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow unreachable code after `return`, `throw`, `continue`, and `break` statements", category: "Possible Errors", recommended: true }, schema: [] }, create: function create(context) { var currentCodePath = null; var range = new ConsecutiveRange(context.getSourceCode()); /** * Reports a given node if it's unreachable. * @param {ASTNode} node - A statement node to report. * @returns {void} */ function reportIfUnreachable(node) { var nextNode = null; if (node && currentCodePath.currentSegments.every(isUnreachable)) { // Store this statement to distinguish consecutive statements. if (range.isEmpty) { range.reset(node); return; } // Skip if this statement is inside of the current range. if (range.contains(node)) { return; } // Merge if this statement is consecutive to the current range. if (range.isConsecutive(node)) { range.merge(node); return; } nextNode = node; } // Report the current range since this statement is reachable or is // not consecutive to the current range. if (!range.isEmpty) { context.report({ message: "Unreachable code.", loc: range.location, node: range.startNode }); } // Update the current range. range.reset(nextNode); } return { // Manages the current code path. onCodePathStart: function onCodePathStart(codePath) { currentCodePath = codePath; }, onCodePathEnd: function onCodePathEnd() { currentCodePath = currentCodePath.upper; }, // Registers for all statement nodes (excludes FunctionDeclaration). BlockStatement: reportIfUnreachable, BreakStatement: reportIfUnreachable, ClassDeclaration: reportIfUnreachable, ContinueStatement: reportIfUnreachable, DebuggerStatement: reportIfUnreachable, DoWhileStatement: reportIfUnreachable, EmptyStatement: reportIfUnreachable, ExpressionStatement: reportIfUnreachable, ForInStatement: reportIfUnreachable, ForOfStatement: reportIfUnreachable, ForStatement: reportIfUnreachable, IfStatement: reportIfUnreachable, ImportDeclaration: reportIfUnreachable, LabeledStatement: reportIfUnreachable, ReturnStatement: reportIfUnreachable, SwitchStatement: reportIfUnreachable, ThrowStatement: reportIfUnreachable, TryStatement: reportIfUnreachable, VariableDeclaration: function VariableDeclaration(node) { if (node.kind !== "var" || node.declarations.some(isInitialized)) { reportIfUnreachable(node); } }, WhileStatement: reportIfUnreachable, WithStatement: reportIfUnreachable, ExportNamedDeclaration: reportIfUnreachable, ExportDefaultDeclaration: reportIfUnreachable, ExportAllDeclaration: reportIfUnreachable, "Program:exit": function ProgramExit() { reportIfUnreachable(); } }; } }; },{}],263:[function(require,module,exports){ /** * @fileoverview Rule to flag unsafe statements in finally block * @author Onur Temizkan */ "use strict"; //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var SENTINEL_NODE_TYPE_RETURN_THROW = /^(?:Program|(?:Function|Class)(?:Declaration|Expression)|ArrowFunctionExpression)$/; var SENTINEL_NODE_TYPE_BREAK = /^(?:Program|(?:Function|Class)(?:Declaration|Expression)|ArrowFunctionExpression|DoWhileStatement|WhileStatement|ForOfStatement|ForInStatement|ForStatement|SwitchStatement)$/; var SENTINEL_NODE_TYPE_CONTINUE = /^(?:Program|(?:Function|Class)(?:Declaration|Expression)|ArrowFunctionExpression|DoWhileStatement|WhileStatement|ForOfStatement|ForInStatement|ForStatement)$/; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow control flow statements in `finally` blocks", category: "Possible Errors", recommended: true }, schema: [] }, create: function create(context) { /** * Checks if the node is the finalizer of a TryStatement * * @param {ASTNode} node - node to check. * @returns {boolean} - true if the node is the finalizer of a TryStatement */ function isFinallyBlock(node) { return node.parent.type === "TryStatement" && node.parent.finalizer === node; } /** * Climbs up the tree if the node is not a sentinel node * * @param {ASTNode} node - node to check. * @param {string} label - label of the break or continue statement * @returns {boolean} - return whether the node is a finally block or a sentinel node */ function isInFinallyBlock(node, label) { var labelInside = false; var sentinelNodeType = void 0; if (node.type === "BreakStatement" && !node.label) { sentinelNodeType = SENTINEL_NODE_TYPE_BREAK; } else if (node.type === "ContinueStatement") { sentinelNodeType = SENTINEL_NODE_TYPE_CONTINUE; } else { sentinelNodeType = SENTINEL_NODE_TYPE_RETURN_THROW; } while (node && !sentinelNodeType.test(node.type)) { if (node.parent.label && label && node.parent.label.name === label.name) { labelInside = true; } if (isFinallyBlock(node)) { if (label && labelInside) { return false; } return true; } node = node.parent; } return false; } /** * Checks whether the possibly-unsafe statement is inside a finally block. * * @param {ASTNode} node - node to check. * @returns {void} */ function check(node) { if (isInFinallyBlock(node, node.label)) { context.report({ message: "Unsafe usage of {{nodeType}}.", data: { nodeType: node.type }, node: node, line: node.loc.line, column: node.loc.column }); } } return { ReturnStatement: check, ThrowStatement: check, BreakStatement: check, ContinueStatement: check }; } }; },{}],264:[function(require,module,exports){ /** * @fileoverview Rule to disallow negating the left operand of relational operators * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Checks whether the given operator is a relational operator or not. * * @param {string} op - The operator type to check. * @returns {boolean} `true` if the operator is a relational operator. */ function isRelationalOperator(op) { return op === "in" || op === "instanceof"; } /** * Checks whether the given node is a logical negation expression or not. * * @param {ASTNode} node - The node to check. * @returns {boolean} `true` if the node is a logical negation expression. */ function isNegation(node) { return node.type === "UnaryExpression" && node.operator === "!"; } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow negating the left operand of relational operators", category: "Possible Errors", recommended: true }, schema: [], fixable: "code" }, create: function create(context) { var sourceCode = context.getSourceCode(); return { BinaryExpression: function BinaryExpression(node) { if (isRelationalOperator(node.operator) && isNegation(node.left) && !astUtils.isParenthesised(sourceCode, node.left)) { context.report({ node: node, loc: node.left.loc, message: "Unexpected negating the left operand of '{{operator}}' operator.", data: node, fix: function fix(fixer) { var negationToken = sourceCode.getFirstToken(node.left); var fixRange = [negationToken.range[1], node.range[1]]; var text = sourceCode.text.slice(fixRange[0], fixRange[1]); return fixer.replaceTextRange(fixRange, "(" + text + ")"); } }); } } }; } }; },{"../ast-utils":67}],265:[function(require,module,exports){ /** * @fileoverview Flag expressions in statement position that do not side effect * @author Michael Ficarra */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow unused expressions", category: "Best Practices", recommended: false }, schema: [{ type: "object", properties: { allowShortCircuit: { type: "boolean" }, allowTernary: { type: "boolean" }, allowTaggedTemplates: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var config = context.options[0] || {}, allowShortCircuit = config.allowShortCircuit || false, allowTernary = config.allowTernary || false, allowTaggedTemplates = config.allowTaggedTemplates || false; /** * @param {ASTNode} node - any node * @returns {boolean} whether the given node structurally represents a directive */ function looksLikeDirective(node) { return node.type === "ExpressionStatement" && node.expression.type === "Literal" && typeof node.expression.value === "string"; } /** * @param {Function} predicate - ([a] -> Boolean) the function used to make the determination * @param {a[]} list - the input list * @returns {a[]} the leading sequence of members in the given list that pass the given predicate */ function takeWhile(predicate, list) { for (var i = 0; i < list.length; ++i) { if (!predicate(list[i])) { return list.slice(0, i); } } return list.slice(); } /** * @param {ASTNode} node - a Program or BlockStatement node * @returns {ASTNode[]} the leading sequence of directive nodes in the given node's body */ function directives(node) { return takeWhile(looksLikeDirective, node.body); } /** * @param {ASTNode} node - any node * @param {ASTNode[]} ancestors - the given node's ancestors * @returns {boolean} whether the given node is considered a directive in its current position */ function isDirective(node, ancestors) { var parent = ancestors[ancestors.length - 1], grandparent = ancestors[ancestors.length - 2]; return (parent.type === "Program" || parent.type === "BlockStatement" && /Function/.test(grandparent.type)) && directives(parent).indexOf(node) >= 0; } /** * Determines whether or not a given node is a valid expression. Recurses on short circuit eval and ternary nodes if enabled by flags. * @param {ASTNode} node - any node * @returns {boolean} whether the given node is a valid expression */ function isValidExpression(node) { if (allowTernary) { // Recursive check for ternary and logical expressions if (node.type === "ConditionalExpression") { return isValidExpression(node.consequent) && isValidExpression(node.alternate); } } if (allowShortCircuit) { if (node.type === "LogicalExpression") { return isValidExpression(node.right); } } if (allowTaggedTemplates && node.type === "TaggedTemplateExpression") { return true; } return (/^(?:Assignment|Call|New|Update|Yield|Await)Expression$/.test(node.type) || node.type === "UnaryExpression" && ["delete", "void"].indexOf(node.operator) >= 0 ); } return { ExpressionStatement: function ExpressionStatement(node) { if (!isValidExpression(node.expression) && !isDirective(node, context.getAncestors())) { context.report({ node: node, message: "Expected an assignment or function call and instead saw an expression." }); } } }; } }; },{}],266:[function(require,module,exports){ /** * @fileoverview Rule to disallow unused labels. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow unused labels", category: "Best Practices", recommended: true }, schema: [], fixable: "code" }, create: function create(context) { var sourceCode = context.getSourceCode(); var scopeInfo = null; /** * Adds a scope info to the stack. * * @param {ASTNode} node - A node to add. This is a LabeledStatement. * @returns {void} */ function enterLabeledScope(node) { scopeInfo = { label: node.label.name, used: false, upper: scopeInfo }; } /** * Removes the top of the stack. * At the same time, this reports the label if it's never used. * * @param {ASTNode} node - A node to report. This is a LabeledStatement. * @returns {void} */ function exitLabeledScope(node) { if (!scopeInfo.used) { context.report({ node: node.label, message: "'{{name}}:' is defined but never used.", data: node.label, fix: function fix(fixer) { /* * Only perform a fix if there are no comments between the label and the body. This will be the case * when there is exactly one token/comment (the ":") between the label and the body. */ if (sourceCode.getTokenAfter(node.label, { includeComments: true }) === sourceCode.getTokenBefore(node.body, { includeComments: true })) { return fixer.removeRange([node.range[0], node.body.range[0]]); } return null; } }); } scopeInfo = scopeInfo.upper; } /** * Marks the label of a given node as used. * * @param {ASTNode} node - A node to mark. This is a BreakStatement or * ContinueStatement. * @returns {void} */ function markAsUsed(node) { if (!node.label) { return; } var label = node.label.name; var info = scopeInfo; while (info) { if (info.label === label) { info.used = true; break; } info = info.upper; } } return { LabeledStatement: enterLabeledScope, "LabeledStatement:exit": exitLabeledScope, BreakStatement: markAsUsed, ContinueStatement: markAsUsed }; } }; },{}],267:[function(require,module,exports){ /** * @fileoverview Rule to flag declared but unused variables * @author Ilya Volodin */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var lodash = require("lodash"); var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow unused variables", category: "Variables", recommended: true }, schema: [{ oneOf: [{ enum: ["all", "local"] }, { type: "object", properties: { vars: { enum: ["all", "local"] }, varsIgnorePattern: { type: "string" }, args: { enum: ["all", "after-used", "none"] }, ignoreRestSiblings: { type: "boolean" }, argsIgnorePattern: { type: "string" }, caughtErrors: { enum: ["all", "none"] }, caughtErrorsIgnorePattern: { type: "string" } } }] }] }, create: function create(context) { var sourceCode = context.getSourceCode(); var DEFINED_MESSAGE = "'{{name}}' is defined but never used."; var ASSIGNED_MESSAGE = "'{{name}}' is assigned a value but never used."; var REST_PROPERTY_TYPE = /^(?:Experimental)?RestProperty$/; var config = { vars: "all", args: "after-used", ignoreRestSiblings: false, caughtErrors: "none" }; var firstOption = context.options[0]; if (firstOption) { if (typeof firstOption === "string") { config.vars = firstOption; } else { config.vars = firstOption.vars || config.vars; config.args = firstOption.args || config.args; config.ignoreRestSiblings = firstOption.ignoreRestSiblings || config.ignoreRestSiblings; config.caughtErrors = firstOption.caughtErrors || config.caughtErrors; if (firstOption.varsIgnorePattern) { config.varsIgnorePattern = new RegExp(firstOption.varsIgnorePattern); } if (firstOption.argsIgnorePattern) { config.argsIgnorePattern = new RegExp(firstOption.argsIgnorePattern); } if (firstOption.caughtErrorsIgnorePattern) { config.caughtErrorsIgnorePattern = new RegExp(firstOption.caughtErrorsIgnorePattern); } } } //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- var STATEMENT_TYPE = /(?:Statement|Declaration)$/; /** * Determines if a given variable is being exported from a module. * @param {Variable} variable - eslint-scope variable object. * @returns {boolean} True if the variable is exported, false if not. * @private */ function isExported(variable) { var definition = variable.defs[0]; if (definition) { var node = definition.node; if (node.type === "VariableDeclarator") { node = node.parent; } else if (definition.type === "Parameter") { return false; } return node.parent.type.indexOf("Export") === 0; } return false; } /** * Determines if a variable has a sibling rest property * @param {Variable} variable - eslint-scope variable object. * @returns {boolean} True if the variable is exported, false if not. * @private */ function hasRestSpreadSibling(variable) { if (config.ignoreRestSiblings) { return variable.defs.some(function (def) { var propertyNode = def.name.parent; var patternNode = propertyNode.parent; return propertyNode.type === "Property" && patternNode.type === "ObjectPattern" && REST_PROPERTY_TYPE.test(patternNode.properties[patternNode.properties.length - 1].type); }); } return false; } /** * Determines if a reference is a read operation. * @param {Reference} ref - An eslint-scope Reference * @returns {boolean} whether the given reference represents a read operation * @private */ function isReadRef(ref) { return ref.isRead(); } /** * Determine if an identifier is referencing an enclosing function name. * @param {Reference} ref - The reference to check. * @param {ASTNode[]} nodes - The candidate function nodes. * @returns {boolean} True if it's a self-reference, false if not. * @private */ function isSelfReference(ref, nodes) { var scope = ref.from; while (scope) { if (nodes.indexOf(scope.block) >= 0) { return true; } scope = scope.upper; } return false; } /** * Checks the position of given nodes. * * @param {ASTNode} inner - A node which is expected as inside. * @param {ASTNode} outer - A node which is expected as outside. * @returns {boolean} `true` if the `inner` node exists in the `outer` node. * @private */ function isInside(inner, outer) { return inner.range[0] >= outer.range[0] && inner.range[1] <= outer.range[1]; } /** * If a given reference is left-hand side of an assignment, this gets * the right-hand side node of the assignment. * * In the following cases, this returns null. * * - The reference is not the LHS of an assignment expression. * - The reference is inside of a loop. * - The reference is inside of a function scope which is different from * the declaration. * * @param {eslint-scope.Reference} ref - A reference to check. * @param {ASTNode} prevRhsNode - The previous RHS node. * @returns {ASTNode|null} The RHS node or null. * @private */ function getRhsNode(ref, prevRhsNode) { var id = ref.identifier; var parent = id.parent; var granpa = parent.parent; var refScope = ref.from.variableScope; var varScope = ref.resolved.scope.variableScope; var canBeUsedLater = refScope !== varScope || astUtils.isInLoop(id); /* * Inherits the previous node if this reference is in the node. * This is for `a = a + a`-like code. */ if (prevRhsNode && isInside(id, prevRhsNode)) { return prevRhsNode; } if (parent.type === "AssignmentExpression" && granpa.type === "ExpressionStatement" && id === parent.left && !canBeUsedLater) { return parent.right; } return null; } /** * Checks whether a given function node is stored to somewhere or not. * If the function node is stored, the function can be used later. * * @param {ASTNode} funcNode - A function node to check. * @param {ASTNode} rhsNode - The RHS node of the previous assignment. * @returns {boolean} `true` if under the following conditions: * - the funcNode is assigned to a variable. * - the funcNode is bound as an argument of a function call. * - the function is bound to a property and the object satisfies above conditions. * @private */ function isStorableFunction(funcNode, rhsNode) { var node = funcNode; var parent = funcNode.parent; while (parent && isInside(parent, rhsNode)) { switch (parent.type) { case "SequenceExpression": if (parent.expressions[parent.expressions.length - 1] !== node) { return false; } break; case "CallExpression": case "NewExpression": return parent.callee !== node; case "AssignmentExpression": case "TaggedTemplateExpression": case "YieldExpression": return true; default: if (STATEMENT_TYPE.test(parent.type)) { /* * If it encountered statements, this is a complex pattern. * Since analyzeing complex patterns is hard, this returns `true` to avoid false positive. */ return true; } } node = parent; parent = parent.parent; } return false; } /** * Checks whether a given Identifier node exists inside of a function node which can be used later. * * "can be used later" means: * - the function is assigned to a variable. * - the function is bound to a property and the object can be used later. * - the function is bound as an argument of a function call. * * If a reference exists in a function which can be used later, the reference is read when the function is called. * * @param {ASTNode} id - An Identifier node to check. * @param {ASTNode} rhsNode - The RHS node of the previous assignment. * @returns {boolean} `true` if the `id` node exists inside of a function node which can be used later. * @private */ function isInsideOfStorableFunction(id, rhsNode) { var funcNode = astUtils.getUpperFunction(id); return funcNode && isInside(funcNode, rhsNode) && isStorableFunction(funcNode, rhsNode); } /** * Checks whether a given reference is a read to update itself or not. * * @param {eslint-scope.Reference} ref - A reference to check. * @param {ASTNode} rhsNode - The RHS node of the previous assignment. * @returns {boolean} The reference is a read to update itself. * @private */ function isReadForItself(ref, rhsNode) { var id = ref.identifier; var parent = id.parent; var granpa = parent.parent; return ref.isRead() && ( // self update. e.g. `a += 1`, `a++` parent.type === "AssignmentExpression" && granpa.type === "ExpressionStatement" && parent.left === id || parent.type === "UpdateExpression" && granpa.type === "ExpressionStatement" || // in RHS of an assignment for itself. e.g. `a = a + 1` rhsNode && isInside(id, rhsNode) && !isInsideOfStorableFunction(id, rhsNode)); } /** * Determine if an identifier is used either in for-in loops. * * @param {Reference} ref - The reference to check. * @returns {boolean} whether reference is used in the for-in loops * @private */ function isForInRef(ref) { var target = ref.identifier.parent; // "for (var ...) { return; }" if (target.type === "VariableDeclarator") { target = target.parent.parent; } if (target.type !== "ForInStatement") { return false; } // "for (...) { return; }" if (target.body.type === "BlockStatement") { target = target.body.body[0]; // "for (...) return;" } else { target = target.body; } // For empty loop body if (!target) { return false; } return target.type === "ReturnStatement"; } /** * Determines if the variable is used. * @param {Variable} variable - The variable to check. * @returns {boolean} True if the variable is used * @private */ function isUsedVariable(variable) { var functionNodes = variable.defs.filter(function (def) { return def.type === "FunctionName"; }).map(function (def) { return def.node; }), isFunctionDefinition = functionNodes.length > 0; var rhsNode = null; return variable.references.some(function (ref) { if (isForInRef(ref)) { return true; } var forItself = isReadForItself(ref, rhsNode); rhsNode = getRhsNode(ref, rhsNode); return isReadRef(ref) && !forItself && !(isFunctionDefinition && isSelfReference(ref, functionNodes)); }); } /** * Checks whether the given variable is the last parameter in the non-ignored parameters. * * @param {eslint-scope.Variable} variable - The variable to check. * @returns {boolean} `true` if the variable is the last. */ function isLastInNonIgnoredParameters(variable) { var def = variable.defs[0]; // This is the last. if (def.index === def.node.params.length - 1) { return true; } // if all parameters preceded by this variable are ignored and unused, this is the last. if (config.argsIgnorePattern) { var params = context.getDeclaredVariables(def.node); var posteriorParams = params.slice(params.indexOf(variable) + 1); if (posteriorParams.every(function (v) { return v.references.length === 0 && config.argsIgnorePattern.test(v.name); })) { return true; } } return false; } /** * Gets an array of variables without read references. * @param {Scope} scope - an eslint-scope Scope object. * @param {Variable[]} unusedVars - an array that saving result. * @returns {Variable[]} unused variables of the scope and descendant scopes. * @private */ function collectUnusedVariables(scope, unusedVars) { var variables = scope.variables; var childScopes = scope.childScopes; var i = void 0, l = void 0; if (scope.type !== "TDZ" && (scope.type !== "global" || config.vars === "all")) { for (i = 0, l = variables.length; i < l; ++i) { var variable = variables[i]; // skip a variable of class itself name in the class scope if (scope.type === "class" && scope.block.id === variable.identifiers[0]) { continue; } // skip function expression names and variables marked with markVariableAsUsed() if (scope.functionExpressionScope || variable.eslintUsed) { continue; } // skip implicit "arguments" variable if (scope.type === "function" && variable.name === "arguments" && variable.identifiers.length === 0) { continue; } // explicit global variables don't have definitions. var def = variable.defs[0]; if (def) { var type = def.type; // skip catch variables if (type === "CatchClause") { if (config.caughtErrors === "none") { continue; } // skip ignored parameters if (config.caughtErrorsIgnorePattern && config.caughtErrorsIgnorePattern.test(def.name.name)) { continue; } } if (type === "Parameter") { // skip any setter argument if ((def.node.parent.type === "Property" || def.node.parent.type === "MethodDefinition") && def.node.parent.kind === "set") { continue; } // if "args" option is "none", skip any parameter if (config.args === "none") { continue; } // skip ignored parameters if (config.argsIgnorePattern && config.argsIgnorePattern.test(def.name.name)) { continue; } // if "args" option is "after-used", skip all but the last parameter if (config.args === "after-used" && astUtils.isFunction(def.name.parent) && !isLastInNonIgnoredParameters(variable)) { continue; } } else { // skip ignored variables if (config.varsIgnorePattern && config.varsIgnorePattern.test(def.name.name)) { continue; } } } if (!isUsedVariable(variable) && !isExported(variable) && !hasRestSpreadSibling(variable)) { unusedVars.push(variable); } } } for (i = 0, l = childScopes.length; i < l; ++i) { collectUnusedVariables(childScopes[i], unusedVars); } return unusedVars; } /** * Gets the index of a given variable name in a given comment. * @param {eslint-scope.Variable} variable - A variable to get. * @param {ASTNode} comment - A comment node which includes the variable name. * @returns {number} The index of the variable name's location. * @private */ function getColumnInComment(variable, comment) { var namePattern = new RegExp("[\\s,]" + lodash.escapeRegExp(variable.name) + "(?:$|[\\s,:])", "g"); // To ignore the first text "global". namePattern.lastIndex = comment.value.indexOf("global") + 6; // Search a given variable name. var match = namePattern.exec(comment.value); return match ? match.index + 1 : 0; } /** * Creates the correct location of a given variables. * The location is at its name string in a `/*global` comment. * * @param {eslint-scope.Variable} variable - A variable to get its location. * @returns {{line: number, column: number}} The location object for the variable. * @private */ function getLocation(variable) { var comment = variable.eslintExplicitGlobalComment; return sourceCode.getLocFromIndex(comment.range[0] + 2 + getColumnInComment(variable, comment)); } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { "Program:exit": function ProgramExit(programNode) { var unusedVars = collectUnusedVariables(context.getScope(), []); for (var i = 0, l = unusedVars.length; i < l; ++i) { var unusedVar = unusedVars[i]; if (unusedVar.eslintExplicitGlobal) { context.report({ node: programNode, loc: getLocation(unusedVar), message: DEFINED_MESSAGE, data: unusedVar }); } else if (unusedVar.defs.length > 0) { context.report({ node: unusedVar.identifiers[0], message: unusedVar.references.some(function (ref) { return ref.isWrite(); }) ? ASSIGNED_MESSAGE : DEFINED_MESSAGE, data: unusedVar }); } } } }; } }; },{"../ast-utils":67,"lodash":48}],268:[function(require,module,exports){ /** * @fileoverview Rule to flag use of variables before they are defined * @author Ilya Volodin */ "use strict"; //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; var SENTINEL_TYPE = /^(?:(?:Function|Class)(?:Declaration|Expression)|ArrowFunctionExpression|CatchClause|ImportDeclaration|ExportNamedDeclaration)$/; var FOR_IN_OF_TYPE = /^For(?:In|Of)Statement$/; /** * Parses a given value as options. * * @param {any} options - A value to parse. * @returns {Object} The parsed options. */ function parseOptions(options) { var functions = true; var classes = true; var variables = true; if (typeof options === "string") { functions = options !== "nofunc"; } else if ((typeof options === "undefined" ? "undefined" : _typeof(options)) === "object" && options !== null) { functions = options.functions !== false; classes = options.classes !== false; variables = options.variables !== false; } return { functions: functions, classes: classes, variables: variables }; } /** * Checks whether or not a given variable is a function declaration. * * @param {eslint-scope.Variable} variable - A variable to check. * @returns {boolean} `true` if the variable is a function declaration. */ function isFunction(variable) { return variable.defs[0].type === "FunctionName"; } /** * Checks whether or not a given variable is a class declaration in an upper function scope. * * @param {eslint-scope.Variable} variable - A variable to check. * @param {eslint-scope.Reference} reference - A reference to check. * @returns {boolean} `true` if the variable is a class declaration. */ function isOuterClass(variable, reference) { return variable.defs[0].type === "ClassName" && variable.scope.variableScope !== reference.from.variableScope; } /** * Checks whether or not a given variable is a variable declaration in an upper function scope. * @param {eslint-scope.Variable} variable - A variable to check. * @param {eslint-scope.Reference} reference - A reference to check. * @returns {boolean} `true` if the variable is a variable declaration. */ function isOuterVariable(variable, reference) { return variable.defs[0].type === "Variable" && variable.scope.variableScope !== reference.from.variableScope; } /** * Checks whether or not a given location is inside of the range of a given node. * * @param {ASTNode} node - An node to check. * @param {number} location - A location to check. * @returns {boolean} `true` if the location is inside of the range of the node. */ function isInRange(node, location) { return node && node.range[0] <= location && location <= node.range[1]; } /** * Checks whether or not a given reference is inside of the initializers of a given variable. * * This returns `true` in the following cases: * * var a = a * var [a = a] = list * var {a = a} = obj * for (var a in a) {} * for (var a of a) {} * * @param {Variable} variable - A variable to check. * @param {Reference} reference - A reference to check. * @returns {boolean} `true` if the reference is inside of the initializers. */ function isInInitializer(variable, reference) { if (variable.scope !== reference.from) { return false; } var node = variable.identifiers[0].parent; var location = reference.identifier.range[1]; while (node) { if (node.type === "VariableDeclarator") { if (isInRange(node.init, location)) { return true; } if (FOR_IN_OF_TYPE.test(node.parent.parent.type) && isInRange(node.parent.parent.right, location)) { return true; } break; } else if (node.type === "AssignmentPattern") { if (isInRange(node.right, location)) { return true; } } else if (SENTINEL_TYPE.test(node.type)) { break; } node = node.parent; } return false; } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow the use of variables before they are defined", category: "Variables", recommended: false }, schema: [{ oneOf: [{ enum: ["nofunc"] }, { type: "object", properties: { functions: { type: "boolean" }, classes: { type: "boolean" }, variables: { type: "boolean" } }, additionalProperties: false }] }] }, create: function create(context) { var options = parseOptions(context.options[0]); /** * Determines whether a given use-before-define case should be reported according to the options. * @param {eslint-scope.Variable} variable The variable that gets used before being defined * @param {eslint-scope.Reference} reference The reference to the variable * @returns {boolean} `true` if the usage should be reported */ function isForbidden(variable, reference) { if (isFunction(variable)) { return options.functions; } if (isOuterClass(variable, reference)) { return options.classes; } if (isOuterVariable(variable, reference)) { return options.variables; } return true; } /** * Finds and validates all variables in a given scope. * @param {Scope} scope The scope object. * @returns {void} * @private */ function findVariablesInScope(scope) { scope.references.forEach(function (reference) { var variable = reference.resolved; // Skips when the reference is: // - initialization's. // - referring to an undefined variable. // - referring to a global environment variable (there're no identifiers). // - located preceded by the variable (except in initializers). // - allowed by options. if (reference.init || !variable || variable.identifiers.length === 0 || variable.identifiers[0].range[1] < reference.identifier.range[1] && !isInInitializer(variable, reference) || !isForbidden(variable, reference)) { return; } // Reports. context.report({ node: reference.identifier, message: "'{{name}}' was used before it was defined.", data: reference.identifier }); }); } /** * Validates variables inside of a node's scope. * @param {ASTNode} node The node to check. * @returns {void} * @private */ function findVariables() { var scope = context.getScope(); findVariablesInScope(scope); } var ruleDefinition = { "Program:exit": function ProgramExit(node) { var scope = context.getScope(), ecmaFeatures = context.parserOptions.ecmaFeatures || {}; findVariablesInScope(scope); // both Node.js and Modules have an extra scope if (ecmaFeatures.globalReturn || node.sourceType === "module") { findVariablesInScope(scope.childScopes[0]); } } }; if (context.parserOptions.ecmaVersion >= 6) { ruleDefinition["BlockStatement:exit"] = ruleDefinition["SwitchStatement:exit"] = findVariables; ruleDefinition["ArrowFunctionExpression:exit"] = function (node) { if (node.body.type !== "BlockStatement") { findVariables(); } }; } else { ruleDefinition["FunctionExpression:exit"] = ruleDefinition["FunctionDeclaration:exit"] = ruleDefinition["ArrowFunctionExpression:exit"] = findVariables; } return ruleDefinition; } }; },{}],269:[function(require,module,exports){ /** * @fileoverview A rule to disallow unnecessary `.call()` and `.apply()`. * @author Toru Nagashima */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Checks whether or not a node is a `.call()`/`.apply()`. * @param {ASTNode} node - A CallExpression node to check. * @returns {boolean} Whether or not the node is a `.call()`/`.apply()`. */ function isCallOrNonVariadicApply(node) { return node.callee.type === "MemberExpression" && node.callee.property.type === "Identifier" && node.callee.computed === false && (node.callee.property.name === "call" && node.arguments.length >= 1 || node.callee.property.name === "apply" && node.arguments.length === 2 && node.arguments[1].type === "ArrayExpression"); } /** * Checks whether or not the tokens of two given nodes are same. * @param {ASTNode} left - A node 1 to compare. * @param {ASTNode} right - A node 2 to compare. * @param {SourceCode} sourceCode - The ESLint source code object. * @returns {boolean} the source code for the given node. */ function equalTokens(left, right, sourceCode) { var tokensL = sourceCode.getTokens(left); var tokensR = sourceCode.getTokens(right); if (tokensL.length !== tokensR.length) { return false; } for (var i = 0; i < tokensL.length; ++i) { if (tokensL[i].type !== tokensR[i].type || tokensL[i].value !== tokensR[i].value) { return false; } } return true; } /** * Checks whether or not `thisArg` is not changed by `.call()`/`.apply()`. * @param {ASTNode|null} expectedThis - The node that is the owner of the applied function. * @param {ASTNode} thisArg - The node that is given to the first argument of the `.call()`/`.apply()`. * @param {SourceCode} sourceCode - The ESLint source code object. * @returns {boolean} Whether or not `thisArg` is not changed by `.call()`/`.apply()`. */ function isValidThisArg(expectedThis, thisArg, sourceCode) { if (!expectedThis) { return astUtils.isNullOrUndefined(thisArg); } return equalTokens(expectedThis, thisArg, sourceCode); } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow unnecessary calls to `.call()` and `.apply()`", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { var sourceCode = context.getSourceCode(); return { CallExpression: function CallExpression(node) { if (!isCallOrNonVariadicApply(node)) { return; } var applied = node.callee.object; var expectedThis = applied.type === "MemberExpression" ? applied.object : null; var thisArg = node.arguments[0]; if (isValidThisArg(expectedThis, thisArg, sourceCode)) { context.report({ node: node, message: "unnecessary '.{{name}}()'.", data: { name: node.callee.property.name } }); } } }; } }; },{"../ast-utils":67}],270:[function(require,module,exports){ /** * @fileoverview Rule to disallow unnecessary computed property keys in object literals * @author Burak Yigit Kaya */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ var MESSAGE_UNNECESSARY_COMPUTED = "Unnecessarily computed property [{{property}}] found."; module.exports = { meta: { docs: { description: "disallow unnecessary computed property keys in object literals", category: "ECMAScript 6", recommended: false }, schema: [], fixable: "code" }, create: function create(context) { var sourceCode = context.getSourceCode(); return { Property: function Property(node) { if (!node.computed) { return; } var key = node.key, nodeType = _typeof(key.value); if (key.type === "Literal" && (nodeType === "string" || nodeType === "number") && key.value !== "__proto__") { context.report({ node: node, message: MESSAGE_UNNECESSARY_COMPUTED, data: { property: sourceCode.getText(key) }, fix: function fix(fixer) { var leftSquareBracket = sourceCode.getFirstToken(node, astUtils.isOpeningBracketToken); var rightSquareBracket = sourceCode.getFirstTokenBetween(node.key, node.value, astUtils.isClosingBracketToken); var tokensBetween = sourceCode.getTokensBetween(leftSquareBracket, rightSquareBracket, 1); if (tokensBetween.slice(0, -1).some(function (token, index) { return sourceCode.getText().slice(token.range[1], tokensBetween[index + 1].range[0]).trim(); })) { // If there are comments between the brackets and the property name, don't do a fix. return null; } var tokenBeforeLeftBracket = sourceCode.getTokenBefore(leftSquareBracket); // Insert a space before the key to avoid changing identifiers, e.g. ({ get[2]() {} }) to ({ get2() {} }) var needsSpaceBeforeKey = tokenBeforeLeftBracket.range[1] === leftSquareBracket.range[0] && !astUtils.canTokensBeAdjacent(tokenBeforeLeftBracket, sourceCode.getFirstToken(key)); var replacementKey = (needsSpaceBeforeKey ? " " : "") + key.raw; return fixer.replaceTextRange([leftSquareBracket.range[0], rightSquareBracket.range[1]], replacementKey); } }); } } }; } }; },{"../ast-utils":67}],271:[function(require,module,exports){ /** * @fileoverview disallow unncessary concatenation of template strings * @author Henry Zhu */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Checks whether or not a given node is a concatenation. * @param {ASTNode} node - A node to check. * @returns {boolean} `true` if the node is a concatenation. */ function isConcatenation(node) { return node.type === "BinaryExpression" && node.operator === "+"; } /** * Checks if the given token is a `+` token or not. * @param {Token} token - The token to check. * @returns {boolean} `true` if the token is a `+` token. */ function isConcatOperatorToken(token) { return token.value === "+" && token.type === "Punctuator"; } /** * Get's the right most node on the left side of a BinaryExpression with + operator. * @param {ASTNode} node - A BinaryExpression node to check. * @returns {ASTNode} node */ function getLeft(node) { var left = node.left; while (isConcatenation(left)) { left = left.right; } return left; } /** * Get's the left most node on the right side of a BinaryExpression with + operator. * @param {ASTNode} node - A BinaryExpression node to check. * @returns {ASTNode} node */ function getRight(node) { var right = node.right; while (isConcatenation(right)) { right = right.left; } return right; } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow unnecessary concatenation of literals or template literals", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { var sourceCode = context.getSourceCode(); return { BinaryExpression: function BinaryExpression(node) { // check if not concatenation if (node.operator !== "+") { return; } // account for the `foo + "a" + "b"` case var left = getLeft(node); var right = getRight(node); if (astUtils.isStringLiteral(left) && astUtils.isStringLiteral(right) && astUtils.isTokenOnSameLine(left, right)) { var operatorToken = sourceCode.getFirstTokenBetween(left, right, isConcatOperatorToken); context.report({ node: node, loc: operatorToken.loc.start, message: "Unexpected string concatenation of literals." }); } } }; } }; },{"../ast-utils":67}],272:[function(require,module,exports){ /** * @fileoverview Rule to flag the use of redundant constructors in classes. * @author Alberto Rodríguez */ "use strict"; //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Checks whether a given array of statements is a single call of `super`. * * @param {ASTNode[]} body - An array of statements to check. * @returns {boolean} `true` if the body is a single call of `super`. */ function isSingleSuperCall(body) { return body.length === 1 && body[0].type === "ExpressionStatement" && body[0].expression.type === "CallExpression" && body[0].expression.callee.type === "Super"; } /** * Checks whether a given node is a pattern which doesn't have any side effects. * Default parameters and Destructuring parameters can have side effects. * * @param {ASTNode} node - A pattern node. * @returns {boolean} `true` if the node doesn't have any side effects. */ function isSimple(node) { return node.type === "Identifier" || node.type === "RestElement"; } /** * Checks whether a given array of expressions is `...arguments` or not. * `super(...arguments)` passes all arguments through. * * @param {ASTNode[]} superArgs - An array of expressions to check. * @returns {boolean} `true` if the superArgs is `...arguments`. */ function isSpreadArguments(superArgs) { return superArgs.length === 1 && superArgs[0].type === "SpreadElement" && superArgs[0].argument.type === "Identifier" && superArgs[0].argument.name === "arguments"; } /** * Checks whether given 2 nodes are identifiers which have the same name or not. * * @param {ASTNode} ctorParam - A node to check. * @param {ASTNode} superArg - A node to check. * @returns {boolean} `true` if the nodes are identifiers which have the same * name. */ function isValidIdentifierPair(ctorParam, superArg) { return ctorParam.type === "Identifier" && superArg.type === "Identifier" && ctorParam.name === superArg.name; } /** * Checks whether given 2 nodes are a rest/spread pair which has the same values. * * @param {ASTNode} ctorParam - A node to check. * @param {ASTNode} superArg - A node to check. * @returns {boolean} `true` if the nodes are a rest/spread pair which has the * same values. */ function isValidRestSpreadPair(ctorParam, superArg) { return ctorParam.type === "RestElement" && superArg.type === "SpreadElement" && isValidIdentifierPair(ctorParam.argument, superArg.argument); } /** * Checks whether given 2 nodes have the same value or not. * * @param {ASTNode} ctorParam - A node to check. * @param {ASTNode} superArg - A node to check. * @returns {boolean} `true` if the nodes have the same value or not. */ function isValidPair(ctorParam, superArg) { return isValidIdentifierPair(ctorParam, superArg) || isValidRestSpreadPair(ctorParam, superArg); } /** * Checks whether the parameters of a constructor and the arguments of `super()` * have the same values or not. * * @param {ASTNode} ctorParams - The parameters of a constructor to check. * @param {ASTNode} superArgs - The arguments of `super()` to check. * @returns {boolean} `true` if those have the same values. */ function isPassingThrough(ctorParams, superArgs) { if (ctorParams.length !== superArgs.length) { return false; } for (var i = 0; i < ctorParams.length; ++i) { if (!isValidPair(ctorParams[i], superArgs[i])) { return false; } } return true; } /** * Checks whether the constructor body is a redundant super call. * * @param {Array} body - constructor body content. * @param {Array} ctorParams - The params to check against super call. * @returns {boolean} true if the construtor body is redundant */ function isRedundantSuperCall(body, ctorParams) { return isSingleSuperCall(body) && ctorParams.every(isSimple) && (isSpreadArguments(body[0].expression.arguments) || isPassingThrough(ctorParams, body[0].expression.arguments)); } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow unnecessary constructors", category: "ECMAScript 6", recommended: false }, schema: [] }, create: function create(context) { /** * Checks whether a node is a redundant constructor * @param {ASTNode} node - node to check * @returns {void} */ function checkForConstructor(node) { if (node.kind !== "constructor") { return; } var body = node.value.body.body; var ctorParams = node.value.params; var superClass = node.parent.parent.superClass; if (superClass ? isRedundantSuperCall(body, ctorParams) : body.length === 0) { context.report({ node: node, message: "Useless constructor." }); } } return { MethodDefinition: checkForConstructor }; } }; },{}],273:[function(require,module,exports){ /** * @fileoverview Look for useless escapes in strings and regexes * @author Onur Temizkan */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ /** * Returns the union of two sets. * @param {Set} setA The first set * @param {Set} setB The second set * @returns {Set} The union of the two sets */ function union(setA, setB) { return new Set(regeneratorRuntime.mark(function _callee() { return regeneratorRuntime.wrap(function _callee$(_context) { while (1) { switch (_context.prev = _context.next) { case 0: return _context.delegateYield(setA, "t0", 1); case 1: return _context.delegateYield(setB, "t1", 2); case 2: case "end": return _context.stop(); } } }, _callee, this); })()); } var VALID_STRING_ESCAPES = union(new Set("\\nrvtbfux"), astUtils.LINEBREAKS); var REGEX_GENERAL_ESCAPES = new Set("\\bcdDfnrsStvwWxu0123456789]"); var REGEX_NON_CHARCLASS_ESCAPES = union(REGEX_GENERAL_ESCAPES, new Set("^/.$*+?[{}|()B")); /** * Parses a regular expression into a list of characters with character class info. * @param {string} regExpText The raw text used to create the regular expression * @returns {Object[]} A list of characters, each with info on escaping and whether they're in a character class. * @example * * parseRegExp('a\\b[cd-]') * * returns: * [ * {text: 'a', index: 0, escaped: false, inCharClass: false, startsCharClass: false, endsCharClass: false}, * {text: 'b', index: 2, escaped: true, inCharClass: false, startsCharClass: false, endsCharClass: false}, * {text: 'c', index: 4, escaped: false, inCharClass: true, startsCharClass: true, endsCharClass: false}, * {text: 'd', index: 5, escaped: false, inCharClass: true, startsCharClass: false, endsCharClass: false}, * {text: '-', index: 6, escaped: false, inCharClass: true, startsCharClass: false, endsCharClass: false} * ] */ function parseRegExp(regExpText) { var charList = []; regExpText.split("").reduce(function (state, char, index) { if (!state.escapeNextChar) { if (char === "\\") { return Object.assign(state, { escapeNextChar: true }); } if (char === "[" && !state.inCharClass) { return Object.assign(state, { inCharClass: true, startingCharClass: true }); } if (char === "]" && state.inCharClass) { if (charList.length && charList[charList.length - 1].inCharClass) { charList[charList.length - 1].endsCharClass = true; } return Object.assign(state, { inCharClass: false, startingCharClass: false }); } } charList.push({ text: char, index: index, escaped: state.escapeNextChar, inCharClass: state.inCharClass, startsCharClass: state.startingCharClass, endsCharClass: false }); return Object.assign(state, { escapeNextChar: false, startingCharClass: false }); }, { escapeNextChar: false, inCharClass: false, startingCharClass: false }); return charList; } module.exports = { meta: { docs: { description: "disallow unnecessary escape characters", category: "Best Practices", recommended: true }, schema: [] }, create: function create(context) { var sourceCode = context.getSourceCode(); /** * Reports a node * @param {ASTNode} node The node to report * @param {number} startOffset The backslash's offset from the start of the node * @param {string} character The uselessly escaped character (not including the backslash) * @returns {void} */ function report(node, startOffset, character) { context.report({ node: node, loc: sourceCode.getLocFromIndex(sourceCode.getIndexFromLoc(node.loc.start) + startOffset), message: "Unnecessary escape character: \\{{character}}.", data: { character: character } }); } /** * Checks if the escape character in given string slice is unnecessary. * * @private * @param {ASTNode} node - node to validate. * @param {string} match - string slice to validate. * @returns {void} */ function validateString(node, match) { var isTemplateElement = node.type === "TemplateElement"; var escapedChar = match[0][1]; var isUnnecessaryEscape = !VALID_STRING_ESCAPES.has(escapedChar); var isQuoteEscape = void 0; if (isTemplateElement) { isQuoteEscape = escapedChar === "`"; if (escapedChar === "$") { // Warn if `\$` is not followed by `{` isUnnecessaryEscape = match.input[match.index + 2] !== "{"; } else if (escapedChar === "{") { /* Warn if `\{` is not preceded by `$`. If preceded by `$`, escaping * is necessary and the rule should not warn. If preceded by `/$`, the rule * will warn for the `/$` instead, as it is the first unnecessarily escaped character. */ isUnnecessaryEscape = match.input[match.index - 1] !== "$"; } } else { isQuoteEscape = escapedChar === node.raw[0]; } if (isUnnecessaryEscape && !isQuoteEscape) { report(node, match.index + 1, match[0].slice(1)); } } /** * Checks if a node has an escape. * * @param {ASTNode} node - node to check. * @returns {void} */ function check(node) { var isTemplateElement = node.type === "TemplateElement"; if (isTemplateElement && node.parent && node.parent.parent && node.parent.parent.type === "TaggedTemplateExpression" && node.parent === node.parent.parent.quasi) { // Don't report tagged template literals, because the backslash character is accessible to the tag function. return; } if (typeof node.value === "string" || isTemplateElement) { /* * JSXAttribute doesn't have any escape sequence: https://facebook.github.io/jsx/. * In addition, backticks are not supported by JSX yet: https://github.com/facebook/jsx/issues/25. */ if (node.parent.type === "JSXAttribute" || node.parent.type === "JSXElement") { return; } var value = isTemplateElement ? node.value.raw : node.raw.slice(1, -1); var pattern = /\\[^\d]/g; var match = void 0; while (match = pattern.exec(value)) { validateString(node, match); } } else if (node.regex) { parseRegExp(node.regex.pattern /* * The '-' character is a special case, because it's only valid to escape it if it's in a character * class, and is not at either edge of the character class. To account for this, don't consider '-' * characters to be valid in general, and filter out '-' characters that appear in the middle of a * character class. */ ).filter(function (charInfo) { return !(charInfo.text === "-" && charInfo.inCharClass && !charInfo.startsCharClass && !charInfo.endsCharClass); } /* * The '^' character is also a special case; it must always be escaped outside of character classes, but * it only needs to be escaped in character classes if it's at the beginning of the character class. To * account for this, consider it to be a valid escape character outside of character classes, and filter * out '^' characters that appear at the start of a character class. */ ).filter(function (charInfo) { return !(charInfo.text === "^" && charInfo.startsCharClass); } // Filter out characters that aren't escaped. ).filter(function (charInfo) { return charInfo.escaped; } // Filter out characters that are valid to escape, based on their position in the regular expression. ).filter(function (charInfo) { return !(charInfo.inCharClass ? REGEX_GENERAL_ESCAPES : REGEX_NON_CHARCLASS_ESCAPES).has(charInfo.text); } // Report all the remaining characters. ).forEach(function (charInfo) { return report(node, charInfo.index, charInfo.text); }); } } return { Literal: check, TemplateElement: check }; } }; },{"../ast-utils":67}],274:[function(require,module,exports){ /** * @fileoverview Disallow renaming import, export, and destructured assignments to the same name. * @author Kai Cataldo */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow renaming import, export, and destructured assignments to the same name", category: "ECMAScript 6", recommended: false }, fixable: "code", schema: [{ type: "object", properties: { ignoreDestructuring: { type: "boolean" }, ignoreImport: { type: "boolean" }, ignoreExport: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var options = context.options[0] || {}, ignoreDestructuring = options.ignoreDestructuring === true, ignoreImport = options.ignoreImport === true, ignoreExport = options.ignoreExport === true; //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Reports error for unnecessarily renamed assignments * @param {ASTNode} node - node to report * @param {ASTNode} initial - node with initial name value * @param {ASTNode} result - node with new name value * @param {string} type - the type of the offending node * @returns {void} */ function reportError(node, initial, result, type) { var name = initial.type === "Identifier" ? initial.name : initial.value; return context.report({ node: node, message: "{{type}} {{name}} unnecessarily renamed.", data: { name: name, type: type }, fix: function fix(fixer) { return fixer.replaceTextRange([initial.range[0], result.range[1]], name); } }); } /** * Checks whether a destructured assignment is unnecessarily renamed * @param {ASTNode} node - node to check * @returns {void} */ function checkDestructured(node) { if (ignoreDestructuring) { return; } var properties = node.properties; for (var i = 0; i < properties.length; i++) { if (properties[i].shorthand) { continue; } /** * If an ObjectPattern property is computed, we have no idea * if a rename is useless or not. If an ObjectPattern property * lacks a key, it is likely an ExperimentalRestProperty and * so there is no "renaming" occurring here. */ if (properties[i].computed || !properties[i].key) { continue; } if (properties[i].key.type === "Identifier" && properties[i].key.name === properties[i].value.name || properties[i].key.type === "Literal" && properties[i].key.value === properties[i].value.name) { reportError(properties[i], properties[i].key, properties[i].value, "Destructuring assignment"); } } } /** * Checks whether an import is unnecessarily renamed * @param {ASTNode} node - node to check * @returns {void} */ function checkImport(node) { if (ignoreImport) { return; } if (node.imported.name === node.local.name && node.imported.range[0] !== node.local.range[0]) { reportError(node, node.imported, node.local, "Import"); } } /** * Checks whether an export is unnecessarily renamed * @param {ASTNode} node - node to check * @returns {void} */ function checkExport(node) { if (ignoreExport) { return; } if (node.local.name === node.exported.name && node.local.range[0] !== node.exported.range[0]) { reportError(node, node.local, node.exported, "Export"); } } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { ObjectPattern: checkDestructured, ImportSpecifier: checkImport, ExportSpecifier: checkExport }; } }; },{}],275:[function(require,module,exports){ /** * @fileoverview Disallow redundant return statements * @author Teddy Katz */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"), FixTracker = require("../util/fix-tracker"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Adds all elements of 2nd argument into 1st argument. * * @param {Array} array - The destination array to add. * @param {Array} elements - The source array to add. * @returns {void} */ var pushAll = Function.apply.bind(Array.prototype.push); /** * Removes the given element from the array. * * @param {Array} array - The source array to remove. * @param {any} element - The target item to remove. * @returns {void} */ function remove(array, element) { var index = array.indexOf(element); if (index !== -1) { array.splice(index, 1); } } /** * Checks whether it can remove the given return statement or not. * * @param {ASTNode} node - The return statement node to check. * @returns {boolean} `true` if the node is removeable. */ function isRemovable(node) { return astUtils.STATEMENT_LIST_PARENTS.has(node.parent.type); } /** * Checks whether the given return statement is in a `finally` block or not. * * @param {ASTNode} node - The return statement node to check. * @returns {boolean} `true` if the node is in a `finally` block. */ function isInFinally(node) { while (node && node.parent && !astUtils.isFunction(node)) { if (node.parent.type === "TryStatement" && node.parent.finalizer === node) { return true; } node = node.parent; } return false; } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow redundant return statements", category: "Best Practices", recommended: false }, fixable: "code", schema: [] }, create: function create(context) { var segmentInfoMap = new WeakMap(); var usedUnreachableSegments = new WeakSet(); var scopeInfo = null; /** * Checks whether the given segment is terminated by a return statement or not. * * @param {CodePathSegment} segment - The segment to check. * @returns {boolean} `true` if the segment is terminated by a return statement, or if it's still a part of unreachable. */ function isReturned(segment) { var info = segmentInfoMap.get(segment); return !info || info.returned; } /** * Collects useless return statements from the given previous segments. * * A previous segment may be an unreachable segment. * In that case, the information object of the unreachable segment is not * initialized because `onCodePathSegmentStart` event is not notified for * unreachable segments. * This goes to the previous segments of the unreachable segment recursively * if the unreachable segment was generated by a return statement. Otherwise, * this ignores the unreachable segment. * * This behavior would simulate code paths for the case that the return * statement does not exist. * * @param {ASTNode[]} uselessReturns - The collected return statements. * @param {CodePathSegment[]} prevSegments - The previous segments to traverse. * @param {WeakSet} [traversedSegments] A set of segments that have already been traversed in this call * @returns {ASTNode[]} `uselessReturns`. */ function getUselessReturns(uselessReturns, prevSegments, traversedSegments) { if (!traversedSegments) { traversedSegments = new WeakSet(); } var _iteratorNormalCompletion = true; var _didIteratorError = false; var _iteratorError = undefined; try { for (var _iterator = prevSegments[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) { var segment = _step.value; if (!segment.reachable) { if (!traversedSegments.has(segment)) { traversedSegments.add(segment); getUselessReturns(uselessReturns, segment.allPrevSegments.filter(isReturned), traversedSegments); } continue; } pushAll(uselessReturns, segmentInfoMap.get(segment).uselessReturns); } } catch (err) { _didIteratorError = true; _iteratorError = err; } finally { try { if (!_iteratorNormalCompletion && _iterator.return) { _iterator.return(); } } finally { if (_didIteratorError) { throw _iteratorError; } } } return uselessReturns; } /** * Removes the return statements on the given segment from the useless return * statement list. * * This segment may be an unreachable segment. * In that case, the information object of the unreachable segment is not * initialized because `onCodePathSegmentStart` event is not notified for * unreachable segments. * This goes to the previous segments of the unreachable segment recursively * if the unreachable segment was generated by a return statement. Otherwise, * this ignores the unreachable segment. * * This behavior would simulate code paths for the case that the return * statement does not exist. * * @param {CodePathSegment} segment - The segment to get return statements. * @returns {void} */ function markReturnStatementsOnSegmentAsUsed(segment) { if (!segment.reachable) { usedUnreachableSegments.add(segment); segment.allPrevSegments.filter(isReturned).filter(function (prevSegment) { return !usedUnreachableSegments.has(prevSegment); }).forEach(markReturnStatementsOnSegmentAsUsed); return; } var info = segmentInfoMap.get(segment); var _iteratorNormalCompletion2 = true; var _didIteratorError2 = false; var _iteratorError2 = undefined; try { for (var _iterator2 = info.uselessReturns[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) { var node = _step2.value; remove(scopeInfo.uselessReturns, node); } } catch (err) { _didIteratorError2 = true; _iteratorError2 = err; } finally { try { if (!_iteratorNormalCompletion2 && _iterator2.return) { _iterator2.return(); } } finally { if (_didIteratorError2) { throw _iteratorError2; } } } info.uselessReturns = []; } /** * Removes the return statements on the current segments from the useless * return statement list. * * This function will be called at every statement except FunctionDeclaration, * BlockStatement, and BreakStatement. * * - FunctionDeclarations are always executed whether it's returned or not. * - BlockStatements do nothing. * - BreakStatements go the next merely. * * @returns {void} */ function markReturnStatementsOnCurrentSegmentsAsUsed() { scopeInfo.codePath.currentSegments.forEach(markReturnStatementsOnSegmentAsUsed); } //---------------------------------------------------------------------- // Public //---------------------------------------------------------------------- return { // Makes and pushs a new scope information. onCodePathStart: function onCodePathStart(codePath) { scopeInfo = { upper: scopeInfo, uselessReturns: [], codePath: codePath }; }, // Reports useless return statements if exist. onCodePathEnd: function onCodePathEnd() { var _iteratorNormalCompletion3 = true; var _didIteratorError3 = false; var _iteratorError3 = undefined; try { var _loop = function _loop() { var node = _step3.value; context.report({ node: node, loc: node.loc, message: "Unnecessary return statement.", fix: function fix(fixer) { if (isRemovable(node)) { // Extend the replacement range to include the // entire function to avoid conflicting with // no-else-return. // https://github.com/eslint/eslint/issues/8026 return new FixTracker(fixer, context.getSourceCode()).retainEnclosingFunction(node).remove(node); } return null; } }); }; for (var _iterator3 = scopeInfo.uselessReturns[Symbol.iterator](), _step3; !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) { _loop(); } } catch (err) { _didIteratorError3 = true; _iteratorError3 = err; } finally { try { if (!_iteratorNormalCompletion3 && _iterator3.return) { _iterator3.return(); } } finally { if (_didIteratorError3) { throw _iteratorError3; } } } scopeInfo = scopeInfo.upper; }, // Initializes segments. // NOTE: This event is notified for only reachable segments. onCodePathSegmentStart: function onCodePathSegmentStart(segment) { var info = { uselessReturns: getUselessReturns([], segment.allPrevSegments), returned: false }; // Stores the info. segmentInfoMap.set(segment, info); }, // Adds ReturnStatement node to check whether it's useless or not. ReturnStatement: function ReturnStatement(node) { if (node.argument) { markReturnStatementsOnCurrentSegmentsAsUsed(); } if (node.argument || astUtils.isInLoop(node) || isInFinally(node)) { return; } var _iteratorNormalCompletion4 = true; var _didIteratorError4 = false; var _iteratorError4 = undefined; try { for (var _iterator4 = scopeInfo.codePath.currentSegments[Symbol.iterator](), _step4; !(_iteratorNormalCompletion4 = (_step4 = _iterator4.next()).done); _iteratorNormalCompletion4 = true) { var segment = _step4.value; var info = segmentInfoMap.get(segment); if (info) { info.uselessReturns.push(node); info.returned = true; } } } catch (err) { _didIteratorError4 = true; _iteratorError4 = err; } finally { try { if (!_iteratorNormalCompletion4 && _iterator4.return) { _iterator4.return(); } } finally { if (_didIteratorError4) { throw _iteratorError4; } } } scopeInfo.uselessReturns.push(node); }, // Registers for all statement nodes except FunctionDeclaration, BlockStatement, BreakStatement. // Removes return statements of the current segments from the useless return statement list. ClassDeclaration: markReturnStatementsOnCurrentSegmentsAsUsed, ContinueStatement: markReturnStatementsOnCurrentSegmentsAsUsed, DebuggerStatement: markReturnStatementsOnCurrentSegmentsAsUsed, DoWhileStatement: markReturnStatementsOnCurrentSegmentsAsUsed, EmptyStatement: markReturnStatementsOnCurrentSegmentsAsUsed, ExpressionStatement: markReturnStatementsOnCurrentSegmentsAsUsed, ForInStatement: markReturnStatementsOnCurrentSegmentsAsUsed, ForOfStatement: markReturnStatementsOnCurrentSegmentsAsUsed, ForStatement: markReturnStatementsOnCurrentSegmentsAsUsed, IfStatement: markReturnStatementsOnCurrentSegmentsAsUsed, ImportDeclaration: markReturnStatementsOnCurrentSegmentsAsUsed, LabeledStatement: markReturnStatementsOnCurrentSegmentsAsUsed, SwitchStatement: markReturnStatementsOnCurrentSegmentsAsUsed, ThrowStatement: markReturnStatementsOnCurrentSegmentsAsUsed, TryStatement: markReturnStatementsOnCurrentSegmentsAsUsed, VariableDeclaration: markReturnStatementsOnCurrentSegmentsAsUsed, WhileStatement: markReturnStatementsOnCurrentSegmentsAsUsed, WithStatement: markReturnStatementsOnCurrentSegmentsAsUsed, ExportNamedDeclaration: markReturnStatementsOnCurrentSegmentsAsUsed, ExportDefaultDeclaration: markReturnStatementsOnCurrentSegmentsAsUsed, ExportAllDeclaration: markReturnStatementsOnCurrentSegmentsAsUsed }; } }; },{"../ast-utils":67,"../util/fix-tracker":348}],276:[function(require,module,exports){ /** * @fileoverview Rule to check for the usage of var. * @author Jamund Ferguson */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Finds the nearest function scope or global scope walking up the scope * hierarchy. * * @param {eslint-scope.Scope} scope - The scope to traverse. * @returns {eslint-scope.Scope} a function scope or global scope containing the given * scope. */ function getEnclosingFunctionScope(scope) { while (scope.type !== "function" && scope.type !== "global") { scope = scope.upper; } return scope; } /** * Checks whether the given variable has any references from a more specific * function expression (i.e. a closure). * * @param {eslint-scope.Variable} variable - A variable to check. * @returns {boolean} `true` if the variable is used from a closure. */ function isReferencedInClosure(variable) { var enclosingFunctionScope = getEnclosingFunctionScope(variable.scope); return variable.references.some(function (reference) { return getEnclosingFunctionScope(reference.from) !== enclosingFunctionScope; }); } /** * Checks whether the given node is the assignee of a loop. * * @param {ASTNode} node - A VariableDeclaration node to check. * @returns {boolean} `true` if the declaration is assigned as part of loop * iteration. */ function isLoopAssignee(node) { return (node.parent.type === "ForOfStatement" || node.parent.type === "ForInStatement") && node === node.parent.left; } /** * Checks whether the given variable declaration is immediately initialized. * * @param {ASTNode} node - A VariableDeclaration node to check. * @returns {boolean} `true` if the declaration has an initializer. */ function isDeclarationInitialized(node) { return node.declarations.every(function (declarator) { return declarator.init !== null; }); } var SCOPE_NODE_TYPE = /^(?:Program|BlockStatement|SwitchStatement|ForStatement|ForInStatement|ForOfStatement)$/; /** * Gets the scope node which directly contains a given node. * * @param {ASTNode} node - A node to get. This is a `VariableDeclaration` or * an `Identifier`. * @returns {ASTNode} A scope node. This is one of `Program`, `BlockStatement`, * `SwitchStatement`, `ForStatement`, `ForInStatement`, and * `ForOfStatement`. */ function getScopeNode(node) { while (node) { if (SCOPE_NODE_TYPE.test(node.type)) { return node; } node = node.parent; } /* istanbul ignore next : unreachable */ return null; } /** * Checks whether a given variable is redeclared or not. * * @param {eslint-scope.Variable} variable - A variable to check. * @returns {boolean} `true` if the variable is redeclared. */ function isRedeclared(variable) { return variable.defs.length >= 2; } /** * Checks whether a given variable is used from outside of the specified scope. * * @param {ASTNode} scopeNode - A scope node to check. * @returns {Function} The predicate function which checks whether a given * variable is used from outside of the specified scope. */ function isUsedFromOutsideOf(scopeNode) { /** * Checks whether a given reference is inside of the specified scope or not. * * @param {eslint-scope.Reference} reference - A reference to check. * @returns {boolean} `true` if the reference is inside of the specified * scope. */ function isOutsideOfScope(reference) { var scope = scopeNode.range; var id = reference.identifier.range; return id[0] < scope[0] || id[1] > scope[1]; } return function (variable) { return variable.references.some(isOutsideOfScope); }; } /** * Creates the predicate function which checks whether a variable has their references in TDZ. * * The predicate function would return `true`: * * - if a reference is before the declarator. E.g. (var a = b, b = 1;)(var {a = b, b} = {};) * - if a reference is in the expression of their default value. E.g. (var {a = a} = {};) * - if a reference is in the expression of their initializer. E.g. (var a = a;) * * @param {ASTNode} node - The initializer node of VariableDeclarator. * @returns {Function} The predicate function. * @private */ function hasReferenceInTDZ(node) { var initStart = node.range[0]; var initEnd = node.range[1]; return function (variable) { var id = variable.defs[0].name; var idStart = id.range[0]; var defaultValue = id.parent.type === "AssignmentPattern" ? id.parent.right : null; var defaultStart = defaultValue && defaultValue.range[0]; var defaultEnd = defaultValue && defaultValue.range[1]; return variable.references.some(function (reference) { var start = reference.identifier.range[0]; var end = reference.identifier.range[1]; return !reference.init && (start < idStart || defaultValue !== null && start >= defaultStart && end <= defaultEnd || start >= initStart && end <= initEnd); }); }; } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require `let` or `const` instead of `var`", category: "ECMAScript 6", recommended: false }, schema: [], fixable: "code" }, create: function create(context) { var sourceCode = context.getSourceCode(); /** * Checks whether the variables which are defined by the given declarator node have their references in TDZ. * * @param {ASTNode} declarator - The VariableDeclarator node to check. * @returns {boolean} `true` if one of the variables which are defined by the given declarator node have their references in TDZ. */ function hasSelfReferenceInTDZ(declarator) { if (!declarator.init) { return false; } var variables = context.getDeclaredVariables(declarator); return variables.some(hasReferenceInTDZ(declarator.init)); } /** * Checks whether it can fix a given variable declaration or not. * It cannot fix if the following cases: * * - A variable is declared on a SwitchCase node. * - A variable is redeclared. * - A variable is used from outside the scope. * - A variable is used from a closure within a loop. * - A variable might be used before it is assigned within a loop. * - A variable might be used in TDZ. * - A variable is declared in statement position (e.g. a single-line `IfStatement`) * * ## A variable is declared on a SwitchCase node. * * If this rule modifies 'var' declarations on a SwitchCase node, it * would generate the warnings of 'no-case-declarations' rule. And the * 'eslint:recommended' preset includes 'no-case-declarations' rule, so * this rule doesn't modify those declarations. * * ## A variable is redeclared. * * The language spec disallows redeclarations of `let` declarations. * Those variables would cause syntax errors. * * ## A variable is used from outside the scope. * * The language spec disallows accesses from outside of the scope for * `let` declarations. Those variables would cause reference errors. * * ## A variable is used from a closure within a loop. * * A `var` declaration within a loop shares the same variable instance * across all loop iterations, while a `let` declaration creates a new * instance for each iteration. This means if a variable in a loop is * referenced by any closure, changing it from `var` to `let` would * change the behavior in a way that is generally unsafe. * * ## A variable might be used before it is assigned within a loop. * * Within a loop, a `let` declaration without an initializer will be * initialized to null, while a `var` declaration will retain its value * from the previous iteration, so it is only safe to change `var` to * `let` if we can statically determine that the variable is always * assigned a value before its first access in the loop body. To keep * the implementation simple, we only convert `var` to `let` within * loops when the variable is a loop assignee or the declaration has an * initializer. * * @param {ASTNode} node - A variable declaration node to check. * @returns {boolean} `true` if it can fix the node. */ function canFix(node) { var variables = context.getDeclaredVariables(node); var scopeNode = getScopeNode(node); if (node.parent.type === "SwitchCase" || node.declarations.some(hasSelfReferenceInTDZ) || variables.some(isRedeclared) || variables.some(isUsedFromOutsideOf(scopeNode))) { return false; } if (astUtils.isInLoop(node)) { if (variables.some(isReferencedInClosure)) { return false; } if (!isLoopAssignee(node) && !isDeclarationInitialized(node)) { return false; } } if (!isLoopAssignee(node) && !(node.parent.type === "ForStatement" && node.parent.init === node) && !astUtils.STATEMENT_LIST_PARENTS.has(node.parent.type)) { // If the declaration is not in a block, e.g. `if (foo) var bar = 1;`, then it can't be fixed. return false; } return true; } /** * Reports a given variable declaration node. * * @param {ASTNode} node - A variable declaration node to report. * @returns {void} */ function report(node) { var varToken = sourceCode.getFirstToken(node); context.report({ node: node, message: "Unexpected var, use let or const instead.", fix: function fix(fixer) { if (canFix(node)) { return fixer.replaceText(varToken, "let"); } return null; } }); } return { "VariableDeclaration:exit": function VariableDeclarationExit(node) { if (node.kind === "var") { report(node); } } }; } }; },{"../ast-utils":67}],277:[function(require,module,exports){ /** * @fileoverview Rule to disallow use of void operator. * @author Mike Sidorov */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow `void` operators", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { UnaryExpression: function UnaryExpression(node) { if (node.operator === "void") { context.report({ node: node, message: "Expected 'undefined' and instead saw 'void'." }); } } }; } }; },{}],278:[function(require,module,exports){ /** * @fileoverview Rule that warns about used warning comments * @author Alexander Schmidt */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow specified warning terms in comments", category: "Best Practices", recommended: false }, schema: [{ type: "object", properties: { terms: { type: "array", items: { type: "string" } }, location: { enum: ["start", "anywhere"] } }, additionalProperties: false }] }, create: function create(context) { var sourceCode = context.getSourceCode(), configuration = context.options[0] || {}, warningTerms = configuration.terms || ["todo", "fixme", "xxx"], location = configuration.location || "start", selfConfigRegEx = /\bno-warning-comments\b/; /** * Convert a warning term into a RegExp which will match a comment containing that whole word in the specified * location ("start" or "anywhere"). If the term starts or ends with non word characters, then the match will not * require word boundaries on that side. * * @param {string} term A term to convert to a RegExp * @returns {RegExp} The term converted to a RegExp */ function convertToRegExp(term) { var escaped = term.replace(/[-/\\$^*+?.()|[\]{}]/g, "\\$&"); var prefix = void 0; /* * If the term ends in a word character (a-z0-9_), ensure a word * boundary at the end, so that substrings do not get falsely * matched. eg "todo" in a string such as "mastodon". * If the term ends in a non-word character, then \b won't match on * the boundary to the next non-word character, which would likely * be a space. For example `/\bFIX!\b/.test('FIX! blah') === false`. * In these cases, use no bounding match. Same applies for the * prefix, handled below. */ var suffix = /\w$/.test(term) ? "\\b" : ""; if (location === "start") { /* * When matching at the start, ignore leading whitespace, and * there's no need to worry about word boundaries. */ prefix = "^\\s*"; } else if (/^\w/.test(term)) { prefix = "\\b"; } else { prefix = ""; } return new RegExp(prefix + escaped + suffix, "i"); } var warningRegExps = warningTerms.map(convertToRegExp); /** * Checks the specified comment for matches of the configured warning terms and returns the matches. * @param {string} comment The comment which is checked. * @returns {Array} All matched warning terms for this comment. */ function commentContainsWarningTerm(comment) { var matches = []; warningRegExps.forEach(function (regex, index) { if (regex.test(comment)) { matches.push(warningTerms[index]); } }); return matches; } /** * Checks the specified node for matching warning comments and reports them. * @param {ASTNode} node The AST node being checked. * @returns {void} undefined. */ function checkComment(node) { if (astUtils.isDirectiveComment(node) && selfConfigRegEx.test(node.value)) { return; } var matches = commentContainsWarningTerm(node.value); matches.forEach(function (matchedTerm) { context.report({ node: node, message: "Unexpected '{{matchedTerm}}' comment.", data: { matchedTerm: matchedTerm } }); }); } return { Program: function Program() { var comments = sourceCode.getAllComments(); comments.filter(function (token) { return token.type !== "Shebang"; }).forEach(checkComment); } }; } }; },{"../ast-utils":67}],279:[function(require,module,exports){ /** * @fileoverview Rule to disallow whitespace before properties * @author Kai Cataldo */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow whitespace before properties", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [] }, create: function create(context) { var sourceCode = context.getSourceCode(); //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Reports whitespace before property token * @param {ASTNode} node - the node to report in the event of an error * @param {Token} leftToken - the left token * @param {Token} rightToken - the right token * @returns {void} * @private */ function reportError(node, leftToken, rightToken) { var replacementText = node.computed ? "" : "."; context.report({ node: node, message: "Unexpected whitespace before property {{propName}}.", data: { propName: sourceCode.getText(node.property) }, fix: function fix(fixer) { if (!node.computed && astUtils.isDecimalInteger(node.object)) { // If the object is a number literal, fixing it to something like 5.toString() would cause a SyntaxError. // Don't fix this case. return null; } return fixer.replaceTextRange([leftToken.range[1], rightToken.range[0]], replacementText); } }); } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { MemberExpression: function MemberExpression(node) { var rightToken = void 0; var leftToken = void 0; if (!astUtils.isTokenOnSameLine(node.object, node.property)) { return; } if (node.computed) { rightToken = sourceCode.getTokenBefore(node.property, astUtils.isOpeningBracketToken); leftToken = sourceCode.getTokenBefore(rightToken); } else { rightToken = sourceCode.getFirstToken(node.property); leftToken = sourceCode.getTokenBefore(rightToken, 1); } if (sourceCode.isSpaceBetweenTokens(leftToken, rightToken)) { reportError(node, leftToken, rightToken); } } }; } }; },{"../ast-utils":67}],280:[function(require,module,exports){ /** * @fileoverview Rule to flag use of with statement * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow `with` statements", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { return { WithStatement: function WithStatement(node) { context.report({ node: node, message: "Unexpected use of 'with' statement." }); } }; } }; },{}],281:[function(require,module,exports){ /** * @fileoverview enforce the location of single-line statements * @author Teddy Katz */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ var POSITION_SCHEMA = { enum: ["beside", "below", "any"] }; module.exports = { meta: { docs: { description: "enforce the location of single-line statements", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [POSITION_SCHEMA, { properties: { overrides: { properties: { if: POSITION_SCHEMA, else: POSITION_SCHEMA, while: POSITION_SCHEMA, do: POSITION_SCHEMA, for: POSITION_SCHEMA }, additionalProperties: false } }, additionalProperties: false }] }, create: function create(context) { var sourceCode = context.getSourceCode(); //---------------------------------------------------------------------- // Helpers //---------------------------------------------------------------------- /** * Gets the applicable preference for a particular keyword * @param {string} keywordName The name of a keyword, e.g. 'if' * @returns {string} The applicable option for the keyword, e.g. 'beside' */ function getOption(keywordName) { return context.options[1] && context.options[1].overrides && context.options[1].overrides[keywordName] || context.options[0] || "beside"; } /** * Validates the location of a single-line statement * @param {ASTNode} node The single-line statement * @param {string} keywordName The applicable keyword name for the single-line statement * @returns {void} */ function validateStatement(node, keywordName) { var option = getOption(keywordName); if (node.type === "BlockStatement" || option === "any") { return; } var tokenBefore = sourceCode.getTokenBefore(node); if (tokenBefore.loc.end.line === node.loc.start.line && option === "below") { context.report({ node: node, message: "Expected a linebreak before this statement.", fix: function fix(fixer) { return fixer.insertTextBefore(node, "\n"); } }); } else if (tokenBefore.loc.end.line !== node.loc.start.line && option === "beside") { context.report({ node: node, message: "Expected no linebreak before this statement.", fix: function fix(fixer) { if (sourceCode.getText().slice(tokenBefore.range[1], node.range[0]).trim()) { return null; } return fixer.replaceTextRange([tokenBefore.range[1], node.range[0]], " "); } }); } } //---------------------------------------------------------------------- // Public //---------------------------------------------------------------------- return { IfStatement: function IfStatement(node) { validateStatement(node.consequent, "if"); // Check the `else` node, but don't check 'else if' statements. if (node.alternate && node.alternate.type !== "IfStatement") { validateStatement(node.alternate, "else"); } }, WhileStatement: function WhileStatement(node) { return validateStatement(node.body, "while"); }, DoWhileStatement: function DoWhileStatement(node) { return validateStatement(node.body, "do"); }, ForStatement: function ForStatement(node) { return validateStatement(node.body, "for"); }, ForInStatement: function ForInStatement(node) { return validateStatement(node.body, "for"); }, ForOfStatement: function ForOfStatement(node) { return validateStatement(node.body, "for"); } }; } }; },{}],282:[function(require,module,exports){ /** * @fileoverview Rule to require or disallow line breaks inside braces. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ // Schema objects. var OPTION_VALUE = { oneOf: [{ enum: ["always", "never"] }, { type: "object", properties: { multiline: { type: "boolean" }, minProperties: { type: "integer", minimum: 0 }, consistent: { type: "boolean" } }, additionalProperties: false, minProperties: 1 }] }; /** * Normalizes a given option value. * * @param {string|Object|undefined} value - An option value to parse. * @returns {{multiline: boolean, minProperties: number, consistent: boolean}} Normalized option object. */ function normalizeOptionValue(value) { var multiline = false; var minProperties = Number.POSITIVE_INFINITY; var consistent = false; if (value) { if (value === "always") { minProperties = 0; } else if (value === "never") { minProperties = Number.POSITIVE_INFINITY; } else { multiline = Boolean(value.multiline); minProperties = value.minProperties || Number.POSITIVE_INFINITY; consistent = Boolean(value.consistent); } } else { multiline = true; } return { multiline: multiline, minProperties: minProperties, consistent: consistent }; } /** * Normalizes a given option value. * * @param {string|Object|undefined} options - An option value to parse. * @returns {{ObjectExpression: {multiline: boolean, minProperties: number}, ObjectPattern: {multiline: boolean, minProperties: number}}} Normalized option object. */ function normalizeOptions(options) { if (options && (options.ObjectExpression || options.ObjectPattern)) { return { ObjectExpression: normalizeOptionValue(options.ObjectExpression), ObjectPattern: normalizeOptionValue(options.ObjectPattern) }; } var value = normalizeOptionValue(options); return { ObjectExpression: value, ObjectPattern: value }; } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce consistent line breaks inside braces", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ oneOf: [OPTION_VALUE, { type: "object", properties: { ObjectExpression: OPTION_VALUE, ObjectPattern: OPTION_VALUE }, additionalProperties: false, minProperties: 1 }] }] }, create: function create(context) { var sourceCode = context.getSourceCode(); var normalizedOptions = normalizeOptions(context.options[0]); /** * Reports a given node if it violated this rule. * * @param {ASTNode} node - A node to check. This is an ObjectExpression node or an ObjectPattern node. * @param {{multiline: boolean, minProperties: number}} options - An option object. * @returns {void} */ function check(node) { var options = normalizedOptions[node.type]; var openBrace = sourceCode.getFirstToken(node); var closeBrace = sourceCode.getLastToken(node); var first = sourceCode.getTokenAfter(openBrace, { includeComments: true }); var last = sourceCode.getTokenBefore(closeBrace, { includeComments: true }); var needsLinebreaks = node.properties.length >= options.minProperties || options.multiline && node.properties.length > 0 && first.loc.start.line !== last.loc.end.line; /* * Use tokens or comments to check multiline or not. * But use only tokens to check whether line breaks are needed. * This allows: * var obj = { // eslint-disable-line foo * a: 1 * } */ first = sourceCode.getTokenAfter(openBrace); last = sourceCode.getTokenBefore(closeBrace); if (needsLinebreaks) { if (astUtils.isTokenOnSameLine(openBrace, first)) { context.report({ message: "Expected a line break after this opening brace.", node: node, loc: openBrace.loc.start, fix: function fix(fixer) { return fixer.insertTextAfter(openBrace, "\n"); } }); } if (astUtils.isTokenOnSameLine(last, closeBrace)) { context.report({ message: "Expected a line break before this closing brace.", node: node, loc: closeBrace.loc.start, fix: function fix(fixer) { return fixer.insertTextBefore(closeBrace, "\n"); } }); } } else { var consistent = options.consistent; var hasLineBreakBetweenOpenBraceAndFirst = !astUtils.isTokenOnSameLine(openBrace, first); var hasLineBreakBetweenCloseBraceAndLast = !astUtils.isTokenOnSameLine(last, closeBrace); if (!consistent && hasLineBreakBetweenOpenBraceAndFirst || consistent && hasLineBreakBetweenOpenBraceAndFirst && !hasLineBreakBetweenCloseBraceAndLast) { context.report({ message: "Unexpected line break after this opening brace.", node: node, loc: openBrace.loc.start, fix: function fix(fixer) { return fixer.removeRange([openBrace.range[1], first.range[0]]); } }); } if (!consistent && hasLineBreakBetweenCloseBraceAndLast || consistent && !hasLineBreakBetweenOpenBraceAndFirst && hasLineBreakBetweenCloseBraceAndLast) { context.report({ message: "Unexpected line break before this closing brace.", node: node, loc: closeBrace.loc.start, fix: function fix(fixer) { return fixer.removeRange([last.range[1], closeBrace.range[0]]); } }); } } } return { ObjectExpression: check, ObjectPattern: check }; } }; },{"../ast-utils":67}],283:[function(require,module,exports){ /** * @fileoverview Disallows or enforces spaces inside of object literals. * @author Jamund Ferguson */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce consistent spacing inside braces", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ enum: ["always", "never"] }, { type: "object", properties: { arraysInObjects: { type: "boolean" }, objectsInObjects: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var spaced = context.options[0] === "always", sourceCode = context.getSourceCode(); /** * Determines whether an option is set, relative to the spacing option. * If spaced is "always", then check whether option is set to false. * If spaced is "never", then check whether option is set to true. * @param {Object} option - The option to exclude. * @returns {boolean} Whether or not the property is excluded. */ function isOptionSet(option) { return context.options[1] ? context.options[1][option] === !spaced : false; } var options = { spaced: spaced, arraysInObjectsException: isOptionSet("arraysInObjects"), objectsInObjectsException: isOptionSet("objectsInObjects") }; //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Reports that there shouldn't be a space after the first token * @param {ASTNode} node - The node to report in the event of an error. * @param {Token} token - The token to use for the report. * @returns {void} */ function reportNoBeginningSpace(node, token) { context.report({ node: node, loc: token.loc.start, message: "There should be no space after '{{token}}'.", data: { token: token.value }, fix: function fix(fixer) { var nextToken = context.getSourceCode().getTokenAfter(token); return fixer.removeRange([token.range[1], nextToken.range[0]]); } }); } /** * Reports that there shouldn't be a space before the last token * @param {ASTNode} node - The node to report in the event of an error. * @param {Token} token - The token to use for the report. * @returns {void} */ function reportNoEndingSpace(node, token) { context.report({ node: node, loc: token.loc.start, message: "There should be no space before '{{token}}'.", data: { token: token.value }, fix: function fix(fixer) { var previousToken = context.getSourceCode().getTokenBefore(token); return fixer.removeRange([previousToken.range[1], token.range[0]]); } }); } /** * Reports that there should be a space after the first token * @param {ASTNode} node - The node to report in the event of an error. * @param {Token} token - The token to use for the report. * @returns {void} */ function reportRequiredBeginningSpace(node, token) { context.report({ node: node, loc: token.loc.start, message: "A space is required after '{{token}}'.", data: { token: token.value }, fix: function fix(fixer) { return fixer.insertTextAfter(token, " "); } }); } /** * Reports that there should be a space before the last token * @param {ASTNode} node - The node to report in the event of an error. * @param {Token} token - The token to use for the report. * @returns {void} */ function reportRequiredEndingSpace(node, token) { context.report({ node: node, loc: token.loc.start, message: "A space is required before '{{token}}'.", data: { token: token.value }, fix: function fix(fixer) { return fixer.insertTextBefore(token, " "); } }); } /** * Determines if spacing in curly braces is valid. * @param {ASTNode} node The AST node to check. * @param {Token} first The first token to check (should be the opening brace) * @param {Token} second The second token to check (should be first after the opening brace) * @param {Token} penultimate The penultimate token to check (should be last before closing brace) * @param {Token} last The last token to check (should be closing brace) * @returns {void} */ function validateBraceSpacing(node, first, second, penultimate, last) { if (astUtils.isTokenOnSameLine(first, second)) { var firstSpaced = sourceCode.isSpaceBetweenTokens(first, second); if (options.spaced && !firstSpaced) { reportRequiredBeginningSpace(node, first); } if (!options.spaced && firstSpaced) { reportNoBeginningSpace(node, first); } } if (astUtils.isTokenOnSameLine(penultimate, last)) { var shouldCheckPenultimate = options.arraysInObjectsException && astUtils.isClosingBracketToken(penultimate) || options.objectsInObjectsException && astUtils.isClosingBraceToken(penultimate); var penultimateType = shouldCheckPenultimate && sourceCode.getNodeByRangeIndex(penultimate.start).type; var closingCurlyBraceMustBeSpaced = options.arraysInObjectsException && penultimateType === "ArrayExpression" || options.objectsInObjectsException && (penultimateType === "ObjectExpression" || penultimateType === "ObjectPattern") ? !options.spaced : options.spaced; var lastSpaced = sourceCode.isSpaceBetweenTokens(penultimate, last); if (closingCurlyBraceMustBeSpaced && !lastSpaced) { reportRequiredEndingSpace(node, last); } if (!closingCurlyBraceMustBeSpaced && lastSpaced) { reportNoEndingSpace(node, last); } } } /** * Gets '}' token of an object node. * * Because the last token of object patterns might be a type annotation, * this traverses tokens preceded by the last property, then returns the * first '}' token. * * @param {ASTNode} node - The node to get. This node is an * ObjectExpression or an ObjectPattern. And this node has one or * more properties. * @returns {Token} '}' token. */ function getClosingBraceOfObject(node) { var lastProperty = node.properties[node.properties.length - 1]; return sourceCode.getTokenAfter(lastProperty, astUtils.isClosingBraceToken); } /** * Reports a given object node if spacing in curly braces is invalid. * @param {ASTNode} node - An ObjectExpression or ObjectPattern node to check. * @returns {void} */ function checkForObject(node) { if (node.properties.length === 0) { return; } var first = sourceCode.getFirstToken(node), last = getClosingBraceOfObject(node), second = sourceCode.getTokenAfter(first), penultimate = sourceCode.getTokenBefore(last); validateBraceSpacing(node, first, second, penultimate, last); } /** * Reports a given import node if spacing in curly braces is invalid. * @param {ASTNode} node - An ImportDeclaration node to check. * @returns {void} */ function checkForImport(node) { if (node.specifiers.length === 0) { return; } var firstSpecifier = node.specifiers[0]; var lastSpecifier = node.specifiers[node.specifiers.length - 1]; if (lastSpecifier.type !== "ImportSpecifier") { return; } if (firstSpecifier.type !== "ImportSpecifier") { firstSpecifier = node.specifiers[1]; } var first = sourceCode.getTokenBefore(firstSpecifier), last = sourceCode.getTokenAfter(lastSpecifier, astUtils.isNotCommaToken), second = sourceCode.getTokenAfter(first), penultimate = sourceCode.getTokenBefore(last); validateBraceSpacing(node, first, second, penultimate, last); } /** * Reports a given export node if spacing in curly braces is invalid. * @param {ASTNode} node - An ExportNamedDeclaration node to check. * @returns {void} */ function checkForExport(node) { if (node.specifiers.length === 0) { return; } var firstSpecifier = node.specifiers[0], lastSpecifier = node.specifiers[node.specifiers.length - 1], first = sourceCode.getTokenBefore(firstSpecifier), last = sourceCode.getTokenAfter(lastSpecifier, astUtils.isNotCommaToken), second = sourceCode.getTokenAfter(first), penultimate = sourceCode.getTokenBefore(last); validateBraceSpacing(node, first, second, penultimate, last); } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { // var {x} = y; ObjectPattern: checkForObject, // var y = {x: 'y'} ObjectExpression: checkForObject, // import {y} from 'x'; ImportDeclaration: checkForImport, // export {name} from 'yo'; ExportNamedDeclaration: checkForExport }; } }; },{"../ast-utils":67}],284:[function(require,module,exports){ /** * @fileoverview Rule to enforce placing object properties on separate lines. * @author Vitor Balocco */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce placing object properties on separate lines", category: "Stylistic Issues", recommended: false }, schema: [{ type: "object", properties: { allowMultiplePropertiesPerLine: { type: "boolean" } }, additionalProperties: false }], fixable: "whitespace" }, create: function create(context) { var allowSameLine = context.options[0] && Boolean(context.options[0].allowMultiplePropertiesPerLine); var errorMessage = allowSameLine ? "Object properties must go on a new line if they aren't all on the same line." : "Object properties must go on a new line."; var sourceCode = context.getSourceCode(); return { ObjectExpression: function ObjectExpression(node) { if (allowSameLine) { if (node.properties.length > 1) { var firstTokenOfFirstProperty = sourceCode.getFirstToken(node.properties[0]); var lastTokenOfLastProperty = sourceCode.getLastToken(node.properties[node.properties.length - 1]); if (firstTokenOfFirstProperty.loc.end.line === lastTokenOfLastProperty.loc.start.line) { // All keys and values are on the same line return; } } } var _loop = function _loop(i) { var lastTokenOfPreviousProperty = sourceCode.getLastToken(node.properties[i - 1]); var firstTokenOfCurrentProperty = sourceCode.getFirstToken(node.properties[i]); if (lastTokenOfPreviousProperty.loc.end.line === firstTokenOfCurrentProperty.loc.start.line) { context.report({ node: node, loc: firstTokenOfCurrentProperty.loc.start, message: errorMessage, fix: function fix(fixer) { var comma = sourceCode.getTokenBefore(firstTokenOfCurrentProperty); var rangeAfterComma = [comma.range[1], firstTokenOfCurrentProperty.range[0]]; // Don't perform a fix if there are any comments between the comma and the next property. if (sourceCode.text.slice(rangeAfterComma[0], rangeAfterComma[1]).trim()) { return null; } return fixer.replaceTextRange(rangeAfterComma, "\n"); } }); } }; for (var i = 1; i < node.properties.length; i++) { _loop(i); } } }; } }; },{}],285:[function(require,module,exports){ /** * @fileoverview Rule to enforce concise object methods and properties. * @author Jamund Ferguson */ "use strict"; var OPTIONS = { always: "always", never: "never", methods: "methods", properties: "properties", consistent: "consistent", consistentAsNeeded: "consistent-as-needed" }; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require or disallow method and property shorthand syntax for object literals", category: "ECMAScript 6", recommended: false }, fixable: "code", schema: { anyOf: [{ type: "array", items: [{ enum: ["always", "methods", "properties", "never", "consistent", "consistent-as-needed"] }], minItems: 0, maxItems: 1 }, { type: "array", items: [{ enum: ["always", "methods", "properties"] }, { type: "object", properties: { avoidQuotes: { type: "boolean" } }, additionalProperties: false }], minItems: 0, maxItems: 2 }, { type: "array", items: [{ enum: ["always", "methods"] }, { type: "object", properties: { ignoreConstructors: { type: "boolean" }, avoidQuotes: { type: "boolean" }, avoidExplicitReturnArrows: { type: "boolean" } }, additionalProperties: false }], minItems: 0, maxItems: 2 }] } }, create: function create(context) { var APPLY = context.options[0] || OPTIONS.always; var APPLY_TO_METHODS = APPLY === OPTIONS.methods || APPLY === OPTIONS.always; var APPLY_TO_PROPS = APPLY === OPTIONS.properties || APPLY === OPTIONS.always; var APPLY_NEVER = APPLY === OPTIONS.never; var APPLY_CONSISTENT = APPLY === OPTIONS.consistent; var APPLY_CONSISTENT_AS_NEEDED = APPLY === OPTIONS.consistentAsNeeded; var PARAMS = context.options[1] || {}; var IGNORE_CONSTRUCTORS = PARAMS.ignoreConstructors; var AVOID_QUOTES = PARAMS.avoidQuotes; var AVOID_EXPLICIT_RETURN_ARROWS = !!PARAMS.avoidExplicitReturnArrows; var sourceCode = context.getSourceCode(); //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Determines if the first character of the name is a capital letter. * @param {string} name The name of the node to evaluate. * @returns {boolean} True if the first character of the property name is a capital letter, false if not. * @private */ function isConstructor(name) { var firstChar = name.charAt(0); return firstChar === firstChar.toUpperCase(); } /** * Determines if the property can have a shorthand form. * @param {ASTNode} property Property AST node * @returns {boolean} True if the property can have a shorthand form * @private **/ function canHaveShorthand(property) { return property.kind !== "set" && property.kind !== "get" && property.type !== "SpreadProperty" && property.type !== "ExperimentalSpreadProperty"; } /** * Checks whether a node is a string literal. * @param {ASTNode} node - Any AST node. * @returns {boolean} `true` if it is a string literal. */ function isStringLiteral(node) { return node.type === "Literal" && typeof node.value === "string"; } /** * Determines if the property is a shorthand or not. * @param {ASTNode} property Property AST node * @returns {boolean} True if the property is considered shorthand, false if not. * @private **/ function isShorthand(property) { // property.method is true when `{a(){}}`. return property.shorthand || property.method; } /** * Determines if the property's key and method or value are named equally. * @param {ASTNode} property Property AST node * @returns {boolean} True if the key and value are named equally, false if not. * @private **/ function isRedundant(property) { var value = property.value; if (value.type === "FunctionExpression") { return !value.id; // Only anonymous should be shorthand method. } if (value.type === "Identifier") { return astUtils.getStaticPropertyName(property) === value.name; } return false; } /** * Ensures that an object's properties are consistently shorthand, or not shorthand at all. * @param {ASTNode} node Property AST node * @param {boolean} checkRedundancy Whether to check longform redundancy * @returns {void} **/ function checkConsistency(node, checkRedundancy) { // We are excluding getters/setters and spread properties as they are considered neither longform nor shorthand. var properties = node.properties.filter(canHaveShorthand); // Do we still have properties left after filtering the getters and setters? if (properties.length > 0) { var shorthandProperties = properties.filter(isShorthand); // If we do not have an equal number of longform properties as // shorthand properties, we are using the annotations inconsistently if (shorthandProperties.length !== properties.length) { // We have at least 1 shorthand property if (shorthandProperties.length > 0) { context.report({ node: node, message: "Unexpected mix of shorthand and non-shorthand properties." }); } else if (checkRedundancy) { // If all properties of the object contain a method or value with a name matching it's key, // all the keys are redundant. var canAlwaysUseShorthand = properties.every(isRedundant); if (canAlwaysUseShorthand) { context.report({ node: node, message: "Expected shorthand for all properties." }); } } } } } /** * Fixes a FunctionExpression node by making it into a shorthand property. * @param {SourceCodeFixer} fixer The fixer object * @param {ASTNode} node A `Property` node that has a `FunctionExpression` or `ArrowFunctionExpression` as its value * @returns {Object} A fix for this node */ function makeFunctionShorthand(fixer, node) { var firstKeyToken = node.computed ? sourceCode.getFirstToken(node, astUtils.isOpeningBracketToken) : sourceCode.getFirstToken(node.key); var lastKeyToken = node.computed ? sourceCode.getFirstTokenBetween(node.key, node.value, astUtils.isClosingBracketToken) : sourceCode.getLastToken(node.key); var keyText = sourceCode.text.slice(firstKeyToken.range[0], lastKeyToken.range[1]); var keyPrefix = ""; if (node.value.generator) { keyPrefix = "*"; } else if (node.value.async) { keyPrefix = "async "; } if (node.value.type === "FunctionExpression") { var functionToken = sourceCode.getTokens(node.value).find(function (token) { return token.type === "Keyword" && token.value === "function"; }); var tokenBeforeParams = node.value.generator ? sourceCode.getTokenAfter(functionToken) : functionToken; return fixer.replaceTextRange([firstKeyToken.range[0], node.range[1]], keyPrefix + keyText + sourceCode.text.slice(tokenBeforeParams.range[1], node.value.range[1])); } var arrowToken = sourceCode.getTokens(node.value).find(function (token) { return token.value === "=>"; }); var tokenBeforeArrow = sourceCode.getTokenBefore(arrowToken); var hasParensAroundParameters = tokenBeforeArrow.type === "Punctuator" && tokenBeforeArrow.value === ")"; var oldParamText = sourceCode.text.slice(sourceCode.getFirstToken(node.value, node.value.async ? 1 : 0).range[0], tokenBeforeArrow.range[1]); var newParamText = hasParensAroundParameters ? oldParamText : "(" + oldParamText + ")"; return fixer.replaceTextRange([firstKeyToken.range[0], node.range[1]], keyPrefix + keyText + newParamText + sourceCode.text.slice(arrowToken.range[1], node.value.range[1])); } /** * Fixes a FunctionExpression node by making it into a longform property. * @param {SourceCodeFixer} fixer The fixer object * @param {ASTNode} node A `Property` node that has a `FunctionExpression` as its value * @returns {Object} A fix for this node */ function makeFunctionLongform(fixer, node) { var firstKeyToken = node.computed ? sourceCode.getTokens(node).find(function (token) { return token.value === "["; }) : sourceCode.getFirstToken(node.key); var lastKeyToken = node.computed ? sourceCode.getTokensBetween(node.key, node.value).find(function (token) { return token.value === "]"; }) : sourceCode.getLastToken(node.key); var keyText = sourceCode.text.slice(firstKeyToken.range[0], lastKeyToken.range[1]); var functionHeader = "function"; if (node.value.generator) { functionHeader = "function*"; } else if (node.value.async) { functionHeader = "async function"; } return fixer.replaceTextRange([node.range[0], lastKeyToken.range[1]], keyText + ": " + functionHeader); } /* * To determine whether a given arrow function has a lexical identifier (`this`, `arguments`, `super`, or `new.target`), * create a stack of functions that define these identifiers (i.e. all functions except arrow functions) as the AST is * traversed. Whenever a new function is encountered, create a new entry on the stack (corresponding to a different lexical * scope of `this`), and whenever a function is exited, pop that entry off the stack. When an arrow function is entered, * keep a reference to it on the current stack entry, and remove that reference when the arrow function is exited. * When a lexical identifier is encountered, mark all the arrow functions on the current stack entry by adding them * to an `arrowsWithLexicalIdentifiers` set. Any arrow function in that set will not be reported by this rule, * because converting it into a method would change the value of one of the lexical identifiers. */ var lexicalScopeStack = []; var arrowsWithLexicalIdentifiers = new WeakSet(); var argumentsIdentifiers = new WeakSet(); /** * Enters a function. This creates a new lexical identifier scope, so a new Set of arrow functions is pushed onto the stack. * Also, this marks all `arguments` identifiers so that they can be detected later. * @returns {void} */ function enterFunction() { lexicalScopeStack.unshift(new Set()); context.getScope().variables.filter(function (variable) { return variable.name === "arguments"; }).forEach(function (variable) { variable.references.map(function (ref) { return ref.identifier; }).forEach(function (identifier) { return argumentsIdentifiers.add(identifier); }); }); } /** * Exits a function. This pops the current set of arrow functions off the lexical scope stack. * @returns {void} */ function exitFunction() { lexicalScopeStack.shift(); } /** * Marks the current function as having a lexical keyword. This implies that all arrow functions * in the current lexical scope contain a reference to this lexical keyword. * @returns {void} */ function reportLexicalIdentifier() { lexicalScopeStack[0].forEach(function (arrowFunction) { return arrowsWithLexicalIdentifiers.add(arrowFunction); }); } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { Program: enterFunction, FunctionDeclaration: enterFunction, FunctionExpression: enterFunction, "Program:exit": exitFunction, "FunctionDeclaration:exit": exitFunction, "FunctionExpression:exit": exitFunction, ArrowFunctionExpression: function ArrowFunctionExpression(node) { lexicalScopeStack[0].add(node); }, "ArrowFunctionExpression:exit": function ArrowFunctionExpressionExit(node) { lexicalScopeStack[0].delete(node); }, ThisExpression: reportLexicalIdentifier, Super: reportLexicalIdentifier, MetaProperty: function MetaProperty(node) { if (node.meta.name === "new" && node.property.name === "target") { reportLexicalIdentifier(); } }, Identifier: function Identifier(node) { if (argumentsIdentifiers.has(node)) { reportLexicalIdentifier(); } }, ObjectExpression: function ObjectExpression(node) { if (APPLY_CONSISTENT) { checkConsistency(node, false); } else if (APPLY_CONSISTENT_AS_NEEDED) { checkConsistency(node, true); } }, "Property:exit": function PropertyExit(node) { var isConciseProperty = node.method || node.shorthand; // Ignore destructuring assignment if (node.parent.type === "ObjectPattern") { return; } // getters and setters are ignored if (node.kind === "get" || node.kind === "set") { return; } // only computed methods can fail the following checks if (node.computed && node.value.type !== "FunctionExpression" && node.value.type !== "ArrowFunctionExpression") { return; } //-------------------------------------------------------------- // Checks for property/method shorthand. if (isConciseProperty) { if (node.method && (APPLY_NEVER || AVOID_QUOTES && isStringLiteral(node.key))) { var message = APPLY_NEVER ? "Expected longform method syntax." : "Expected longform method syntax for string literal keys."; // { x() {} } should be written as { x: function() {} } context.report({ node: node, message: message, fix: function fix(fixer) { return makeFunctionLongform(fixer, node); } }); } else if (APPLY_NEVER) { // { x } should be written as { x: x } context.report({ node: node, message: "Expected longform property syntax.", fix: function fix(fixer) { return fixer.insertTextAfter(node.key, ": " + node.key.name); } }); } } else if (APPLY_TO_METHODS && !node.value.id && (node.value.type === "FunctionExpression" || node.value.type === "ArrowFunctionExpression")) { if (IGNORE_CONSTRUCTORS && node.key.type === "Identifier" && isConstructor(node.key.name)) { return; } if (AVOID_QUOTES && isStringLiteral(node.key)) { return; } // {[x]: function(){}} should be written as {[x]() {}} if (node.value.type === "FunctionExpression" || node.value.type === "ArrowFunctionExpression" && node.value.body.type === "BlockStatement" && AVOID_EXPLICIT_RETURN_ARROWS && !arrowsWithLexicalIdentifiers.has(node.value)) { context.report({ node: node, message: "Expected method shorthand.", fix: function fix(fixer) { return makeFunctionShorthand(fixer, node); } }); } } else if (node.value.type === "Identifier" && node.key.name === node.value.name && APPLY_TO_PROPS) { // {x: x} should be written as {x} context.report({ node: node, message: "Expected property shorthand.", fix: function fix(fixer) { return fixer.replaceText(node, node.value.name); } }); } else if (node.value.type === "Identifier" && node.key.type === "Literal" && node.key.value === node.value.name && APPLY_TO_PROPS) { if (AVOID_QUOTES) { return; } // {"x": x} should be written as {x} context.report({ node: node, message: "Expected property shorthand.", fix: function fix(fixer) { return fixer.replaceText(node, node.value.name); } }); } } }; } }; },{"../ast-utils":67}],286:[function(require,module,exports){ /** * @fileoverview Rule to check multiple var declarations per line * @author Alberto Rodríguez */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require or disallow newlines around variable declarations", category: "Stylistic Issues", recommended: false }, schema: [{ enum: ["always", "initializations"] }], fixable: "whitespace" }, create: function create(context) { var ERROR_MESSAGE = "Expected variable declaration to be on a new line."; var always = context.options[0] === "always"; //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Determine if provided keyword is a variant of for specifiers * @private * @param {string} keyword - keyword to test * @returns {boolean} True if `keyword` is a variant of for specifier */ function isForTypeSpecifier(keyword) { return keyword === "ForStatement" || keyword === "ForInStatement" || keyword === "ForOfStatement"; } /** * Checks newlines around variable declarations. * @private * @param {ASTNode} node - `VariableDeclaration` node to test * @returns {void} */ function checkForNewLine(node) { if (isForTypeSpecifier(node.parent.type)) { return; } var declarations = node.declarations; var prev = void 0; declarations.forEach(function (current) { if (prev && prev.loc.end.line === current.loc.start.line) { if (always || prev.init || current.init) { context.report({ node: node, message: ERROR_MESSAGE, loc: current.loc.start, fix: function fix(fixer) { return fixer.insertTextBefore(current, "\n"); } }); } } prev = current; }); } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { VariableDeclaration: checkForNewLine }; } }; },{}],287:[function(require,module,exports){ /** * @fileoverview A rule to control the use of single variable declarations. * @author Ian Christian Myers */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; module.exports = { meta: { docs: { description: "enforce variables to be declared either together or separately in functions", category: "Stylistic Issues", recommended: false }, schema: [{ oneOf: [{ enum: ["always", "never"] }, { type: "object", properties: { var: { enum: ["always", "never"] }, let: { enum: ["always", "never"] }, const: { enum: ["always", "never"] } }, additionalProperties: false }, { type: "object", properties: { initialized: { enum: ["always", "never"] }, uninitialized: { enum: ["always", "never"] } }, additionalProperties: false }] }] }, create: function create(context) { var MODE_ALWAYS = "always", MODE_NEVER = "never"; var mode = context.options[0] || MODE_ALWAYS; var options = {}; if (typeof mode === "string") { // simple options configuration with just a string options.var = { uninitialized: mode, initialized: mode }; options.let = { uninitialized: mode, initialized: mode }; options.const = { uninitialized: mode, initialized: mode }; } else if ((typeof mode === "undefined" ? "undefined" : _typeof(mode)) === "object") { // options configuration is an object if (mode.hasOwnProperty("var") && typeof mode.var === "string") { options.var = { uninitialized: mode.var, initialized: mode.var }; } if (mode.hasOwnProperty("let") && typeof mode.let === "string") { options.let = { uninitialized: mode.let, initialized: mode.let }; } if (mode.hasOwnProperty("const") && typeof mode.const === "string") { options.const = { uninitialized: mode.const, initialized: mode.const }; } if (mode.hasOwnProperty("uninitialized")) { if (!options.var) { options.var = {}; } if (!options.let) { options.let = {}; } if (!options.const) { options.const = {}; } options.var.uninitialized = mode.uninitialized; options.let.uninitialized = mode.uninitialized; options.const.uninitialized = mode.uninitialized; } if (mode.hasOwnProperty("initialized")) { if (!options.var) { options.var = {}; } if (!options.let) { options.let = {}; } if (!options.const) { options.const = {}; } options.var.initialized = mode.initialized; options.let.initialized = mode.initialized; options.const.initialized = mode.initialized; } } //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- var functionStack = []; var blockStack = []; /** * Increments the blockStack counter. * @returns {void} * @private */ function startBlock() { blockStack.push({ let: { initialized: false, uninitialized: false }, const: { initialized: false, uninitialized: false } }); } /** * Increments the functionStack counter. * @returns {void} * @private */ function startFunction() { functionStack.push({ initialized: false, uninitialized: false }); startBlock(); } /** * Decrements the blockStack counter. * @returns {void} * @private */ function endBlock() { blockStack.pop(); } /** * Decrements the functionStack counter. * @returns {void} * @private */ function endFunction() { functionStack.pop(); endBlock(); } /** * Records whether initialized or uninitialized variables are defined in current scope. * @param {string} statementType node.kind, one of: "var", "let", or "const" * @param {ASTNode[]} declarations List of declarations * @param {Object} currentScope The scope being investigated * @returns {void} * @private */ function recordTypes(statementType, declarations, currentScope) { for (var i = 0; i < declarations.length; i++) { if (declarations[i].init === null) { if (options[statementType] && options[statementType].uninitialized === MODE_ALWAYS) { currentScope.uninitialized = true; } } else { if (options[statementType] && options[statementType].initialized === MODE_ALWAYS) { currentScope.initialized = true; } } } } /** * Determines the current scope (function or block) * @param {string} statementType node.kind, one of: "var", "let", or "const" * @returns {Object} The scope associated with statementType */ function getCurrentScope(statementType) { var currentScope = void 0; if (statementType === "var") { currentScope = functionStack[functionStack.length - 1]; } else if (statementType === "let") { currentScope = blockStack[blockStack.length - 1].let; } else if (statementType === "const") { currentScope = blockStack[blockStack.length - 1].const; } return currentScope; } /** * Counts the number of initialized and uninitialized declarations in a list of declarations * @param {ASTNode[]} declarations List of declarations * @returns {Object} Counts of 'uninitialized' and 'initialized' declarations * @private */ function countDeclarations(declarations) { var counts = { uninitialized: 0, initialized: 0 }; for (var i = 0; i < declarations.length; i++) { if (declarations[i].init === null) { counts.uninitialized++; } else { counts.initialized++; } } return counts; } /** * Determines if there is more than one var statement in the current scope. * @param {string} statementType node.kind, one of: "var", "let", or "const" * @param {ASTNode[]} declarations List of declarations * @returns {boolean} Returns true if it is the first var declaration, false if not. * @private */ function hasOnlyOneStatement(statementType, declarations) { var declarationCounts = countDeclarations(declarations); var currentOptions = options[statementType] || {}; var currentScope = getCurrentScope(statementType); if (currentOptions.uninitialized === MODE_ALWAYS && currentOptions.initialized === MODE_ALWAYS) { if (currentScope.uninitialized || currentScope.initialized) { return false; } } if (declarationCounts.uninitialized > 0) { if (currentOptions.uninitialized === MODE_ALWAYS && currentScope.uninitialized) { return false; } } if (declarationCounts.initialized > 0) { if (currentOptions.initialized === MODE_ALWAYS && currentScope.initialized) { return false; } } recordTypes(statementType, declarations, currentScope); return true; } //-------------------------------------------------------------------------- // Public API //-------------------------------------------------------------------------- return { Program: startFunction, FunctionDeclaration: startFunction, FunctionExpression: startFunction, ArrowFunctionExpression: startFunction, BlockStatement: startBlock, ForStatement: startBlock, ForInStatement: startBlock, ForOfStatement: startBlock, SwitchStatement: startBlock, VariableDeclaration: function VariableDeclaration(node) { var parent = node.parent; var type = node.kind; if (!options[type]) { return; } var declarations = node.declarations; var declarationCounts = countDeclarations(declarations); // always if (!hasOnlyOneStatement(type, declarations)) { if (options[type].initialized === MODE_ALWAYS && options[type].uninitialized === MODE_ALWAYS) { context.report({ node: node, message: "Combine this with the previous '{{type}}' statement.", data: { type: type } }); } else { if (options[type].initialized === MODE_ALWAYS) { context.report({ node: node, message: "Combine this with the previous '{{type}}' statement with initialized variables.", data: { type: type } }); } if (options[type].uninitialized === MODE_ALWAYS) { if (node.parent.left === node && (node.parent.type === "ForInStatement" || node.parent.type === "ForOfStatement")) { return; } context.report({ node: node, message: "Combine this with the previous '{{type}}' statement with uninitialized variables.", data: { type: type } }); } } } // never if (parent.type !== "ForStatement" || parent.init !== node) { var totalDeclarations = declarationCounts.uninitialized + declarationCounts.initialized; if (totalDeclarations > 1) { if (options[type].initialized === MODE_NEVER && options[type].uninitialized === MODE_NEVER) { // both initialized and uninitialized context.report({ node: node, message: "Split '{{type}}' declarations into multiple statements.", data: { type: type } }); } else if (options[type].initialized === MODE_NEVER && declarationCounts.initialized > 0) { // initialized context.report({ node: node, message: "Split initialized '{{type}}' declarations into multiple statements.", data: { type: type } }); } else if (options[type].uninitialized === MODE_NEVER && declarationCounts.uninitialized > 0) { // uninitialized context.report({ node: node, message: "Split uninitialized '{{type}}' declarations into multiple statements.", data: { type: type } }); } } } }, "ForStatement:exit": endBlock, "ForOfStatement:exit": endBlock, "ForInStatement:exit": endBlock, "SwitchStatement:exit": endBlock, "BlockStatement:exit": endBlock, "Program:exit": endFunction, "FunctionDeclaration:exit": endFunction, "FunctionExpression:exit": endFunction, "ArrowFunctionExpression:exit": endFunction }; } }; },{}],288:[function(require,module,exports){ /** * @fileoverview Rule to replace assignment expressions with operator assignment * @author Brandon Mills */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Checks whether an operator is commutative and has an operator assignment * shorthand form. * @param {string} operator Operator to check. * @returns {boolean} True if the operator is commutative and has a * shorthand form. */ function isCommutativeOperatorWithShorthand(operator) { return ["*", "&", "^", "|"].indexOf(operator) >= 0; } /** * Checks whether an operator is not commuatative and has an operator assignment * shorthand form. * @param {string} operator Operator to check. * @returns {boolean} True if the operator is not commuatative and has * a shorthand form. */ function isNonCommutativeOperatorWithShorthand(operator) { return ["+", "-", "/", "%", "<<", ">>", ">>>", "**"].indexOf(operator) >= 0; } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ /** * Checks whether two expressions reference the same value. For example: * a = a * a.b = a.b * a[0] = a[0] * a['b'] = a['b'] * @param {ASTNode} a Left side of the comparison. * @param {ASTNode} b Right side of the comparison. * @returns {boolean} True if both sides match and reference the same value. */ function same(a, b) { if (a.type !== b.type) { return false; } switch (a.type) { case "Identifier": return a.name === b.name; case "Literal": return a.value === b.value; case "MemberExpression": /* * x[0] = x[0] * x[y] = x[y] * x.y = x.y */ return same(a.object, b.object) && same(a.property, b.property); default: return false; } } /** * Determines if the left side of a node can be safely fixed (i.e. if it activates the same getters/setters and) * toString calls regardless of whether assignment shorthand is used) * @param {ASTNode} node The node on the left side of the expression * @returns {boolean} `true` if the node can be fixed */ function canBeFixed(node) { return node.type === "Identifier" || node.type === "MemberExpression" && node.object.type === "Identifier" && (!node.computed || node.property.type === "Literal"); } module.exports = { meta: { docs: { description: "require or disallow assignment operator shorthand where possible", category: "Stylistic Issues", recommended: false }, schema: [{ enum: ["always", "never"] }], fixable: "code" }, create: function create(context) { var sourceCode = context.getSourceCode(); /** * Returns the operator token of an AssignmentExpression or BinaryExpression * @param {ASTNode} node An AssignmentExpression or BinaryExpression node * @returns {Token} The operator token in the node */ function getOperatorToken(node) { return sourceCode.getFirstTokenBetween(node.left, node.right, function (token) { return token.value === node.operator; }); } /** * Ensures that an assignment uses the shorthand form where possible. * @param {ASTNode} node An AssignmentExpression node. * @returns {void} */ function verify(node) { if (node.operator !== "=" || node.right.type !== "BinaryExpression") { return; } var left = node.left; var expr = node.right; var operator = expr.operator; if (isCommutativeOperatorWithShorthand(operator) || isNonCommutativeOperatorWithShorthand(operator)) { if (same(left, expr.left)) { context.report({ node: node, message: "Assignment can be replaced with operator assignment.", fix: function fix(fixer) { if (canBeFixed(left)) { var equalsToken = getOperatorToken(node); var operatorToken = getOperatorToken(expr); var leftText = sourceCode.getText().slice(node.range[0], equalsToken.range[0]); var rightText = sourceCode.getText().slice(operatorToken.range[1], node.right.range[1]); return fixer.replaceText(node, "" + leftText + expr.operator + "=" + rightText); } return null; } }); } else if (same(left, expr.right) && isCommutativeOperatorWithShorthand(operator)) { /* * This case can't be fixed safely. * If `a` and `b` both have custom valueOf() behavior, then fixing `a = b * a` to `a *= b` would * change the execution order of the valueOf() functions. */ context.report({ node: node, message: "Assignment can be replaced with operator assignment." }); } } } /** * Warns if an assignment expression uses operator assignment shorthand. * @param {ASTNode} node An AssignmentExpression node. * @returns {void} */ function prohibit(node) { if (node.operator !== "=") { context.report({ node: node, message: "Unexpected operator assignment shorthand.", fix: function fix(fixer) { if (canBeFixed(node.left)) { var operatorToken = getOperatorToken(node); var leftText = sourceCode.getText().slice(node.range[0], operatorToken.range[0]); var newOperator = node.operator.slice(0, -1); var rightText = void 0; // If this change would modify precedence (e.g. `foo *= bar + 1` => `foo = foo * (bar + 1)`), parenthesize the right side. if (astUtils.getPrecedence(node.right) <= astUtils.getPrecedence({ type: "BinaryExpression", operator: newOperator }) && !astUtils.isParenthesised(sourceCode, node.right)) { rightText = sourceCode.text.slice(operatorToken.range[1], node.right.range[0]) + "(" + sourceCode.getText(node.right) + ")"; } else { rightText = sourceCode.text.slice(operatorToken.range[1], node.range[1]); } return fixer.replaceText(node, leftText + "= " + leftText + newOperator + rightText); } return null; } }); } } return { AssignmentExpression: context.options[0] !== "never" ? verify : prohibit }; } }; },{"../ast-utils":67}],289:[function(require,module,exports){ /** * @fileoverview Operator linebreak - enforces operator linebreak style of two types: after and before * @author Benoît Zugmeyer */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce consistent linebreak style for operators", category: "Stylistic Issues", recommended: false }, schema: [{ enum: ["after", "before", "none", null] }, { type: "object", properties: { overrides: { type: "object", properties: { anyOf: { type: "string", enum: ["after", "before", "none", "ignore"] } } } }, additionalProperties: false }], fixable: "code" }, create: function create(context) { var usedDefaultGlobal = !context.options[0]; var globalStyle = context.options[0] || "after"; var options = context.options[1] || {}; var styleOverrides = options.overrides ? Object.assign({}, options.overrides) : {}; if (usedDefaultGlobal && !styleOverrides["?"]) { styleOverrides["?"] = "before"; } if (usedDefaultGlobal && !styleOverrides[":"]) { styleOverrides[":"] = "before"; } var sourceCode = context.getSourceCode(); //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Gets a fixer function to fix rule issues * @param {Token} operatorToken The operator token of an expression * @param {string} desiredStyle The style for the rule. One of 'before', 'after', 'none' * @returns {Function} A fixer function */ function getFixer(operatorToken, desiredStyle) { return function (fixer) { var tokenBefore = sourceCode.getTokenBefore(operatorToken); var tokenAfter = sourceCode.getTokenAfter(operatorToken); var textBefore = sourceCode.text.slice(tokenBefore.range[1], operatorToken.range[0]); var textAfter = sourceCode.text.slice(operatorToken.range[1], tokenAfter.range[0]); var hasLinebreakBefore = !astUtils.isTokenOnSameLine(tokenBefore, operatorToken); var hasLinebreakAfter = !astUtils.isTokenOnSameLine(operatorToken, tokenAfter); var newTextBefore = void 0, newTextAfter = void 0; if (hasLinebreakBefore !== hasLinebreakAfter && desiredStyle !== "none") { // If there is a comment before and after the operator, don't do a fix. if (sourceCode.getTokenBefore(operatorToken, { includeComments: true }) !== tokenBefore && sourceCode.getTokenAfter(operatorToken, { includeComments: true }) !== tokenAfter) { return null; } /* * If there is only one linebreak and it's on the wrong side of the operator, swap the text before and after the operator. * foo && * bar * would get fixed to * foo * && bar */ newTextBefore = textAfter; newTextAfter = textBefore; } else { var LINEBREAK_REGEX = astUtils.createGlobalLinebreakMatcher(); // Otherwise, if no linebreak is desired and no comments interfere, replace the linebreaks with empty strings. newTextBefore = desiredStyle === "before" || textBefore.trim() ? textBefore : textBefore.replace(LINEBREAK_REGEX, ""); newTextAfter = desiredStyle === "after" || textAfter.trim() ? textAfter : textAfter.replace(LINEBREAK_REGEX, ""); // If there was no change (due to interfering comments), don't output a fix. if (newTextBefore === textBefore && newTextAfter === textAfter) { return null; } } if (newTextAfter === "" && tokenAfter.type === "Punctuator" && "+-".includes(operatorToken.value) && tokenAfter.value === operatorToken.value) { // To avoid accidentally creating a ++ or -- operator, insert a space if the operator is a +/- and the following token is a unary +/-. newTextAfter += " "; } return fixer.replaceTextRange([tokenBefore.range[1], tokenAfter.range[0]], newTextBefore + operatorToken.value + newTextAfter); }; } /** * Checks the operator placement * @param {ASTNode} node The node to check * @param {ASTNode} leftSide The node that comes before the operator in `node` * @private * @returns {void} */ function validateNode(node, leftSide) { // When the left part of a binary expression is a single expression wrapped in // parentheses (ex: `(a) + b`), leftToken will be the last token of the expression // and operatorToken will be the closing parenthesis. // The leftToken should be the last closing parenthesis, and the operatorToken // should be the token right after that. var operatorToken = sourceCode.getTokenAfter(leftSide, astUtils.isNotClosingParenToken); var leftToken = sourceCode.getTokenBefore(operatorToken); var rightToken = sourceCode.getTokenAfter(operatorToken); var operator = operatorToken.value; var operatorStyleOverride = styleOverrides[operator]; var style = operatorStyleOverride || globalStyle; var fix = getFixer(operatorToken, style); // if single line if (astUtils.isTokenOnSameLine(leftToken, operatorToken) && astUtils.isTokenOnSameLine(operatorToken, rightToken)) { // do nothing. } else if (operatorStyleOverride !== "ignore" && !astUtils.isTokenOnSameLine(leftToken, operatorToken) && !astUtils.isTokenOnSameLine(operatorToken, rightToken)) { // lone operator context.report({ node: node, loc: { line: operatorToken.loc.end.line, column: operatorToken.loc.end.column }, message: "Bad line breaking before and after '{{operator}}'.", data: { operator: operator }, fix: fix }); } else if (style === "before" && astUtils.isTokenOnSameLine(leftToken, operatorToken)) { context.report({ node: node, loc: { line: operatorToken.loc.end.line, column: operatorToken.loc.end.column }, message: "'{{operator}}' should be placed at the beginning of the line.", data: { operator: operator }, fix: fix }); } else if (style === "after" && astUtils.isTokenOnSameLine(operatorToken, rightToken)) { context.report({ node: node, loc: { line: operatorToken.loc.end.line, column: operatorToken.loc.end.column }, message: "'{{operator}}' should be placed at the end of the line.", data: { operator: operator }, fix: fix }); } else if (style === "none") { context.report({ node: node, loc: { line: operatorToken.loc.end.line, column: operatorToken.loc.end.column }, message: "There should be no line break before or after '{{operator}}'.", data: { operator: operator }, fix: fix }); } } /** * Validates a binary expression using `validateNode` * @param {BinaryExpression|LogicalExpression|AssignmentExpression} node node to be validated * @returns {void} */ function validateBinaryExpression(node) { validateNode(node, node.left); } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { BinaryExpression: validateBinaryExpression, LogicalExpression: validateBinaryExpression, AssignmentExpression: validateBinaryExpression, VariableDeclarator: function VariableDeclarator(node) { if (node.init) { validateNode(node, node.id); } }, ConditionalExpression: function ConditionalExpression(node) { validateNode(node, node.test); validateNode(node, node.consequent); } }; } }; },{"../ast-utils":67}],290:[function(require,module,exports){ /** * @fileoverview A rule to ensure blank lines within blocks. * @author Mathias Schreck */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require or disallow padding within blocks", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ oneOf: [{ enum: ["always", "never"] }, { type: "object", properties: { blocks: { enum: ["always", "never"] }, switches: { enum: ["always", "never"] }, classes: { enum: ["always", "never"] } }, additionalProperties: false, minProperties: 1 }] }] }, create: function create(context) { var options = {}; var config = context.options[0] || "always"; if (typeof config === "string") { var shouldHavePadding = config === "always"; options.blocks = shouldHavePadding; options.switches = shouldHavePadding; options.classes = shouldHavePadding; } else { if (config.hasOwnProperty("blocks")) { options.blocks = config.blocks === "always"; } if (config.hasOwnProperty("switches")) { options.switches = config.switches === "always"; } if (config.hasOwnProperty("classes")) { options.classes = config.classes === "always"; } } var ALWAYS_MESSAGE = "Block must be padded by blank lines.", NEVER_MESSAGE = "Block must not be padded by blank lines."; var sourceCode = context.getSourceCode(); /** * Gets the open brace token from a given node. * @param {ASTNode} node - A BlockStatement or SwitchStatement node from which to get the open brace. * @returns {Token} The token of the open brace. */ function getOpenBrace(node) { if (node.type === "SwitchStatement") { return sourceCode.getTokenBefore(node.cases[0]); } return sourceCode.getFirstToken(node); } /** * Checks if the given parameter is a comment node * @param {ASTNode|Token} node An AST node or token * @returns {boolean} True if node is a comment */ function isComment(node) { return node.type === "Line" || node.type === "Block"; } /** * Checks if there is padding between two tokens * @param {Token} first The first token * @param {Token} second The second token * @returns {boolean} True if there is at least a line between the tokens */ function isPaddingBetweenTokens(first, second) { return second.loc.start.line - first.loc.end.line >= 2; } /** * Checks if the given token has a blank line after it. * @param {Token} token The token to check. * @returns {boolean} Whether or not the token is followed by a blank line. */ function getFirstBlockToken(token) { var prev = token, first = token; do { prev = first; first = sourceCode.getTokenAfter(first, { includeComments: true }); } while (isComment(first) && first.loc.start.line === prev.loc.end.line); return first; } /** * Checks if the given token is preceeded by a blank line. * @param {Token} token The token to check * @returns {boolean} Whether or not the token is preceeded by a blank line */ function getLastBlockToken(token) { var last = token, next = token; do { next = last; last = sourceCode.getTokenBefore(last, { includeComments: true }); } while (isComment(last) && last.loc.end.line === next.loc.start.line); return last; } /** * Checks if a node should be padded, according to the rule config. * @param {ASTNode} node The AST node to check. * @returns {boolean} True if the node should be padded, false otherwise. */ function requirePaddingFor(node) { switch (node.type) { case "BlockStatement": return options.blocks; case "SwitchStatement": return options.switches; case "ClassBody": return options.classes; /* istanbul ignore next */ default: throw new Error("unreachable"); } } /** * Checks the given BlockStatement node to be padded if the block is not empty. * @param {ASTNode} node The AST node of a BlockStatement. * @returns {void} undefined. */ function checkPadding(node) { var openBrace = getOpenBrace(node), firstBlockToken = getFirstBlockToken(openBrace), tokenBeforeFirst = sourceCode.getTokenBefore(firstBlockToken, { includeComments: true }), closeBrace = sourceCode.getLastToken(node), lastBlockToken = getLastBlockToken(closeBrace), tokenAfterLast = sourceCode.getTokenAfter(lastBlockToken, { includeComments: true }), blockHasTopPadding = isPaddingBetweenTokens(tokenBeforeFirst, firstBlockToken), blockHasBottomPadding = isPaddingBetweenTokens(lastBlockToken, tokenAfterLast); if (requirePaddingFor(node)) { if (!blockHasTopPadding) { context.report({ node: node, loc: { line: tokenBeforeFirst.loc.start.line, column: tokenBeforeFirst.loc.start.column }, fix: function fix(fixer) { return fixer.insertTextAfter(tokenBeforeFirst, "\n"); }, message: ALWAYS_MESSAGE }); } if (!blockHasBottomPadding) { context.report({ node: node, loc: { line: tokenAfterLast.loc.end.line, column: tokenAfterLast.loc.end.column - 1 }, fix: function fix(fixer) { return fixer.insertTextBefore(tokenAfterLast, "\n"); }, message: ALWAYS_MESSAGE }); } } else { if (blockHasTopPadding) { context.report({ node: node, loc: { line: tokenBeforeFirst.loc.start.line, column: tokenBeforeFirst.loc.start.column }, fix: function fix(fixer) { return fixer.replaceTextRange([tokenBeforeFirst.end, firstBlockToken.start - firstBlockToken.loc.start.column], "\n"); }, message: NEVER_MESSAGE }); } if (blockHasBottomPadding) { context.report({ node: node, loc: { line: tokenAfterLast.loc.end.line, column: tokenAfterLast.loc.end.column - 1 }, message: NEVER_MESSAGE, fix: function fix(fixer) { return fixer.replaceTextRange([lastBlockToken.end, tokenAfterLast.start - tokenAfterLast.loc.start.column], "\n"); } }); } } } var rule = {}; if (options.hasOwnProperty("switches")) { rule.SwitchStatement = function (node) { if (node.cases.length === 0) { return; } checkPadding(node); }; } if (options.hasOwnProperty("blocks")) { rule.BlockStatement = function (node) { if (node.body.length === 0) { return; } checkPadding(node); }; } if (options.hasOwnProperty("classes")) { rule.ClassBody = function (node) { if (node.body.length === 0) { return; } checkPadding(node); }; } return rule; } }; },{}],291:[function(require,module,exports){ /** * @fileoverview Rule to require or disallow newlines between statements * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _templateObject = _taggedTemplateLiteral(["^(s*?", ")s*", "(s*;?)$"], ["^(\\s*?", ")\\s*", "(\\s*;?)$"]); function _taggedTemplateLiteral(strings, raw) { return Object.freeze(Object.defineProperties(strings, { raw: { value: Object.freeze(raw) } })); } var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var LT = "[" + Array.from(astUtils.LINEBREAKS).join("") + "]"; var PADDING_LINE_SEQUENCE = new RegExp(String.raw(_templateObject, LT, LT)); var CJS_EXPORT = /^(?:module\s*\.\s*)?exports(?:\s*\.|\s*\[|$)/; var CJS_IMPORT = /^require\(/; /** * Creates tester which check if a node starts with specific keyword. * * @param {string} keyword The keyword to test. * @returns {Object} the created tester. * @private */ function newKeywordTester(keyword) { return { test: function test(node, sourceCode) { return sourceCode.getFirstToken(node).value === keyword; } }; } /** * Creates tester which check if a node is specific type. * * @param {string} type The node type to test. * @returns {Object} the created tester. * @private */ function newNodeTypeTester(type) { return { test: function test(node) { return node.type === type; } }; } /** * Checks the given node is an expression statement of IIFE. * * @param {ASTNode} node The node to check. * @returns {boolean} `true` if the node is an expression statement of IIFE. * @private */ function isIIFEStatement(node) { if (node.type === "ExpressionStatement") { var call = node.expression; if (call.type === "UnaryExpression") { call = call.argument; } return call.type === "CallExpression" && astUtils.isFunction(call.callee); } return false; } /** * Checks whether the given node is a block-like statement. * This checks the last token of the node is the closing brace of a block. * * @param {SourceCode} sourceCode The source code to get tokens. * @param {ASTNode} node The node to check. * @returns {boolean} `true` if the node is a block-like statement. * @private */ function isBlockLikeStatement(sourceCode, node) { // do-while with a block is a block-like statement. if (node.type === "DoWhileStatement" && node.body.type === "BlockStatement") { return true; } // IIFE is a block-like statement specially from // JSCS#disallowPaddingNewLinesAfterBlocks. if (isIIFEStatement(node)) { return true; } // Checks the last token is a closing brace of blocks. var lastToken = sourceCode.getLastToken(node, astUtils.isNotSemicolonToken); var belongingNode = astUtils.isClosingBraceToken(lastToken) ? sourceCode.getNodeByRangeIndex(lastToken.range[0]) : null; return Boolean(belongingNode) && (belongingNode.type === "BlockStatement" || belongingNode.type === "SwitchStatement"); } /** * Check whether the given node is a directive or not. * @param {ASTNode} node The node to check. * @param {SourceCode} sourceCode The source code object to get tokens. * @returns {boolean} `true` if the node is a directive. */ function isDirective(node, sourceCode) { return node.type === "ExpressionStatement" && (node.parent.type === "Program" || node.parent.type === "BlockStatement" && astUtils.isFunction(node.parent.parent)) && node.expression.type === "Literal" && typeof node.expression.value === "string" && !astUtils.isParenthesised(sourceCode, node.expression); } /** * Check whether the given node is a part of directive prologue or not. * @param {ASTNode} node The node to check. * @param {SourceCode} sourceCode The source code object to get tokens. * @returns {boolean} `true` if the node is a part of directive prologue. */ function isDirectivePrologue(node, sourceCode) { if (isDirective(node, sourceCode)) { var _iteratorNormalCompletion = true; var _didIteratorError = false; var _iteratorError = undefined; try { for (var _iterator = node.parent.body[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) { var sibling = _step.value; if (sibling === node) { break; } if (!isDirective(sibling, sourceCode)) { return false; } } } catch (err) { _didIteratorError = true; _iteratorError = err; } finally { try { if (!_iteratorNormalCompletion && _iterator.return) { _iterator.return(); } } finally { if (_didIteratorError) { throw _iteratorError; } } } return true; } return false; } /** * Gets the actual last token. * * If a semicolon is semicolon-less style's semicolon, this ignores it. * For example: * * foo() * ;[1, 2, 3].forEach(bar) * * @param {SourceCode} sourceCode The source code to get tokens. * @param {ASTNode} node The node to get. * @returns {Token} The actual last token. * @private */ function getActualLastToken(sourceCode, node) { var semiToken = sourceCode.getLastToken(node); var prevToken = sourceCode.getTokenBefore(semiToken); var nextToken = sourceCode.getTokenAfter(semiToken); var isSemicolonLessStyle = Boolean(prevToken && nextToken && prevToken.range[0] >= node.range[0] && astUtils.isSemicolonToken(semiToken) && semiToken.loc.start.line !== prevToken.loc.end.line && semiToken.loc.end.line === nextToken.loc.start.line); return isSemicolonLessStyle ? prevToken : semiToken; } /** * This returns the concatenation of the first 2 captured strings. * @param {string} _ Unused. Whole matched string. * @param {string} trailingSpaces The trailing spaces of the first line. * @param {string} indentSpaces The indentation spaces of the last line. * @returns {string} The concatenation of trailingSpaces and indentSpaces. * @private */ function replacerToRemovePaddingLines(_, trailingSpaces, indentSpaces) { return trailingSpaces + indentSpaces; } /** * Check and report statements for `any` configuration. * It does nothing. * * @returns {void} * @private */ function verifyForAny() {} /** * Check and report statements for `never` configuration. * This autofix removes blank lines between the given 2 statements. * However, if comments exist between 2 blank lines, it does not remove those * blank lines automatically. * * @param {RuleContext} context The rule context to report. * @param {ASTNode} prevNode The previous node to check. * @param {ASTNode} nextNode The next node to check. * @param {Array} paddingLines The array of token pairs that blank * lines exist between the pair. * @returns {void} * @private */ function verifyForNever(context, prevNode, nextNode, paddingLines) { if (paddingLines.length === 0) { return; } context.report({ node: nextNode, message: "Unexpected blank line before this statement.", fix: function fix(fixer) { if (paddingLines.length >= 2) { return null; } var prevToken = paddingLines[0][0]; var nextToken = paddingLines[0][1]; var start = prevToken.range[1]; var end = nextToken.range[0]; var text = context.getSourceCode().text.slice(start, end).replace(PADDING_LINE_SEQUENCE, replacerToRemovePaddingLines); return fixer.replaceTextRange([start, end], text); } }); } /** * Check and report statements for `always` configuration. * This autofix inserts a blank line between the given 2 statements. * If the `prevNode` has trailing comments, it inserts a blank line after the * trailing comments. * * @param {RuleContext} context The rule context to report. * @param {ASTNode} prevNode The previous node to check. * @param {ASTNode} nextNode The next node to check. * @param {Array} paddingLines The array of token pairs that blank * lines exist between the pair. * @returns {void} * @private */ function verifyForAlways(context, prevNode, nextNode, paddingLines) { if (paddingLines.length > 0) { return; } context.report({ node: nextNode, message: "Expected blank line before this statement.", fix: function fix(fixer) { var sourceCode = context.getSourceCode(); var prevToken = getActualLastToken(sourceCode, prevNode); var nextToken = sourceCode.getFirstTokenBetween(prevToken, nextNode, { includeComments: true, /** * Skip the trailing comments of the previous node. * This inserts a blank line after the last trailing comment. * * For example: * * foo(); // trailing comment. * // comment. * bar(); * * Get fixed to: * * foo(); // trailing comment. * * // comment. * bar(); * * @param {Token} token The token to check. * @returns {boolean} `true` if the token is not a trailing comment. * @private */ filter: function filter(token) { if (astUtils.isTokenOnSameLine(prevToken, token)) { prevToken = token; return false; } return true; } }) || nextNode; var insertText = astUtils.isTokenOnSameLine(prevToken, nextToken) ? "\n\n" : "\n"; return fixer.insertTextAfter(prevToken, insertText); } }); } /** * Types of blank lines. * `any`, `never`, and `always` are defined. * Those have `verify` method to check and report statements. * @private */ var PaddingTypes = { any: { verify: verifyForAny }, never: { verify: verifyForNever }, always: { verify: verifyForAlways } }; /** * Types of statements. * Those have `test` method to check it matches to the given statement. * @private */ var StatementTypes = { "*": { test: function test() { return true; } }, "block-like": { test: function test(node, sourceCode) { return isBlockLikeStatement(sourceCode, node); } }, "cjs-export": { test: function test(node, sourceCode) { return node.type === "ExpressionStatement" && node.expression.type === "AssignmentExpression" && CJS_EXPORT.test(sourceCode.getText(node.expression.left)); } }, "cjs-import": { test: function test(node, sourceCode) { return node.type === "VariableDeclaration" && node.declarations.length > 0 && Boolean(node.declarations[0].init) && CJS_IMPORT.test(sourceCode.getText(node.declarations[0].init)); } }, directive: { test: isDirectivePrologue }, expression: { test: function test(node, sourceCode) { return node.type === "ExpressionStatement" && !isDirectivePrologue(node, sourceCode); } }, "multiline-block-like": { test: function test(node, sourceCode) { return node.loc.start.line !== node.loc.end.line && isBlockLikeStatement(sourceCode, node); } }, block: newNodeTypeTester("BlockStatement"), empty: newNodeTypeTester("EmptyStatement"), break: newKeywordTester("break"), case: newKeywordTester("case"), class: newKeywordTester("class"), const: newKeywordTester("const"), continue: newKeywordTester("continue"), debugger: newKeywordTester("debugger"), default: newKeywordTester("default"), do: newKeywordTester("do"), export: newKeywordTester("export"), for: newKeywordTester("for"), function: newKeywordTester("function"), if: newKeywordTester("if"), import: newKeywordTester("import"), let: newKeywordTester("let"), return: newKeywordTester("return"), switch: newKeywordTester("switch"), throw: newKeywordTester("throw"), try: newKeywordTester("try"), var: newKeywordTester("var"), while: newKeywordTester("while"), with: newKeywordTester("with") }; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require or disallow padding lines between statements", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: { definitions: { paddingType: { enum: Object.keys(PaddingTypes) }, statementType: { anyOf: [{ enum: Object.keys(StatementTypes) }, { type: "array", items: { enum: Object.keys(StatementTypes) }, minItems: 1, uniqueItems: true, additionalItems: false }] } }, type: "array", items: { type: "object", properties: { blankLine: { $ref: "#/definitions/paddingType" }, prev: { $ref: "#/definitions/statementType" }, next: { $ref: "#/definitions/statementType" } }, additionalProperties: false, required: ["blankLine", "prev", "next"] }, additionalItems: false } }, create: function create(context) { var sourceCode = context.getSourceCode(); var configureList = context.options || []; var scopeInfo = null; /** * Processes to enter to new scope. * This manages the current previous statement. * @returns {void} * @private */ function enterScope() { scopeInfo = { upper: scopeInfo, prevNode: null }; } /** * Processes to exit from the current scope. * @returns {void} * @private */ function exitScope() { scopeInfo = scopeInfo.upper; } /** * Checks whether the given node matches the given type. * * @param {ASTNode} node The statement node to check. * @param {string|string[]} type The statement type to check. * @returns {boolean} `true` if the statement node matched the type. * @private */ function match(node, type) { while (node.type === "LabeledStatement") { node = node.body; } if (Array.isArray(type)) { return type.some(match.bind(null, node)); } return StatementTypes[type].test(node, sourceCode); } /** * Finds the last matched configure from configureList. * * @param {ASTNode} prevNode The previous statement to match. * @param {ASTNode} nextNode The current statement to match. * @returns {Object} The tester of the last matched configure. * @private */ function getPaddingType(prevNode, nextNode) { for (var i = configureList.length - 1; i >= 0; --i) { var configure = configureList[i]; var matched = match(prevNode, configure.prev) && match(nextNode, configure.next); if (matched) { return PaddingTypes[configure.blankLine]; } } return PaddingTypes.any; } /** * Gets padding line sequences between the given 2 statements. * Comments are separators of the padding line sequences. * * @param {ASTNode} prevNode The previous statement to count. * @param {ASTNode} nextNode The current statement to count. * @returns {Array} The array of token pairs. * @private */ function getPaddingLineSequences(prevNode, nextNode) { var pairs = []; var prevToken = getActualLastToken(sourceCode, prevNode); if (nextNode.loc.start.line - prevToken.loc.end.line >= 2) { do { var token = sourceCode.getTokenAfter(prevToken, { includeComments: true }); if (token.loc.start.line - prevToken.loc.end.line >= 2) { pairs.push([prevToken, token]); } prevToken = token; } while (prevToken.range[0] < nextNode.range[0]); } return pairs; } /** * Verify padding lines between the given node and the previous node. * * @param {ASTNode} node The node to verify. * @returns {void} * @private */ function verify(node) { var parentType = node.parent.type; var validParent = astUtils.STATEMENT_LIST_PARENTS.has(parentType) || parentType === "SwitchStatement"; if (!validParent) { return; } // Save this node as the current previous statement. var prevNode = scopeInfo.prevNode; // Verify. if (prevNode) { var type = getPaddingType(prevNode, node); var paddingLines = getPaddingLineSequences(prevNode, node); type.verify(context, prevNode, node, paddingLines); } scopeInfo.prevNode = node; } /** * Verify padding lines between the given node and the previous node. * Then process to enter to new scope. * * @param {ASTNode} node The node to verify. * @returns {void} * @private */ function verifyThenEnterScope(node) { verify(node); enterScope(); } return { Program: enterScope, BlockStatement: enterScope, SwitchStatement: enterScope, "Program:exit": exitScope, "BlockStatement:exit": exitScope, "SwitchStatement:exit": exitScope, ":statement": verify, SwitchCase: verifyThenEnterScope, "SwitchCase:exit": exitScope }; } }; },{"../ast-utils":67}],292:[function(require,module,exports){ /** * @fileoverview A rule to suggest using arrow functions as callbacks. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Checks whether or not a given variable is a function name. * @param {eslint-scope.Variable} variable - A variable to check. * @returns {boolean} `true` if the variable is a function name. */ function isFunctionName(variable) { return variable && variable.defs[0].type === "FunctionName"; } /** * Checks whether or not a given MetaProperty node equals to a given value. * @param {ASTNode} node - A MetaProperty node to check. * @param {string} metaName - The name of `MetaProperty.meta`. * @param {string} propertyName - The name of `MetaProperty.property`. * @returns {boolean} `true` if the node is the specific value. */ function checkMetaProperty(node, metaName, propertyName) { return node.meta.name === metaName && node.property.name === propertyName; } /** * Gets the variable object of `arguments` which is defined implicitly. * @param {eslint-scope.Scope} scope - A scope to get. * @returns {eslint-scope.Variable} The found variable object. */ function getVariableOfArguments(scope) { var variables = scope.variables; for (var i = 0; i < variables.length; ++i) { var variable = variables[i]; if (variable.name === "arguments") { /* * If there was a parameter which is named "arguments", the * implicit "arguments" is not defined. * So does fast return with null. */ return variable.identifiers.length === 0 ? variable : null; } } /* istanbul ignore next */ return null; } /** * Checkes whether or not a given node is a callback. * @param {ASTNode} node - A node to check. * @returns {Object} * {boolean} retv.isCallback - `true` if the node is a callback. * {boolean} retv.isLexicalThis - `true` if the node is with `.bind(this)`. */ function getCallbackInfo(node) { var retv = { isCallback: false, isLexicalThis: false }; var parent = node.parent; while (node) { switch (parent.type) { // Checks parents recursively. case "LogicalExpression": case "ConditionalExpression": break; // Checks whether the parent node is `.bind(this)` call. case "MemberExpression": if (parent.object === node && !parent.property.computed && parent.property.type === "Identifier" && parent.property.name === "bind" && parent.parent.type === "CallExpression" && parent.parent.callee === parent) { retv.isLexicalThis = parent.parent.arguments.length === 1 && parent.parent.arguments[0].type === "ThisExpression"; node = parent; parent = parent.parent; } else { return retv; } break; // Checks whether the node is a callback. case "CallExpression": case "NewExpression": if (parent.callee !== node) { retv.isCallback = true; } return retv; default: return retv; } node = parent; parent = parent.parent; } /* istanbul ignore next */ throw new Error("unreachable"); } /** * Checks whether a simple list of parameters contains any duplicates. This does not handle complex parameter lists (e.g. with destructuring), since complex parameter lists are a SyntaxError with duplicate parameter names anyway. Instead, it always returns `false` for complex parameter lists. * @param {ASTNode[]} paramsList The list of parameters for a function * @returns {boolean} `true` if the list of parameters contains any duplicates */ function hasDuplicateParams(paramsList) { return paramsList.every(function (param) { return param.type === "Identifier"; }) && paramsList.length !== new Set(paramsList.map(function (param) { return param.name; })).size; } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require arrow functions as callbacks", category: "ECMAScript 6", recommended: false }, schema: [{ type: "object", properties: { allowNamedFunctions: { type: "boolean" }, allowUnboundThis: { type: "boolean" } }, additionalProperties: false }], fixable: "code" }, create: function create(context) { var options = context.options[0] || {}; var allowUnboundThis = options.allowUnboundThis !== false; // default to true var allowNamedFunctions = options.allowNamedFunctions; var sourceCode = context.getSourceCode(); /* * {Array<{this: boolean, super: boolean, meta: boolean}>} * - this - A flag which shows there are one or more ThisExpression. * - super - A flag which shows there are one or more Super. * - meta - A flag which shows there are one or more MethProperty. */ var stack = []; /** * Pushes new function scope with all `false` flags. * @returns {void} */ function enterScope() { stack.push({ this: false, super: false, meta: false }); } /** * Pops a function scope from the stack. * @returns {{this: boolean, super: boolean, meta: boolean}} The information of the last scope. */ function exitScope() { return stack.pop(); } return { // Reset internal state. Program: function Program() { stack = []; }, // If there are below, it cannot replace with arrow functions merely. ThisExpression: function ThisExpression() { var info = stack[stack.length - 1]; if (info) { info.this = true; } }, Super: function Super() { var info = stack[stack.length - 1]; if (info) { info.super = true; } }, MetaProperty: function MetaProperty(node) { var info = stack[stack.length - 1]; if (info && checkMetaProperty(node, "new", "target")) { info.meta = true; } }, // To skip nested scopes. FunctionDeclaration: enterScope, "FunctionDeclaration:exit": exitScope, // Main. FunctionExpression: enterScope, "FunctionExpression:exit": function FunctionExpressionExit(node) { var scopeInfo = exitScope(); // Skip named function expressions if (allowNamedFunctions && node.id && node.id.name) { return; } // Skip generators. if (node.generator) { return; } // Skip recursive functions. var nameVar = context.getDeclaredVariables(node)[0]; if (isFunctionName(nameVar) && nameVar.references.length > 0) { return; } // Skip if it's using arguments. var variable = getVariableOfArguments(context.getScope()); if (variable && variable.references.length > 0) { return; } // Reports if it's a callback which can replace with arrows. var callbackInfo = getCallbackInfo(node); if (callbackInfo.isCallback && (!allowUnboundThis || !scopeInfo.this || callbackInfo.isLexicalThis) && !scopeInfo.super && !scopeInfo.meta) { context.report({ node: node, message: "Unexpected function expression.", fix: function fix(fixer) { if (!callbackInfo.isLexicalThis && scopeInfo.this || hasDuplicateParams(node.params)) { // If the callback function does not have .bind(this) and contains a reference to `this`, there // is no way to determine what `this` should be, so don't perform any fixes. // If the callback function has duplicates in its list of parameters (possible in sloppy mode), // don't replace it with an arrow function, because this is a SyntaxError with arrow functions. return null; } var paramsLeftParen = node.params.length ? sourceCode.getTokenBefore(node.params[0]) : sourceCode.getTokenBefore(node.body, 1); var paramsRightParen = sourceCode.getTokenBefore(node.body); var asyncKeyword = node.async ? "async " : ""; var paramsFullText = sourceCode.text.slice(paramsLeftParen.range[0], paramsRightParen.range[1]); var arrowFunctionText = "" + asyncKeyword + paramsFullText + " => " + sourceCode.getText(node.body); /* * If the callback function has `.bind(this)`, replace it with an arrow function and remove the binding. * Otherwise, just replace the arrow function itself. */ var replacedNode = callbackInfo.isLexicalThis ? node.parent.parent : node; /* * If the replaced node is part of a BinaryExpression, LogicalExpression, or MemberExpression, then * the arrow function needs to be parenthesized, because `foo || () => {}` is invalid syntax even * though `foo || function() {}` is valid. */ var needsParens = replacedNode.parent.type !== "CallExpression" && replacedNode.parent.type !== "ConditionalExpression"; var replacementText = needsParens ? "(" + arrowFunctionText + ")" : arrowFunctionText; return fixer.replaceText(replacedNode, replacementText); } }); } } }; } }; },{}],293:[function(require,module,exports){ /** * @fileoverview A rule to suggest using of const declaration for variables that are never reassigned after declared. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var PATTERN_TYPE = /^(?:.+?Pattern|RestElement|SpreadProperty|ExperimentalRestProperty|Property)$/; var DECLARATION_HOST_TYPE = /^(?:Program|BlockStatement|SwitchCase)$/; var DESTRUCTURING_HOST_TYPE = /^(?:VariableDeclarator|AssignmentExpression)$/; /** * Adds multiple items to the tail of an array. * * @param {any[]} array - A destination to add. * @param {any[]} values - Items to be added. * @returns {void} */ var pushAll = Function.apply.bind(Array.prototype.push); /** * Checks whether a given node is located at `ForStatement.init` or not. * * @param {ASTNode} node - A node to check. * @returns {boolean} `true` if the node is located at `ForStatement.init`. */ function isInitOfForStatement(node) { return node.parent.type === "ForStatement" && node.parent.init === node; } /** * Checks whether a given Identifier node becomes a VariableDeclaration or not. * * @param {ASTNode} identifier - An Identifier node to check. * @returns {boolean} `true` if the node can become a VariableDeclaration. */ function canBecomeVariableDeclaration(identifier) { var node = identifier.parent; while (PATTERN_TYPE.test(node.type)) { node = node.parent; } return node.type === "VariableDeclarator" || node.type === "AssignmentExpression" && node.parent.type === "ExpressionStatement" && DECLARATION_HOST_TYPE.test(node.parent.parent.type); } /** * Gets an identifier node of a given variable. * * If the initialization exists or one or more reading references exist before * the first assignment, the identifier node is the node of the declaration. * Otherwise, the identifier node is the node of the first assignment. * * If the variable should not change to const, this function returns null. * - If the variable is reassigned. * - If the variable is never initialized nor assigned. * - If the variable is initialized in a different scope from the declaration. * - If the unique assignment of the variable cannot change to a declaration. * e.g. `if (a) b = 1` / `return (b = 1)` * - If the variable is declared in the global scope and `eslintUsed` is `true`. * `/*exported foo` directive comment makes such variables. This rule does not * warn such variables because this rule cannot distinguish whether the * exported variables are reassigned or not. * * @param {eslint-scope.Variable} variable - A variable to get. * @param {boolean} ignoreReadBeforeAssign - * The value of `ignoreReadBeforeAssign` option. * @returns {ASTNode|null} * An Identifier node if the variable should change to const. * Otherwise, null. */ function getIdentifierIfShouldBeConst(variable, ignoreReadBeforeAssign) { if (variable.eslintUsed && variable.scope.type === "global") { return null; } // Finds the unique WriteReference. var writer = null; var isReadBeforeInit = false; var references = variable.references; for (var i = 0; i < references.length; ++i) { var reference = references[i]; if (reference.isWrite()) { var isReassigned = writer !== null && writer.identifier !== reference.identifier; if (isReassigned) { return null; } writer = reference; } else if (reference.isRead() && writer === null) { if (ignoreReadBeforeAssign) { return null; } isReadBeforeInit = true; } } // If the assignment is from a different scope, ignore it. // If the assignment cannot change to a declaration, ignore it. var shouldBeConst = writer !== null && writer.from === variable.scope && canBecomeVariableDeclaration(writer.identifier); if (!shouldBeConst) { return null; } if (isReadBeforeInit) { return variable.defs[0].name; } return writer.identifier; } /** * Gets the VariableDeclarator/AssignmentExpression node that a given reference * belongs to. * This is used to detect a mix of reassigned and never reassigned in a * destructuring. * * @param {eslint-scope.Reference} reference - A reference to get. * @returns {ASTNode|null} A VariableDeclarator/AssignmentExpression node or * null. */ function getDestructuringHost(reference) { if (!reference.isWrite()) { return null; } var node = reference.identifier.parent; while (PATTERN_TYPE.test(node.type)) { node = node.parent; } if (!DESTRUCTURING_HOST_TYPE.test(node.type)) { return null; } return node; } /** * Groups by the VariableDeclarator/AssignmentExpression node that each * reference of given variables belongs to. * This is used to detect a mix of reassigned and never reassigned in a * destructuring. * * @param {eslint-scope.Variable[]} variables - Variables to group by destructuring. * @param {boolean} ignoreReadBeforeAssign - * The value of `ignoreReadBeforeAssign` option. * @returns {Map} Grouped identifier nodes. */ function groupByDestructuring(variables, ignoreReadBeforeAssign) { var identifierMap = new Map(); for (var i = 0; i < variables.length; ++i) { var variable = variables[i]; var references = variable.references; var identifier = getIdentifierIfShouldBeConst(variable, ignoreReadBeforeAssign); var prevId = null; for (var j = 0; j < references.length; ++j) { var reference = references[j]; var id = reference.identifier; // Avoid counting a reference twice or more for default values of // destructuring. if (id === prevId) { continue; } prevId = id; // Add the identifier node into the destructuring group. var group = getDestructuringHost(reference); if (group) { if (identifierMap.has(group)) { identifierMap.get(group).push(identifier); } else { identifierMap.set(group, [identifier]); } } } } return identifierMap; } /** * Finds the nearest parent of node with a given type. * * @param {ASTNode} node – The node to search from. * @param {string} type – The type field of the parent node. * @param {Function} shouldStop – a predicate that returns true if the traversal should stop, and false otherwise. * @returns {ASTNode} The closest ancestor with the specified type; null if no such ancestor exists. */ function findUp(node, type, shouldStop) { if (!node || shouldStop(node)) { return null; } if (node.type === type) { return node; } return findUp(node.parent, type, shouldStop); } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require `const` declarations for variables that are never reassigned after declared", category: "ECMAScript 6", recommended: false }, fixable: "code", schema: [{ type: "object", properties: { destructuring: { enum: ["any", "all"] }, ignoreReadBeforeAssign: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var options = context.options[0] || {}; var sourceCode = context.getSourceCode(); var checkingMixedDestructuring = options.destructuring !== "all"; var ignoreReadBeforeAssign = options.ignoreReadBeforeAssign === true; var variables = []; /** * Reports given identifier nodes if all of the nodes should be declared * as const. * * The argument 'nodes' is an array of Identifier nodes. * This node is the result of 'getIdentifierIfShouldBeConst()', so it's * nullable. In simple declaration or assignment cases, the length of * the array is 1. In destructuring cases, the length of the array can * be 2 or more. * * @param {(eslint-scope.Reference|null)[]} nodes - * References which are grouped by destructuring to report. * @returns {void} */ function checkGroup(nodes) { var nodesToReport = nodes.filter(Boolean); if (nodes.length && (checkingMixedDestructuring || nodesToReport.length === nodes.length)) { var varDeclParent = findUp(nodes[0], "VariableDeclaration", function (parentNode) { return parentNode.type.endsWith("Statement"); }); var shouldFix = varDeclParent && // If there are multiple variable declarations, like {let a = 1, b = 2}, then // do not attempt to fix if one of the declarations should be `const`. It's // too hard to know how the developer would want to automatically resolve the issue. varDeclParent.declarations.length === 1 && ( // Don't do a fix unless the variable is initialized (or it's in a for-in or for-of loop) varDeclParent.parent.type === "ForInStatement" || varDeclParent.parent.type === "ForOfStatement" || varDeclParent.declarations[0].init) && // If options.destucturing is "all", then this warning will not occur unless // every assignment in the destructuring should be const. In that case, it's safe // to apply the fix. nodesToReport.length === nodes.length; nodesToReport.forEach(function (node) { context.report({ node: node, message: "'{{name}}' is never reassigned. Use 'const' instead.", data: node, fix: shouldFix ? function (fixer) { return fixer.replaceText(sourceCode.getFirstToken(varDeclParent), "const"); } : null }); }); } } return { "Program:exit": function ProgramExit() { groupByDestructuring(variables, ignoreReadBeforeAssign).forEach(checkGroup); }, VariableDeclaration: function VariableDeclaration(node) { if (node.kind === "let" && !isInitOfForStatement(node)) { pushAll(variables, context.getDeclaredVariables(node)); } } }; } }; },{}],294:[function(require,module,exports){ /** * @fileoverview Prefer destructuring from arrays and objects * @author Alex LaFroscia */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require destructuring from arrays and/or objects", category: "ECMAScript 6", recommended: false }, schema: [{ type: "object", properties: { array: { type: "boolean" }, object: { type: "boolean" } }, additionalProperties: false }, { type: "object", properties: { enforceForRenamedProperties: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var checkArrays = true; var checkObjects = true; var enforceForRenamedProperties = false; var enabledTypes = context.options[0]; var additionalOptions = context.options[1]; if (enabledTypes) { if (typeof enabledTypes.array !== "undefined") { checkArrays = enabledTypes.array; } if (typeof enabledTypes.object !== "undefined") { checkObjects = enabledTypes.object; } } if (additionalOptions) { if (typeof additionalOptions.enforceForRenamedProperties !== "undefined") { enforceForRenamedProperties = additionalOptions.enforceForRenamedProperties; } } //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Determines if the given node node is accessing an array index * * This is used to differentiate array index access from object property * access. * * @param {ASTNode} node the node to evaluate * @returns {boolean} whether or not the node is an integer */ function isArrayIndexAccess(node) { return Number.isInteger(node.property.value); } /** * Report that the given node should use destructuring * * @param {ASTNode} reportNode the node to report * @param {string} type the type of destructuring that should have been done * @returns {void} */ function report(reportNode, type) { context.report({ node: reportNode, message: "Use {{type}} destructuring.", data: { type: type } }); } /** * Check that the `prefer-destructuring` rules are followed based on the * given left- and right-hand side of the assignment. * * Pulled out into a separate method so that VariableDeclarators and * AssignmentExpressions can share the same verification logic. * * @param {ASTNode} leftNode the left-hand side of the assignment * @param {ASTNode} rightNode the right-hand side of the assignment * @param {ASTNode} reportNode the node to report the error on * @returns {void} */ function performCheck(leftNode, rightNode, reportNode) { if (rightNode.type !== "MemberExpression") { return; } if (isArrayIndexAccess(rightNode)) { if (checkArrays) { report(reportNode, "array"); } return; } if (checkObjects && enforceForRenamedProperties) { report(reportNode, "object"); return; } if (checkObjects) { var property = rightNode.property; if (property.type === "Literal" && leftNode.name === property.value || property.type === "Identifier" && leftNode.name === property.name) { report(reportNode, "object"); } } } /** * Check if a given variable declarator is coming from an property access * that should be using destructuring instead * * @param {ASTNode} node the variable declarator to check * @returns {void} */ function checkVariableDeclarator(node) { // Skip if variable is declared without assignment if (!node.init) { return; } // We only care about member expressions past this point if (node.init.type !== "MemberExpression") { return; } performCheck(node.id, node.init, node); } /** * Run the `prefer-destructuring` check on an AssignmentExpression * * @param {ASTNode} node the AssignmentExpression node * @returns {void} */ function checkAssigmentExpression(node) { if (node.operator === "=") { performCheck(node.left, node.right, node); } } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { VariableDeclarator: checkVariableDeclarator, AssignmentExpression: checkAssigmentExpression }; } }; },{}],295:[function(require,module,exports){ /** * @fileoverview Rule to disallow `parseInt()` in favor of binary, octal, and hexadecimal literals * @author Annie Zhang, Henry Zhu */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow `parseInt()` in favor of binary, octal, and hexadecimal literals", category: "ECMAScript 6", recommended: false }, schema: [], fixable: "code" }, create: function create(context) { var radixMap = { 2: "binary", 8: "octal", 16: "hexadecimal" }; var prefixMap = { 2: "0b", 8: "0o", 16: "0x" }; //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { CallExpression: function CallExpression(node) { // doesn't check parseInt() if it doesn't have a radix argument if (node.arguments.length !== 2) { return; } // only error if the radix is 2, 8, or 16 var radixName = radixMap[node.arguments[1].value]; if (node.callee.type === "Identifier" && node.callee.name === "parseInt" && radixName && node.arguments[0].type === "Literal") { context.report({ node: node, message: "Use {{radixName}} literals instead of parseInt().", data: { radixName: radixName }, fix: function fix(fixer) { var newPrefix = prefixMap[node.arguments[1].value]; if (+(newPrefix + node.arguments[0].value) !== parseInt(node.arguments[0].value, node.arguments[1].value)) { // If the newly-produced literal would be invalid, (e.g. 0b1234), // or it would yield an incorrect parseInt result for some other reason, don't make a fix. return null; } return fixer.replaceText(node, prefixMap[node.arguments[1].value] + node.arguments[0].value); } }); } } }; } }; },{}],296:[function(require,module,exports){ /** * @fileoverview restrict values that can be used as Promise rejection reasons * @author Teddy Katz */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require using Error objects as Promise rejection reasons", category: "Best Practices", recommended: false }, fixable: null, schema: [{ type: "object", properties: { allowEmptyReject: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var ALLOW_EMPTY_REJECT = context.options.length && context.options[0].allowEmptyReject; //---------------------------------------------------------------------- // Helpers //---------------------------------------------------------------------- /** * Checks the argument of a reject() or Promise.reject() CallExpression, and reports it if it can't be an Error * @param {ASTNode} callExpression A CallExpression node which is used to reject a Promise * @returns {void} */ function checkRejectCall(callExpression) { if (!callExpression.arguments.length && ALLOW_EMPTY_REJECT) { return; } if (!callExpression.arguments.length || !astUtils.couldBeError(callExpression.arguments[0]) || callExpression.arguments[0].type === "Identifier" && callExpression.arguments[0].name === "undefined") { context.report({ node: callExpression, message: "Expected the Promise rejection reason to be an Error." }); } } /** * Determines whether a function call is a Promise.reject() call * @param {ASTNode} node A CallExpression node * @returns {boolean} `true` if the call is a Promise.reject() call */ function isPromiseRejectCall(node) { return node.callee.type === "MemberExpression" && node.callee.object.type === "Identifier" && node.callee.object.name === "Promise" && node.callee.property.type === "Identifier" && node.callee.property.name === "reject"; } //---------------------------------------------------------------------- // Public //---------------------------------------------------------------------- return { // Check `Promise.reject(value)` calls. CallExpression: function CallExpression(node) { if (isPromiseRejectCall(node)) { checkRejectCall(node); } }, /* * Check for `new Promise((resolve, reject) => {})`, and check for reject() calls. * This function is run on "NewExpression:exit" instead of "NewExpression" to ensure that * the nodes in the expression already have the `parent` property. */ "NewExpression:exit": function NewExpressionExit(node) { if (node.callee.type === "Identifier" && node.callee.name === "Promise" && node.arguments.length && astUtils.isFunction(node.arguments[0]) && node.arguments[0].params.length > 1 && node.arguments[0].params[1].type === "Identifier") { context.getDeclaredVariables(node.arguments[0] /* * Find the first variable that matches the second parameter's name. * If the first parameter has the same name as the second parameter, then the variable will actually * be "declared" when the first parameter is evaluated, but then it will be immediately overwritten * by the second parameter. It's not possible for an expression with the variable to be evaluated before * the variable is overwritten, because functions with duplicate parameters cannot have destructuring or * default assignments in their parameter lists. Therefore, it's not necessary to explicitly account for * this case. */ ).find(function (variable) { return variable.name === node.arguments[0].params[1].name; } // Get the references to that variable. ).references // Only check the references that read the parameter's value. .filter(function (ref) { return ref.isRead(); } // Only check the references that are used as the callee in a function call, e.g. `reject(foo)`. ).filter(function (ref) { return ref.identifier.parent.type === "CallExpression" && ref.identifier === ref.identifier.parent.callee; } // Check the argument of the function call to determine whether it's an Error. ).forEach(function (ref) { return checkRejectCall(ref.identifier.parent); }); } } }; } }; },{"../ast-utils":67}],297:[function(require,module,exports){ /** * @fileoverview Rule to suggest using "Reflect" api over Function/Object methods * @author Keith Cirkel * @deprecated in ESLint v3.9.0 */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require `Reflect` methods where applicable", category: "ECMAScript 6", recommended: false, replacedBy: [] }, deprecated: true, schema: [{ type: "object", properties: { exceptions: { type: "array", items: { enum: ["apply", "call", "delete", "defineProperty", "getOwnPropertyDescriptor", "getPrototypeOf", "setPrototypeOf", "isExtensible", "getOwnPropertyNames", "preventExtensions"] }, uniqueItems: true } }, additionalProperties: false }] }, create: function create(context) { var existingNames = { apply: "Function.prototype.apply", call: "Function.prototype.call", defineProperty: "Object.defineProperty", getOwnPropertyDescriptor: "Object.getOwnPropertyDescriptor", getPrototypeOf: "Object.getPrototypeOf", setPrototypeOf: "Object.setPrototypeOf", isExtensible: "Object.isExtensible", getOwnPropertyNames: "Object.getOwnPropertyNames", preventExtensions: "Object.preventExtensions" }; var reflectSubsitutes = { apply: "Reflect.apply", call: "Reflect.apply", defineProperty: "Reflect.defineProperty", getOwnPropertyDescriptor: "Reflect.getOwnPropertyDescriptor", getPrototypeOf: "Reflect.getPrototypeOf", setPrototypeOf: "Reflect.setPrototypeOf", isExtensible: "Reflect.isExtensible", getOwnPropertyNames: "Reflect.getOwnPropertyNames", preventExtensions: "Reflect.preventExtensions" }; var exceptions = (context.options[0] || {}).exceptions || []; /** * Reports the Reflect violation based on the `existing` and `substitute` * @param {Object} node The node that violates the rule. * @param {string} existing The existing method name that has been used. * @param {string} substitute The Reflect substitute that should be used. * @returns {void} */ function report(node, existing, substitute) { context.report({ node: node, message: "Avoid using {{existing}}, instead use {{substitute}}.", data: { existing: existing, substitute: substitute } }); } return { CallExpression: function CallExpression(node) { var methodName = (node.callee.property || {}).name; var isReflectCall = (node.callee.object || {}).name === "Reflect"; var hasReflectSubsitute = reflectSubsitutes.hasOwnProperty(methodName); var userConfiguredException = exceptions.indexOf(methodName) !== -1; if (hasReflectSubsitute && !isReflectCall && !userConfiguredException) { report(node, existingNames[methodName], reflectSubsitutes[methodName]); } }, UnaryExpression: function UnaryExpression(node) { var isDeleteOperator = node.operator === "delete"; var targetsIdentifier = node.argument.type === "Identifier"; var userConfiguredException = exceptions.indexOf("delete") !== -1; if (isDeleteOperator && !targetsIdentifier && !userConfiguredException) { report(node, "the delete keyword", "Reflect.deleteProperty"); } } }; } }; },{}],298:[function(require,module,exports){ /** * @fileoverview Rule to * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Gets the variable object of `arguments` which is defined implicitly. * @param {eslint-scope.Scope} scope - A scope to get. * @returns {eslint-scope.Variable} The found variable object. */ function getVariableOfArguments(scope) { var variables = scope.variables; for (var i = 0; i < variables.length; ++i) { var variable = variables[i]; if (variable.name === "arguments") { // If there was a parameter which is named "arguments", the implicit "arguments" is not defined. // So does fast return with null. return variable.identifiers.length === 0 ? variable : null; } } /* istanbul ignore next : unreachable */ return null; } /** * Checks if the given reference is not normal member access. * * - arguments .... true // not member access * - arguments[i] .... true // computed member access * - arguments[0] .... true // computed member access * - arguments.length .... false // normal member access * * @param {eslint-scope.Reference} reference - The reference to check. * @returns {boolean} `true` if the reference is not normal member access. */ function isNotNormalMemberAccess(reference) { var id = reference.identifier; var parent = id.parent; return !(parent.type === "MemberExpression" && parent.object === id && !parent.computed); } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require rest parameters instead of `arguments`", category: "ECMAScript 6", recommended: false }, schema: [] }, create: function create(context) { /** * Reports a given reference. * * @param {eslint-scope.Reference} reference - A reference to report. * @returns {void} */ function report(reference) { context.report({ node: reference.identifier, loc: reference.identifier.loc, message: "Use the rest parameters instead of 'arguments'." }); } /** * Reports references of the implicit `arguments` variable if exist. * * @returns {void} */ function checkForArguments() { var argumentsVar = getVariableOfArguments(context.getScope()); if (argumentsVar) { argumentsVar.references.filter(isNotNormalMemberAccess).forEach(report); } } return { "FunctionDeclaration:exit": checkForArguments, "FunctionExpression:exit": checkForArguments }; } }; },{}],299:[function(require,module,exports){ /** * @fileoverview A rule to suggest using of the spread operator instead of `.apply()`. * @author Toru Nagashima */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Checks whether or not a node is a `.apply()` for variadic. * @param {ASTNode} node - A CallExpression node to check. * @returns {boolean} Whether or not the node is a `.apply()` for variadic. */ function isVariadicApplyCalling(node) { return node.callee.type === "MemberExpression" && node.callee.property.type === "Identifier" && node.callee.property.name === "apply" && node.callee.computed === false && node.arguments.length === 2 && node.arguments[1].type !== "ArrayExpression" && node.arguments[1].type !== "SpreadElement"; } /** * Checks whether or not the tokens of two given nodes are same. * @param {ASTNode} left - A node 1 to compare. * @param {ASTNode} right - A node 2 to compare. * @param {SourceCode} sourceCode - The ESLint source code object. * @returns {boolean} the source code for the given node. */ function equalTokens(left, right, sourceCode) { var tokensL = sourceCode.getTokens(left); var tokensR = sourceCode.getTokens(right); if (tokensL.length !== tokensR.length) { return false; } for (var i = 0; i < tokensL.length; ++i) { if (tokensL[i].type !== tokensR[i].type || tokensL[i].value !== tokensR[i].value) { return false; } } return true; } /** * Checks whether or not `thisArg` is not changed by `.apply()`. * @param {ASTNode|null} expectedThis - The node that is the owner of the applied function. * @param {ASTNode} thisArg - The node that is given to the first argument of the `.apply()`. * @param {RuleContext} context - The ESLint rule context object. * @returns {boolean} Whether or not `thisArg` is not changed by `.apply()`. */ function isValidThisArg(expectedThis, thisArg, context) { if (!expectedThis) { return astUtils.isNullOrUndefined(thisArg); } return equalTokens(expectedThis, thisArg, context); } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require spread operators instead of `.apply()`", category: "ECMAScript 6", recommended: false }, schema: [], fixable: "code" }, create: function create(context) { var sourceCode = context.getSourceCode(); return { CallExpression: function CallExpression(node) { if (!isVariadicApplyCalling(node)) { return; } var applied = node.callee.object; var expectedThis = applied.type === "MemberExpression" ? applied.object : null; var thisArg = node.arguments[0]; if (isValidThisArg(expectedThis, thisArg, sourceCode)) { context.report({ node: node, message: "Use the spread operator instead of '.apply()'.", fix: function fix(fixer) { if (expectedThis && expectedThis.type !== "Identifier") { // Don't fix cases where the `this` value could be a computed expression. return null; } var propertyDot = sourceCode.getFirstTokenBetween(applied, node.callee.property, function (token) { return token.value === "."; }); return fixer.replaceTextRange([propertyDot.range[0], node.range[1]], "(..." + sourceCode.getText(node.arguments[1]) + ")"); } }); } } }; } }; },{"../ast-utils":67}],300:[function(require,module,exports){ /** * @fileoverview A rule to suggest using template literals instead of string concatenation. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Checks whether or not a given node is a concatenation. * @param {ASTNode} node - A node to check. * @returns {boolean} `true` if the node is a concatenation. */ function isConcatenation(node) { return node.type === "BinaryExpression" && node.operator === "+"; } /** * Gets the top binary expression node for concatenation in parents of a given node. * @param {ASTNode} node - A node to get. * @returns {ASTNode} the top binary expression node in parents of a given node. */ function getTopConcatBinaryExpression(node) { while (isConcatenation(node.parent)) { node = node.parent; } return node; } /** * Checks whether or not a given binary expression has string literals. * @param {ASTNode} node - A node to check. * @returns {boolean} `true` if the node has string literals. */ function hasStringLiteral(node) { if (isConcatenation(node)) { // `left` is deeper than `right` normally. return hasStringLiteral(node.right) || hasStringLiteral(node.left); } return astUtils.isStringLiteral(node); } /** * Checks whether or not a given binary expression has non string literals. * @param {ASTNode} node - A node to check. * @returns {boolean} `true` if the node has non string literals. */ function hasNonStringLiteral(node) { if (isConcatenation(node)) { // `left` is deeper than `right` normally. return hasNonStringLiteral(node.right) || hasNonStringLiteral(node.left); } return !astUtils.isStringLiteral(node); } /** * Determines whether a given node will start with a template curly expression (`${}`) when being converted to a template literal. * @param {ASTNode} node The node that will be fixed to a template literal * @returns {boolean} `true` if the node will start with a template curly. */ function startsWithTemplateCurly(node) { if (node.type === "BinaryExpression") { return startsWithTemplateCurly(node.left); } if (node.type === "TemplateLiteral") { return node.expressions.length && node.quasis.length && node.quasis[0].start === node.quasis[0].end; } return node.type !== "Literal" || typeof node.value !== "string"; } /** * Determines whether a given node end with a template curly expression (`${}`) when being converted to a template literal. * @param {ASTNode} node The node that will be fixed to a template literal * @returns {boolean} `true` if the node will end with a template curly. */ function endsWithTemplateCurly(node) { if (node.type === "BinaryExpression") { return startsWithTemplateCurly(node.right); } if (node.type === "TemplateLiteral") { return node.expressions.length && node.quasis.length && node.quasis[node.quasis.length - 1].start === node.quasis[node.quasis.length - 1].end; } return node.type !== "Literal" || typeof node.value !== "string"; } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require template literals instead of string concatenation", category: "ECMAScript 6", recommended: false }, schema: [], fixable: "code" }, create: function create(context) { var sourceCode = context.getSourceCode(); var done = Object.create(null); /** * Gets the non-token text between two nodes, ignoring any other tokens that appear between the two tokens. * @param {ASTNode} node1 The first node * @param {ASTNode} node2 The second node * @returns {string} The text between the nodes, excluding other tokens */ function getTextBetween(node1, node2) { var allTokens = [node1].concat(sourceCode.getTokensBetween(node1, node2)).concat(node2); var sourceText = sourceCode.getText(); return allTokens.slice(0, -1).reduce(function (accumulator, token, index) { return accumulator + sourceText.slice(token.range[1], allTokens[index + 1].range[0]); }, ""); } /** * Returns a template literal form of the given node. * @param {ASTNode} currentNode A node that should be converted to a template literal * @param {string} textBeforeNode Text that should appear before the node * @param {string} textAfterNode Text that should appear after the node * @returns {string} A string form of this node, represented as a template literal */ function getTemplateLiteral(currentNode, textBeforeNode, textAfterNode) { if (currentNode.type === "Literal" && typeof currentNode.value === "string") { // If the current node is a string literal, escape any instances of ${ or ` to prevent them from being interpreted // as a template placeholder. However, if the code already contains a backslash before the ${ or ` // for some reason, don't add another backslash, because that would change the meaning of the code (it would cause // an actual backslash character to appear before the dollar sign). return "`" + currentNode.raw.slice(1, -1).replace(/\\*(\${|`)/g, function (matched) { if (matched.lastIndexOf("\\") % 2) { return "\\" + matched; } return matched; // Unescape any quotes that appear in the original Literal that no longer need to be escaped. }).replace(new RegExp("\\\\" + currentNode.raw[0], "g"), currentNode.raw[0]) + "`"; } if (currentNode.type === "TemplateLiteral") { return sourceCode.getText(currentNode); } if (isConcatenation(currentNode) && hasStringLiteral(currentNode) && hasNonStringLiteral(currentNode)) { var plusSign = sourceCode.getFirstTokenBetween(currentNode.left, currentNode.right, function (token) { return token.value === "+"; }); var textBeforePlus = getTextBetween(currentNode.left, plusSign); var textAfterPlus = getTextBetween(plusSign, currentNode.right); var leftEndsWithCurly = endsWithTemplateCurly(currentNode.left); var rightStartsWithCurly = startsWithTemplateCurly(currentNode.right); if (leftEndsWithCurly) { // If the left side of the expression ends with a template curly, add the extra text to the end of the curly bracket. // `foo${bar}` /* comment */ + 'baz' --> `foo${bar /* comment */ }${baz}` return getTemplateLiteral(currentNode.left, textBeforeNode, textBeforePlus + textAfterPlus).slice(0, -1) + getTemplateLiteral(currentNode.right, null, textAfterNode).slice(1); } if (rightStartsWithCurly) { // Otherwise, if the right side of the expression starts with a template curly, add the text there. // 'foo' /* comment */ + `${bar}baz` --> `foo${ /* comment */ bar}baz` return getTemplateLiteral(currentNode.left, textBeforeNode, null).slice(0, -1) + getTemplateLiteral(currentNode.right, textBeforePlus + textAfterPlus, textAfterNode).slice(1); } // Otherwise, these nodes should not be combined into a template curly, since there is nowhere to put // the text between them. return "" + getTemplateLiteral(currentNode.left, textBeforeNode, null) + textBeforePlus + "+" + textAfterPlus + getTemplateLiteral(currentNode.right, textAfterNode, null); } return "`${" + (textBeforeNode || "") + sourceCode.getText(currentNode) + (textAfterNode || "") + "}`"; } /** * Reports if a given node is string concatenation with non string literals. * * @param {ASTNode} node - A node to check. * @returns {void} */ function checkForStringConcat(node) { if (!astUtils.isStringLiteral(node) || !isConcatenation(node.parent)) { return; } var topBinaryExpr = getTopConcatBinaryExpression(node.parent); // Checks whether or not this node had been checked already. if (done[topBinaryExpr.range[0]]) { return; } done[topBinaryExpr.range[0]] = true; if (hasNonStringLiteral(topBinaryExpr)) { context.report({ node: topBinaryExpr, message: "Unexpected string concatenation.", fix: function fix(fixer) { return fixer.replaceText(topBinaryExpr, getTemplateLiteral(topBinaryExpr, null, null)); } }); } } return { Program: function Program() { done = Object.create(null); }, Literal: checkForStringConcat, TemplateLiteral: checkForStringConcat }; } }; },{"../ast-utils":67}],301:[function(require,module,exports){ /** * @fileoverview Rule to flag non-quoted property names in object literals. * @author Mathias Bynens */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var espree = require("espree"), keywords = require("../util/keywords"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require quotes around object literal property names", category: "Stylistic Issues", recommended: false }, schema: { anyOf: [{ type: "array", items: [{ enum: ["always", "as-needed", "consistent", "consistent-as-needed"] }], minItems: 0, maxItems: 1 }, { type: "array", items: [{ enum: ["always", "as-needed", "consistent", "consistent-as-needed"] }, { type: "object", properties: { keywords: { type: "boolean" }, unnecessary: { type: "boolean" }, numbers: { type: "boolean" } }, additionalProperties: false }], minItems: 0, maxItems: 2 }] }, fixable: "code" }, create: function create(context) { var MODE = context.options[0], KEYWORDS = context.options[1] && context.options[1].keywords, CHECK_UNNECESSARY = !context.options[1] || context.options[1].unnecessary !== false, NUMBERS = context.options[1] && context.options[1].numbers, MESSAGE_UNNECESSARY = "Unnecessarily quoted property '{{property}}' found.", MESSAGE_UNQUOTED = "Unquoted property '{{property}}' found.", MESSAGE_NUMERIC = "Unquoted number literal '{{property}}' used as key.", MESSAGE_RESERVED = "Unquoted reserved word '{{property}}' used as key.", sourceCode = context.getSourceCode(); /** * Checks whether a certain string constitutes an ES3 token * @param {string} tokenStr - The string to be checked. * @returns {boolean} `true` if it is an ES3 token. */ function isKeyword(tokenStr) { return keywords.indexOf(tokenStr) >= 0; } /** * Checks if an espree-tokenized key has redundant quotes (i.e. whether quotes are unnecessary) * @param {string} rawKey The raw key value from the source * @param {espreeTokens} tokens The espree-tokenized node key * @param {boolean} [skipNumberLiterals=false] Indicates whether number literals should be checked * @returns {boolean} Whether or not a key has redundant quotes. * @private */ function areQuotesRedundant(rawKey, tokens, skipNumberLiterals) { return tokens.length === 1 && tokens[0].start === 0 && tokens[0].end === rawKey.length && (["Identifier", "Keyword", "Null", "Boolean"].indexOf(tokens[0].type) >= 0 || tokens[0].type === "Numeric" && !skipNumberLiterals && String(+tokens[0].value) === tokens[0].value); } /** * Returns a string representation of a property node with quotes removed * @param {ASTNode} key Key AST Node, which may or may not be quoted * @returns {string} A replacement string for this property */ function getUnquotedKey(key) { return key.type === "Identifier" ? key.name : key.value; } /** * Returns a string representation of a property node with quotes added * @param {ASTNode} key Key AST Node, which may or may not be quoted * @returns {string} A replacement string for this property */ function getQuotedKey(key) { if (key.type === "Literal" && typeof key.value === "string") { // If the key is already a string literal, don't replace the quotes with double quotes. return sourceCode.getText(key); } // Otherwise, the key is either an identifier or a number literal. return "\"" + (key.type === "Identifier" ? key.name : key.value) + "\""; } /** * Ensures that a property's key is quoted only when necessary * @param {ASTNode} node Property AST node * @returns {void} */ function checkUnnecessaryQuotes(node) { var key = node.key; var tokens = void 0; if (node.method || node.computed || node.shorthand) { return; } if (key.type === "Literal" && typeof key.value === "string") { try { tokens = espree.tokenize(key.value); } catch (e) { return; } if (tokens.length !== 1) { return; } var isKeywordToken = isKeyword(tokens[0].value); if (isKeywordToken && KEYWORDS) { return; } if (CHECK_UNNECESSARY && areQuotesRedundant(key.value, tokens, NUMBERS)) { context.report({ node: node, message: MESSAGE_UNNECESSARY, data: { property: key.value }, fix: function fix(fixer) { return fixer.replaceText(key, getUnquotedKey(key)); } }); } } else if (KEYWORDS && key.type === "Identifier" && isKeyword(key.name)) { context.report({ node: node, message: MESSAGE_RESERVED, data: { property: key.name }, fix: function fix(fixer) { return fixer.replaceText(key, getQuotedKey(key)); } }); } else if (NUMBERS && key.type === "Literal" && typeof key.value === "number") { context.report({ node: node, message: MESSAGE_NUMERIC, data: { property: key.value }, fix: function fix(fixer) { return fixer.replaceText(key, getQuotedKey(key)); } }); } } /** * Ensures that a property's key is quoted * @param {ASTNode} node Property AST node * @returns {void} */ function checkOmittedQuotes(node) { var key = node.key; if (!node.method && !node.computed && !node.shorthand && !(key.type === "Literal" && typeof key.value === "string")) { context.report({ node: node, message: MESSAGE_UNQUOTED, data: { property: key.name || key.value }, fix: function fix(fixer) { return fixer.replaceText(key, getQuotedKey(key)); } }); } } /** * Ensures that an object's keys are consistently quoted, optionally checks for redundancy of quotes * @param {ASTNode} node Property AST node * @param {boolean} checkQuotesRedundancy Whether to check quotes' redundancy * @returns {void} */ function checkConsistency(node, checkQuotesRedundancy) { var quotedProps = [], unquotedProps = []; var keywordKeyName = null, necessaryQuotes = false; node.properties.forEach(function (property) { var key = property.key; var tokens = void 0; if (!key || property.method || property.computed || property.shorthand) { return; } if (key.type === "Literal" && typeof key.value === "string") { quotedProps.push(property); if (checkQuotesRedundancy) { try { tokens = espree.tokenize(key.value); } catch (e) { necessaryQuotes = true; return; } necessaryQuotes = necessaryQuotes || !areQuotesRedundant(key.value, tokens) || KEYWORDS && isKeyword(tokens[0].value); } } else if (KEYWORDS && checkQuotesRedundancy && key.type === "Identifier" && isKeyword(key.name)) { unquotedProps.push(property); necessaryQuotes = true; keywordKeyName = key.name; } else { unquotedProps.push(property); } }); if (checkQuotesRedundancy && quotedProps.length && !necessaryQuotes) { quotedProps.forEach(function (property) { context.report({ node: property, message: "Properties shouldn't be quoted as all quotes are redundant.", fix: function fix(fixer) { return fixer.replaceText(property.key, getUnquotedKey(property.key)); } }); }); } else if (unquotedProps.length && keywordKeyName) { unquotedProps.forEach(function (property) { context.report({ node: property, message: "Properties should be quoted as '{{property}}' is a reserved word.", data: { property: keywordKeyName }, fix: function fix(fixer) { return fixer.replaceText(property.key, getQuotedKey(property.key)); } }); }); } else if (quotedProps.length && unquotedProps.length) { unquotedProps.forEach(function (property) { context.report({ node: property, message: "Inconsistently quoted property '{{key}}' found.", data: { key: property.key.name || property.key.value }, fix: function fix(fixer) { return fixer.replaceText(property.key, getQuotedKey(property.key)); } }); }); } } return { Property: function Property(node) { if (MODE === "always" || !MODE) { checkOmittedQuotes(node); } if (MODE === "as-needed") { checkUnnecessaryQuotes(node); } }, ObjectExpression: function ObjectExpression(node) { if (MODE === "consistent") { checkConsistency(node, false); } if (MODE === "consistent-as-needed") { checkConsistency(node, true); } } }; } }; },{"../util/keywords":349,"espree":"espree"}],302:[function(require,module,exports){ /** * @fileoverview A rule to choose between single and double quote marks * @author Matt DuVall , Brandon Payton */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _templateObject = _taggedTemplateLiteral(["(^|[^\\])(\\\\)*[", "]"], ["(^|[^\\\\])(\\\\\\\\)*[", "]"]); function _taggedTemplateLiteral(strings, raw) { return Object.freeze(Object.defineProperties(strings, { raw: { value: Object.freeze(raw) } })); } var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Constants //------------------------------------------------------------------------------ var QUOTE_SETTINGS = { double: { quote: "\"", alternateQuote: "'", description: "doublequote" }, single: { quote: "'", alternateQuote: "\"", description: "singlequote" }, backtick: { quote: "`", alternateQuote: "\"", description: "backtick" } }; // An unescaped newline is a newline preceded by an even number of backslashes. var UNESCAPED_LINEBREAK_PATTERN = new RegExp(String.raw(_templateObject, Array.from(astUtils.LINEBREAKS).join(""))); /** * Switches quoting of javascript string between ' " and ` * escaping and unescaping as necessary. * Only escaping of the minimal set of characters is changed. * Note: escaping of newlines when switching from backtick to other quotes is not handled. * @param {string} str - A string to convert. * @returns {string} The string with changed quotes. * @private */ QUOTE_SETTINGS.double.convert = QUOTE_SETTINGS.single.convert = QUOTE_SETTINGS.backtick.convert = function (str) { var newQuote = this.quote; var oldQuote = str[0]; if (newQuote === oldQuote) { return str; } return newQuote + str.slice(1, -1).replace(/\\(\${|\r\n?|\n|.)|["'`]|\${|(\r\n?|\n)/g, function (match, escaped, newline) { if (escaped === oldQuote || oldQuote === "`" && escaped === "${") { return escaped; // unescape } if (match === newQuote || newQuote === "`" && match === "${") { return "\\" + match; // escape } if (newline && oldQuote === "`") { return "\\n"; // escape newlines } return match; }) + newQuote; }; var AVOID_ESCAPE = "avoid-escape"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce the consistent use of either backticks, double, or single quotes", category: "Stylistic Issues", recommended: false }, fixable: "code", schema: [{ enum: ["single", "double", "backtick"] }, { anyOf: [{ enum: ["avoid-escape"] }, { type: "object", properties: { avoidEscape: { type: "boolean" }, allowTemplateLiterals: { type: "boolean" } }, additionalProperties: false }] }] }, create: function create(context) { var quoteOption = context.options[0], settings = QUOTE_SETTINGS[quoteOption || "double"], options = context.options[1], allowTemplateLiterals = options && options.allowTemplateLiterals === true, sourceCode = context.getSourceCode(); var avoidEscape = options && options.avoidEscape === true; // deprecated if (options === AVOID_ESCAPE) { avoidEscape = true; } /** * Determines if a given node is part of JSX syntax. * * This function returns `true` in the following cases: * * - `
` ... If the literal is an attribute value, the parent of the literal is `JSXAttribute`. * - `
foo
` ... If the literal is a text content, the parent of the literal is `JSXElement`. * * In particular, this function returns `false` in the following cases: * * - `
` * - `
{"foo"}
` * * In both cases, inside of the braces is handled as normal JavaScript. * The braces are `JSXExpressionContainer` nodes. * * @param {ASTNode} node The Literal node to check. * @returns {boolean} True if the node is a part of JSX, false if not. * @private */ function isJSXLiteral(node) { return node.parent.type === "JSXAttribute" || node.parent.type === "JSXElement"; } /** * Checks whether or not a given node is a directive. * The directive is a `ExpressionStatement` which has only a string literal. * @param {ASTNode} node - A node to check. * @returns {boolean} Whether or not the node is a directive. * @private */ function isDirective(node) { return node.type === "ExpressionStatement" && node.expression.type === "Literal" && typeof node.expression.value === "string"; } /** * Checks whether or not a given node is a part of directive prologues. * See also: http://www.ecma-international.org/ecma-262/6.0/#sec-directive-prologues-and-the-use-strict-directive * @param {ASTNode} node - A node to check. * @returns {boolean} Whether or not the node is a part of directive prologues. * @private */ function isPartOfDirectivePrologue(node) { var block = node.parent.parent; if (block.type !== "Program" && (block.type !== "BlockStatement" || !astUtils.isFunction(block.parent))) { return false; } // Check the node is at a prologue. for (var i = 0; i < block.body.length; ++i) { var statement = block.body[i]; if (statement === node.parent) { return true; } if (!isDirective(statement)) { break; } } return false; } /** * Checks whether or not a given node is allowed as non backtick. * @param {ASTNode} node - A node to check. * @returns {boolean} Whether or not the node is allowed as non backtick. * @private */ function isAllowedAsNonBacktick(node) { var parent = node.parent; switch (parent.type) { // Directive Prologues. case "ExpressionStatement": return isPartOfDirectivePrologue(node); // LiteralPropertyName. case "Property": case "MethodDefinition": return parent.key === node && !parent.computed; // ModuleSpecifier. case "ImportDeclaration": case "ExportNamedDeclaration": case "ExportAllDeclaration": return parent.source === node; // Others don't allow. default: return false; } } return { Literal: function Literal(node) { var val = node.value, rawVal = node.raw; var isValid = void 0; if (settings && typeof val === "string") { isValid = quoteOption === "backtick" && isAllowedAsNonBacktick(node) || isJSXLiteral(node) || astUtils.isSurroundedBy(rawVal, settings.quote); if (!isValid && avoidEscape) { isValid = astUtils.isSurroundedBy(rawVal, settings.alternateQuote) && rawVal.indexOf(settings.quote) >= 0; } if (!isValid) { context.report({ node: node, message: "Strings must use {{description}}.", data: { description: settings.description }, fix: function fix(fixer) { return fixer.replaceText(node, settings.convert(node.raw)); } }); } } }, TemplateLiteral: function TemplateLiteral(node) { // If backticks are expected or it's a tagged template, then this shouldn't throw an errors if (allowTemplateLiterals || quoteOption === "backtick" || node.parent.type === "TaggedTemplateExpression" && node === node.parent.quasi) { return; } // A warning should be produced if the template literal only has one TemplateElement, and has no unescaped newlines. var shouldWarn = node.quasis.length === 1 && !UNESCAPED_LINEBREAK_PATTERN.test(node.quasis[0].value.raw); if (shouldWarn) { context.report({ node: node, message: "Strings must use {{description}}.", data: { description: settings.description }, fix: function fix(fixer) { if (isPartOfDirectivePrologue(node)) { /* * TemplateLiterals in a directive prologue aren't actually directives, but if they're * in the directive prologue, then fixing them might turn them into directives and change * the behavior of the code. */ return null; } return fixer.replaceText(node, settings.convert(sourceCode.getText(node))); } }); } } }; } }; },{"../ast-utils":67}],303:[function(require,module,exports){ /** * @fileoverview Rule to flag use of parseInt without a radix argument * @author James Allardice */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var MODE_ALWAYS = "always", MODE_AS_NEEDED = "as-needed"; /** * Checks whether a given variable is shadowed or not. * * @param {eslint-scope.Variable} variable - A variable to check. * @returns {boolean} `true` if the variable is shadowed. */ function isShadowed(variable) { return variable.defs.length >= 1; } /** * Checks whether a given node is a MemberExpression of `parseInt` method or not. * * @param {ASTNode} node - A node to check. * @returns {boolean} `true` if the node is a MemberExpression of `parseInt` * method. */ function isParseIntMethod(node) { return node.type === "MemberExpression" && !node.computed && node.property.type === "Identifier" && node.property.name === "parseInt"; } /** * Checks whether a given node is a valid value of radix or not. * * The following values are invalid. * * - A literal except numbers. * - undefined. * * @param {ASTNode} radix - A node of radix to check. * @returns {boolean} `true` if the node is valid. */ function isValidRadix(radix) { return !(radix.type === "Literal" && typeof radix.value !== "number" || radix.type === "Identifier" && radix.name === "undefined"); } /** * Checks whether a given node is a default value of radix or not. * * @param {ASTNode} radix - A node of radix to check. * @returns {boolean} `true` if the node is the literal node of `10`. */ function isDefaultRadix(radix) { return radix.type === "Literal" && radix.value === 10; } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce the consistent use of the radix argument when using `parseInt()`", category: "Best Practices", recommended: false }, schema: [{ enum: ["always", "as-needed"] }] }, create: function create(context) { var mode = context.options[0] || MODE_ALWAYS; /** * Checks the arguments of a given CallExpression node and reports it if it * offends this rule. * * @param {ASTNode} node - A CallExpression node to check. * @returns {void} */ function checkArguments(node) { var args = node.arguments; switch (args.length) { case 0: context.report({ node: node, message: "Missing parameters." }); break; case 1: if (mode === MODE_ALWAYS) { context.report({ node: node, message: "Missing radix parameter." }); } break; default: if (mode === MODE_AS_NEEDED && isDefaultRadix(args[1])) { context.report({ node: node, message: "Redundant radix parameter." }); } else if (!isValidRadix(args[1])) { context.report({ node: node, message: "Invalid radix parameter." }); } break; } } return { "Program:exit": function ProgramExit() { var scope = context.getScope(); var variable = void 0; // Check `parseInt()` variable = astUtils.getVariableByName(scope, "parseInt"); if (!isShadowed(variable)) { variable.references.forEach(function (reference) { var node = reference.identifier; if (astUtils.isCallee(node)) { checkArguments(node.parent); } }); } // Check `Number.parseInt()` variable = astUtils.getVariableByName(scope, "Number"); if (!isShadowed(variable)) { variable.references.forEach(function (reference) { var node = reference.identifier.parent; if (isParseIntMethod(node) && astUtils.isCallee(node)) { checkArguments(node.parent); } }); } } }; } }; },{"../ast-utils":67}],304:[function(require,module,exports){ /** * @fileoverview Rule to disallow async functions which have no `await` expression. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Capitalize the 1st letter of the given text. * * @param {string} text - The text to capitalize. * @returns {string} The text that the 1st letter was capitalized. */ function capitalizeFirstLetter(text) { return text[0].toUpperCase() + text.slice(1); } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "disallow async functions which have no `await` expression", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { var sourceCode = context.getSourceCode(); var scopeInfo = null; /** * Push the scope info object to the stack. * * @returns {void} */ function enterFunction() { scopeInfo = { upper: scopeInfo, hasAwait: false }; } /** * Pop the top scope info object from the stack. * Also, it reports the function if needed. * * @param {ASTNode} node - The node to report. * @returns {void} */ function exitFunction(node) { if (node.async && !scopeInfo.hasAwait && !astUtils.isEmptyFunction(node)) { context.report({ node: node, loc: astUtils.getFunctionHeadLoc(node, sourceCode), message: "{{name}} has no 'await' expression.", data: { name: capitalizeFirstLetter(astUtils.getFunctionNameWithKind(node)) } }); } scopeInfo = scopeInfo.upper; } return { FunctionDeclaration: enterFunction, FunctionExpression: enterFunction, ArrowFunctionExpression: enterFunction, "FunctionDeclaration:exit": exitFunction, "FunctionExpression:exit": exitFunction, "ArrowFunctionExpression:exit": exitFunction, AwaitExpression: function AwaitExpression() { scopeInfo.hasAwait = true; } }; } }; },{"../ast-utils":67}],305:[function(require,module,exports){ /** * @fileoverview Rule to check for jsdoc presence. * @author Gyandeep Singh */ "use strict"; module.exports = { meta: { docs: { description: "require JSDoc comments", category: "Stylistic Issues", recommended: false }, schema: [{ type: "object", properties: { require: { type: "object", properties: { ClassDeclaration: { type: "boolean" }, MethodDefinition: { type: "boolean" }, FunctionDeclaration: { type: "boolean" }, ArrowFunctionExpression: { type: "boolean" } }, additionalProperties: false } }, additionalProperties: false }] }, create: function create(context) { var source = context.getSourceCode(); var DEFAULT_OPTIONS = { FunctionDeclaration: true, MethodDefinition: false, ClassDeclaration: false }; var options = Object.assign(DEFAULT_OPTIONS, context.options[0] && context.options[0].require || {}); /** * Report the error message * @param {ASTNode} node node to report * @returns {void} */ function report(node) { context.report({ node: node, message: "Missing JSDoc comment." }); } /** * Check if the jsdoc comment is present for class methods * @param {ASTNode} node node to examine * @returns {void} */ function checkClassMethodJsDoc(node) { if (node.parent.type === "MethodDefinition") { var jsdocComment = source.getJSDocComment(node); if (!jsdocComment) { report(node); } } } /** * Check if the jsdoc comment is present or not. * @param {ASTNode} node node to examine * @returns {void} */ function checkJsDoc(node) { var jsdocComment = source.getJSDocComment(node); if (!jsdocComment) { report(node); } } return { FunctionDeclaration: function FunctionDeclaration(node) { if (options.FunctionDeclaration) { checkJsDoc(node); } }, FunctionExpression: function FunctionExpression(node) { if (options.MethodDefinition) { checkClassMethodJsDoc(node); } }, ClassDeclaration: function ClassDeclaration(node) { if (options.ClassDeclaration) { checkJsDoc(node); } }, ArrowFunctionExpression: function ArrowFunctionExpression(node) { if (options.ArrowFunctionExpression && node.parent.type === "VariableDeclarator") { checkJsDoc(node); } } }; } }; },{}],306:[function(require,module,exports){ /** * @fileoverview Rule to flag the generator functions that does not have yield. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require generator functions to contain `yield`", category: "ECMAScript 6", recommended: true }, schema: [] }, create: function create(context) { var stack = []; /** * If the node is a generator function, start counting `yield` keywords. * @param {Node} node - A function node to check. * @returns {void} */ function beginChecking(node) { if (node.generator) { stack.push(0); } } /** * If the node is a generator function, end counting `yield` keywords, then * reports result. * @param {Node} node - A function node to check. * @returns {void} */ function endChecking(node) { if (!node.generator) { return; } var countYield = stack.pop(); if (countYield === 0 && node.body.body.length > 0) { context.report({ node: node, message: "This generator function does not have 'yield'." }); } } return { FunctionDeclaration: beginChecking, "FunctionDeclaration:exit": endChecking, FunctionExpression: beginChecking, "FunctionExpression:exit": endChecking, // Increases the count of `yield` keyword. YieldExpression: function YieldExpression() { /* istanbul ignore else */ if (stack.length > 0) { stack[stack.length - 1] += 1; } } }; } }; },{}],307:[function(require,module,exports){ /** * @fileoverview Enforce spacing between rest and spread operators and their expressions. * @author Kai Cataldo */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce spacing between rest and spread operators and their expressions", category: "ECMAScript 6", recommended: false }, fixable: "whitespace", schema: [{ enum: ["always", "never"] }] }, create: function create(context) { var sourceCode = context.getSourceCode(), alwaysSpace = context.options[0] === "always"; //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Checks whitespace between rest/spread operators and their expressions * @param {ASTNode} node - The node to check * @returns {void} */ function checkWhiteSpace(node) { var operator = sourceCode.getFirstToken(node), nextToken = sourceCode.getTokenAfter(operator), hasWhitespace = sourceCode.isSpaceBetweenTokens(operator, nextToken); var type = void 0; switch (node.type) { case "SpreadElement": type = "spread"; break; case "RestElement": type = "rest"; break; case "ExperimentalSpreadProperty": type = "spread property"; break; case "ExperimentalRestProperty": type = "rest property"; break; default: return; } if (alwaysSpace && !hasWhitespace) { context.report({ node: node, loc: { line: operator.loc.end.line, column: operator.loc.end.column }, message: "Expected whitespace after {{type}} operator.", data: { type: type }, fix: function fix(fixer) { return fixer.replaceTextRange([operator.range[1], nextToken.range[0]], " "); } }); } else if (!alwaysSpace && hasWhitespace) { context.report({ node: node, loc: { line: operator.loc.end.line, column: operator.loc.end.column }, message: "Unexpected whitespace after {{type}} operator.", data: { type: type }, fix: function fix(fixer) { return fixer.removeRange([operator.range[1], nextToken.range[0]]); } }); } } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { SpreadElement: checkWhiteSpace, RestElement: checkWhiteSpace, ExperimentalSpreadProperty: checkWhiteSpace, ExperimentalRestProperty: checkWhiteSpace }; } }; },{}],308:[function(require,module,exports){ /** * @fileoverview Validates spacing before and after semicolon * @author Mathias Schreck */ "use strict"; var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce consistent spacing before and after semicolons", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ type: "object", properties: { before: { type: "boolean" }, after: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var config = context.options[0], sourceCode = context.getSourceCode(); var requireSpaceBefore = false, requireSpaceAfter = true; if ((typeof config === "undefined" ? "undefined" : _typeof(config)) === "object") { if (config.hasOwnProperty("before")) { requireSpaceBefore = config.before; } if (config.hasOwnProperty("after")) { requireSpaceAfter = config.after; } } /** * Checks if a given token has leading whitespace. * @param {Object} token The token to check. * @returns {boolean} True if the given token has leading space, false if not. */ function hasLeadingSpace(token) { var tokenBefore = sourceCode.getTokenBefore(token); return tokenBefore && astUtils.isTokenOnSameLine(tokenBefore, token) && sourceCode.isSpaceBetweenTokens(tokenBefore, token); } /** * Checks if a given token has trailing whitespace. * @param {Object} token The token to check. * @returns {boolean} True if the given token has trailing space, false if not. */ function hasTrailingSpace(token) { var tokenAfter = sourceCode.getTokenAfter(token); return tokenAfter && astUtils.isTokenOnSameLine(token, tokenAfter) && sourceCode.isSpaceBetweenTokens(token, tokenAfter); } /** * Checks if the given token is the last token in its line. * @param {Token} token The token to check. * @returns {boolean} Whether or not the token is the last in its line. */ function isLastTokenInCurrentLine(token) { var tokenAfter = sourceCode.getTokenAfter(token); return !(tokenAfter && astUtils.isTokenOnSameLine(token, tokenAfter)); } /** * Checks if the given token is the first token in its line * @param {Token} token The token to check. * @returns {boolean} Whether or not the token is the first in its line. */ function isFirstTokenInCurrentLine(token) { var tokenBefore = sourceCode.getTokenBefore(token); return !(tokenBefore && astUtils.isTokenOnSameLine(token, tokenBefore)); } /** * Checks if the next token of a given token is a closing parenthesis. * @param {Token} token The token to check. * @returns {boolean} Whether or not the next token of a given token is a closing parenthesis. */ function isBeforeClosingParen(token) { var nextToken = sourceCode.getTokenAfter(token); return nextToken && astUtils.isClosingBraceToken(nextToken) || astUtils.isClosingParenToken(nextToken); } /** * Reports if the given token has invalid spacing. * @param {Token} token The semicolon token to check. * @param {ASTNode} node The corresponding node of the token. * @returns {void} */ function checkSemicolonSpacing(token, node) { if (astUtils.isSemicolonToken(token)) { var location = token.loc.start; if (hasLeadingSpace(token)) { if (!requireSpaceBefore) { context.report({ node: node, loc: location, message: "Unexpected whitespace before semicolon.", fix: function fix(fixer) { var tokenBefore = sourceCode.getTokenBefore(token); return fixer.removeRange([tokenBefore.range[1], token.range[0]]); } }); } } else { if (requireSpaceBefore) { context.report({ node: node, loc: location, message: "Missing whitespace before semicolon.", fix: function fix(fixer) { return fixer.insertTextBefore(token, " "); } }); } } if (!isFirstTokenInCurrentLine(token) && !isLastTokenInCurrentLine(token) && !isBeforeClosingParen(token)) { if (hasTrailingSpace(token)) { if (!requireSpaceAfter) { context.report({ node: node, loc: location, message: "Unexpected whitespace after semicolon.", fix: function fix(fixer) { var tokenAfter = sourceCode.getTokenAfter(token); return fixer.removeRange([token.range[1], tokenAfter.range[0]]); } }); } } else { if (requireSpaceAfter) { context.report({ node: node, loc: location, message: "Missing whitespace after semicolon.", fix: function fix(fixer) { return fixer.insertTextAfter(token, " "); } }); } } } } } /** * Checks the spacing of the semicolon with the assumption that the last token is the semicolon. * @param {ASTNode} node The node to check. * @returns {void} */ function checkNode(node) { var token = sourceCode.getLastToken(node); checkSemicolonSpacing(token, node); } return { VariableDeclaration: checkNode, ExpressionStatement: checkNode, BreakStatement: checkNode, ContinueStatement: checkNode, DebuggerStatement: checkNode, ReturnStatement: checkNode, ThrowStatement: checkNode, ImportDeclaration: checkNode, ExportNamedDeclaration: checkNode, ExportAllDeclaration: checkNode, ExportDefaultDeclaration: checkNode, ForStatement: function ForStatement(node) { if (node.init) { checkSemicolonSpacing(sourceCode.getTokenAfter(node.init), node); } if (node.test) { checkSemicolonSpacing(sourceCode.getTokenAfter(node.test), node); } } }; } }; },{"../ast-utils":67}],309:[function(require,module,exports){ /** * @fileoverview Rule to enforce location of semicolons. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; } var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ var SELECTOR = ":matches(" + ["BreakStatement", "ContinueStatement", "DebuggerStatement", "DoWhileStatement", "EmptyStatement", "ExportAllDeclaration", "ExportDefaultDeclaration", "ExportNamedDeclaration", "ExpressionStatement", "ImportDeclaration", "ReturnStatement", "ThrowStatement", "VariableDeclaration"].join(",") + ")"; module.exports = { meta: { docs: { description: "enforce location of semicolons", category: "Stylistic Issues", recommended: false }, schema: [{ enum: ["last", "first"] }], fixable: "whitespace" }, create: function create(context) { var _ref; var sourceCode = context.getSourceCode(); var option = context.options[0] || "last"; /** * Check whether comments exist between the given 2 tokens. * @param {Token} left The left token to check. * @param {Token} right The right token to check. * @returns {boolean} `true` if comments exist between the given 2 tokens. */ function commentsExistBetween(left, right) { return sourceCode.getFirstTokenBetween(left, right, { includeComments: true, filter: astUtils.isCommentToken }) !== null; } /** * Check the given semicolon token. * @param {Token} semiToken The semicolon token to check. * @param {"first"|"last"} expected The expected location to check. * @returns {void} */ function check(semiToken, expected) { var prevToken = sourceCode.getTokenBefore(semiToken); var nextToken = sourceCode.getTokenAfter(semiToken); var prevIsSameLine = !prevToken || astUtils.isTokenOnSameLine(prevToken, semiToken); var nextIsSameLine = !nextToken || astUtils.isTokenOnSameLine(semiToken, nextToken); if (expected === "last" && !prevIsSameLine || expected === "first" && !nextIsSameLine) { context.report({ loc: semiToken.loc, message: "Expected this semicolon to be at {{pos}}.", data: { pos: expected === "last" ? "the end of the previous line" : "the beginning of the next line" }, fix: function fix(fixer) { if (prevToken && nextToken && commentsExistBetween(prevToken, nextToken)) { return null; } var start = prevToken ? prevToken.range[1] : semiToken.range[0]; var end = nextToken ? nextToken.range[0] : semiToken.range[1]; var text = expected === "last" ? ";\n" : "\n;"; return fixer.replaceTextRange([start, end], text); } }); } } return _ref = {}, _defineProperty(_ref, SELECTOR, function (node) { var lastToken = sourceCode.getLastToken(node); if (astUtils.isSemicolonToken(lastToken)) { check(lastToken, option); } }), _defineProperty(_ref, "ForStatement", function ForStatement(node) { var firstSemi = node.init && sourceCode.getTokenAfter(node.init, astUtils.isSemicolonToken); var secondSemi = node.test && sourceCode.getTokenAfter(node.test, astUtils.isSemicolonToken); if (firstSemi) { check(firstSemi, "last"); } if (secondSemi) { check(secondSemi, "last"); } }), _ref; } }; },{"../ast-utils":67}],310:[function(require,module,exports){ /** * @fileoverview Rule to flag missing semicolons. * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var FixTracker = require("../util/fix-tracker"); var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require or disallow semicolons instead of ASI", category: "Stylistic Issues", recommended: false }, fixable: "code", schema: { anyOf: [{ type: "array", items: [{ enum: ["never"] }], minItems: 0, maxItems: 1 }, { type: "array", items: [{ enum: ["always"] }, { type: "object", properties: { omitLastInOneLineBlock: { type: "boolean" } }, additionalProperties: false }], minItems: 0, maxItems: 2 }] } }, create: function create(context) { var OPT_OUT_PATTERN = /^[-[(/+`]/; // One of [(/+-` var options = context.options[1]; var never = context.options[0] === "never", exceptOneLine = options && options.omitLastInOneLineBlock === true, sourceCode = context.getSourceCode(); //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Reports a semicolon error with appropriate location and message. * @param {ASTNode} node The node with an extra or missing semicolon. * @param {boolean} missing True if the semicolon is missing. * @returns {void} */ function report(node, missing) { var lastToken = sourceCode.getLastToken(node); var message = void 0, fix = void 0, loc = lastToken.loc; if (!missing) { message = "Missing semicolon."; loc = loc.end; fix = function fix(fixer) { return fixer.insertTextAfter(lastToken, ";"); }; } else { message = "Extra semicolon."; loc = loc.start; fix = function fix(fixer) { // Expand the replacement range to include the surrounding // tokens to avoid conflicting with no-extra-semi. // https://github.com/eslint/eslint/issues/7928 return new FixTracker(fixer, sourceCode).retainSurroundingTokens(lastToken).remove(lastToken); }; } context.report({ node: node, loc: loc, message: message, fix: fix }); } /** * Check if a semicolon is unnecessary, only true if: * - next token is on a new line and is not one of the opt-out tokens * - next token is a valid statement divider * @param {Token} lastToken last token of current node. * @returns {boolean} whether the semicolon is unnecessary. */ function isUnnecessarySemicolon(lastToken) { if (!astUtils.isSemicolonToken(lastToken)) { return false; } var nextToken = sourceCode.getTokenAfter(lastToken); if (!nextToken) { return true; } var lastTokenLine = lastToken.loc.end.line; var nextTokenLine = nextToken.loc.start.line; var isOptOutToken = OPT_OUT_PATTERN.test(nextToken.value) && nextToken.value !== "++" && nextToken.value !== "--"; var isDivider = astUtils.isClosingBraceToken(nextToken) || astUtils.isSemicolonToken(nextToken); return lastTokenLine !== nextTokenLine && !isOptOutToken || isDivider; } /** * Checks a node to see if it's in a one-liner block statement. * @param {ASTNode} node The node to check. * @returns {boolean} whether the node is in a one-liner block statement. */ function isOneLinerBlock(node) { var nextToken = sourceCode.getTokenAfter(node); if (!nextToken || nextToken.value !== "}") { return false; } var parent = node.parent; return parent && parent.type === "BlockStatement" && parent.loc.start.line === parent.loc.end.line; } /** * Checks a node to see if it's followed by a semicolon. * @param {ASTNode} node The node to check. * @returns {void} */ function checkForSemicolon(node) { var lastToken = sourceCode.getLastToken(node); if (never) { if (isUnnecessarySemicolon(lastToken)) { report(node, true); } } else { if (!astUtils.isSemicolonToken(lastToken)) { if (!exceptOneLine || !isOneLinerBlock(node)) { report(node); } } else { if (exceptOneLine && isOneLinerBlock(node)) { report(node, true); } } } } /** * Checks to see if there's a semicolon after a variable declaration. * @param {ASTNode} node The node to check. * @returns {void} */ function checkForSemicolonForVariableDeclaration(node) { var ancestors = context.getAncestors(), parentIndex = ancestors.length - 1, parent = ancestors[parentIndex]; if ((parent.type !== "ForStatement" || parent.init !== node) && (!/^For(?:In|Of)Statement/.test(parent.type) || parent.left !== node)) { checkForSemicolon(node); } } //-------------------------------------------------------------------------- // Public API //-------------------------------------------------------------------------- return { VariableDeclaration: checkForSemicolonForVariableDeclaration, ExpressionStatement: checkForSemicolon, ReturnStatement: checkForSemicolon, ThrowStatement: checkForSemicolon, DoWhileStatement: checkForSemicolon, DebuggerStatement: checkForSemicolon, BreakStatement: checkForSemicolon, ContinueStatement: checkForSemicolon, ImportDeclaration: checkForSemicolon, ExportAllDeclaration: checkForSemicolon, ExportNamedDeclaration: function ExportNamedDeclaration(node) { if (!node.declaration) { checkForSemicolon(node); } }, ExportDefaultDeclaration: function ExportDefaultDeclaration(node) { if (!/(?:Class|Function)Declaration/.test(node.declaration.type)) { checkForSemicolon(node); } } }; } }; },{"../ast-utils":67,"../util/fix-tracker":348}],311:[function(require,module,exports){ /** * @fileoverview Rule to require sorting of import declarations * @author Christian Schuller */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce sorted import declarations within modules", category: "ECMAScript 6", recommended: false }, schema: [{ type: "object", properties: { ignoreCase: { type: "boolean" }, memberSyntaxSortOrder: { type: "array", items: { enum: ["none", "all", "multiple", "single"] }, uniqueItems: true, minItems: 4, maxItems: 4 }, ignoreMemberSort: { type: "boolean" } }, additionalProperties: false }], fixable: "code" }, create: function create(context) { var configuration = context.options[0] || {}, ignoreCase = configuration.ignoreCase || false, ignoreMemberSort = configuration.ignoreMemberSort || false, memberSyntaxSortOrder = configuration.memberSyntaxSortOrder || ["none", "all", "multiple", "single"], sourceCode = context.getSourceCode(); var previousDeclaration = null; /** * Gets the used member syntax style. * * import "my-module.js" --> none * import * as myModule from "my-module.js" --> all * import {myMember} from "my-module.js" --> single * import {foo, bar} from "my-module.js" --> multiple * * @param {ASTNode} node - the ImportDeclaration node. * @returns {string} used member parameter style, ["all", "multiple", "single"] */ function usedMemberSyntax(node) { if (node.specifiers.length === 0) { return "none"; } else if (node.specifiers[0].type === "ImportNamespaceSpecifier") { return "all"; } else if (node.specifiers.length === 1) { return "single"; } return "multiple"; } /** * Gets the group by member parameter index for given declaration. * @param {ASTNode} node - the ImportDeclaration node. * @returns {number} the declaration group by member index. */ function getMemberParameterGroupIndex(node) { return memberSyntaxSortOrder.indexOf(usedMemberSyntax(node)); } /** * Gets the local name of the first imported module. * @param {ASTNode} node - the ImportDeclaration node. * @returns {?string} the local name of the first imported module. */ function getFirstLocalMemberName(node) { if (node.specifiers[0]) { return node.specifiers[0].local.name; } return null; } return { ImportDeclaration: function ImportDeclaration(node) { if (previousDeclaration) { var currentMemberSyntaxGroupIndex = getMemberParameterGroupIndex(node), previousMemberSyntaxGroupIndex = getMemberParameterGroupIndex(previousDeclaration); var currentLocalMemberName = getFirstLocalMemberName(node), previousLocalMemberName = getFirstLocalMemberName(previousDeclaration); if (ignoreCase) { previousLocalMemberName = previousLocalMemberName && previousLocalMemberName.toLowerCase(); currentLocalMemberName = currentLocalMemberName && currentLocalMemberName.toLowerCase(); } // When the current declaration uses a different member syntax, // then check if the ordering is correct. // Otherwise, make a default string compare (like rule sort-vars to be consistent) of the first used local member name. if (currentMemberSyntaxGroupIndex !== previousMemberSyntaxGroupIndex) { if (currentMemberSyntaxGroupIndex < previousMemberSyntaxGroupIndex) { context.report({ node: node, message: "Expected '{{syntaxA}}' syntax before '{{syntaxB}}' syntax.", data: { syntaxA: memberSyntaxSortOrder[currentMemberSyntaxGroupIndex], syntaxB: memberSyntaxSortOrder[previousMemberSyntaxGroupIndex] } }); } } else { if (previousLocalMemberName && currentLocalMemberName && currentLocalMemberName < previousLocalMemberName) { context.report({ node: node, message: "Imports should be sorted alphabetically." }); } } } if (!ignoreMemberSort) { var importSpecifiers = node.specifiers.filter(function (specifier) { return specifier.type === "ImportSpecifier"; }); var getSortableName = ignoreCase ? function (specifier) { return specifier.local.name.toLowerCase(); } : function (specifier) { return specifier.local.name; }; var firstUnsortedIndex = importSpecifiers.map(getSortableName).findIndex(function (name, index, array) { return array[index - 1] > name; }); if (firstUnsortedIndex !== -1) { context.report({ node: importSpecifiers[firstUnsortedIndex], message: "Member '{{memberName}}' of the import declaration should be sorted alphabetically.", data: { memberName: importSpecifiers[firstUnsortedIndex].local.name }, fix: function fix(fixer) { if (importSpecifiers.some(function (specifier) { return sourceCode.getCommentsBefore(specifier).length || sourceCode.getCommentsAfter(specifier).length; })) { // If there are comments in the ImportSpecifier list, don't rearrange the specifiers. return null; } return fixer.replaceTextRange([importSpecifiers[0].range[0], importSpecifiers[importSpecifiers.length - 1].range[1]], importSpecifiers // Clone the importSpecifiers array to avoid mutating it .slice // Sort the array into the desired order ().sort(function (specifierA, specifierB) { var aName = getSortableName(specifierA); var bName = getSortableName(specifierB); return aName > bName ? 1 : -1; } // Build a string out of the sorted list of import specifiers and the text between the originals ).reduce(function (sourceText, specifier, index) { var textAfterSpecifier = index === importSpecifiers.length - 1 ? "" : sourceCode.getText().slice(importSpecifiers[index].range[1], importSpecifiers[index + 1].range[0]); return sourceText + sourceCode.getText(specifier) + textAfterSpecifier; }, "")); } }); } } previousDeclaration = node; } }; } }; },{}],312:[function(require,module,exports){ /** * @fileoverview Rule to require object keys to be sorted * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"), naturalCompare = require("natural-compare"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Gets the property name of the given `Property` node. * * - If the property's key is an `Identifier` node, this returns the key's name * whether it's a computed property or not. * - If the property has a static name, this returns the static name. * - Otherwise, this returns null. * * @param {ASTNode} node - The `Property` node to get. * @returns {string|null} The property name or null. * @private */ function getPropertyName(node) { return astUtils.getStaticPropertyName(node) || node.key.name || null; } /** * Functions which check that the given 2 names are in specific order. * * Postfix `I` is meant insensitive. * Postfix `N` is meant natual. * * @private */ var isValidOrders = { asc: function asc(a, b) { return a <= b; }, ascI: function ascI(a, b) { return a.toLowerCase() <= b.toLowerCase(); }, ascN: function ascN(a, b) { return naturalCompare(a, b) <= 0; }, ascIN: function ascIN(a, b) { return naturalCompare(a.toLowerCase(), b.toLowerCase()) <= 0; }, desc: function desc(a, b) { return isValidOrders.asc(b, a); }, descI: function descI(a, b) { return isValidOrders.ascI(b, a); }, descN: function descN(a, b) { return isValidOrders.ascN(b, a); }, descIN: function descIN(a, b) { return isValidOrders.ascIN(b, a); } }; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require object keys to be sorted", category: "Stylistic Issues", recommended: false }, schema: [{ enum: ["asc", "desc"] }, { type: "object", properties: { caseSensitive: { type: "boolean" }, natural: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { // Parse options. var order = context.options[0] || "asc"; var options = context.options[1]; var insensitive = (options && options.caseSensitive) === false; var natual = Boolean(options && options.natural); var isValidOrder = isValidOrders[order + (insensitive ? "I" : "") + (natual ? "N" : "")]; // The stack to save the previous property's name for each object literals. var stack = null; return { ObjectExpression: function ObjectExpression() { stack = { upper: stack, prevName: null }; }, "ObjectExpression:exit": function ObjectExpressionExit() { stack = stack.upper; }, Property: function Property(node) { if (node.parent.type === "ObjectPattern") { return; } var prevName = stack.prevName; var thisName = getPropertyName(node); stack.prevName = thisName || prevName; if (!prevName || !thisName) { return; } if (!isValidOrder(prevName, thisName)) { context.report({ node: node, loc: node.key.loc, message: "Expected object keys to be in {{natual}}{{insensitive}}{{order}}ending order. '{{thisName}}' should be before '{{prevName}}'.", data: { thisName: thisName, prevName: prevName, order: order, insensitive: insensitive ? "insensitive " : "", natual: natual ? "natural " : "" } }); } } }; } }; },{"../ast-utils":67,"natural-compare":50}],313:[function(require,module,exports){ /** * @fileoverview Rule to require sorting of variables within a single Variable Declaration block * @author Ilya Volodin */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require variables within the same declaration block to be sorted", category: "Stylistic Issues", recommended: false }, schema: [{ type: "object", properties: { ignoreCase: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var configuration = context.options[0] || {}, ignoreCase = configuration.ignoreCase || false; return { VariableDeclaration: function VariableDeclaration(node) { var idDeclarations = node.declarations.filter(function (decl) { return decl.id.type === "Identifier"; }); idDeclarations.slice(1).reduce(function (memo, decl) { var lastVariableName = memo.id.name, currenVariableName = decl.id.name; if (ignoreCase) { lastVariableName = lastVariableName.toLowerCase(); currenVariableName = currenVariableName.toLowerCase(); } if (currenVariableName < lastVariableName) { context.report({ node: decl, message: "Variables within the same declaration block should be sorted alphabetically." }); return memo; } return decl; }, idDeclarations[0]); } }; } }; },{}],314:[function(require,module,exports){ /** * @fileoverview A rule to ensure whitespace before blocks. * @author Mathias Schreck */ "use strict"; var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce consistent spacing before blocks", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ oneOf: [{ enum: ["always", "never"] }, { type: "object", properties: { keywords: { enum: ["always", "never"] }, functions: { enum: ["always", "never"] }, classes: { enum: ["always", "never"] } }, additionalProperties: false }] }] }, create: function create(context) { var config = context.options[0], sourceCode = context.getSourceCode(); var checkFunctions = true, checkKeywords = true, checkClasses = true; if ((typeof config === "undefined" ? "undefined" : _typeof(config)) === "object") { checkFunctions = config.functions !== "never"; checkKeywords = config.keywords !== "never"; checkClasses = config.classes !== "never"; } else if (config === "never") { checkFunctions = false; checkKeywords = false; checkClasses = false; } /** * Checks whether or not a given token is an arrow operator (=>) or a keyword * in order to avoid to conflict with `arrow-spacing` and `keyword-spacing`. * * @param {Token} token - A token to check. * @returns {boolean} `true` if the token is an arrow operator. */ function isConflicted(token) { return token.type === "Punctuator" && token.value === "=>" || token.type === "Keyword"; } /** * Checks the given BlockStatement node has a preceding space if it doesn’t start on a new line. * @param {ASTNode|Token} node The AST node of a BlockStatement. * @returns {void} undefined. */ function checkPrecedingSpace(node) { var precedingToken = sourceCode.getTokenBefore(node); var requireSpace = void 0; if (precedingToken && !isConflicted(precedingToken) && astUtils.isTokenOnSameLine(precedingToken, node)) { var hasSpace = sourceCode.isSpaceBetweenTokens(precedingToken, node); var parent = context.getAncestors().pop(); if (parent.type === "FunctionExpression" || parent.type === "FunctionDeclaration") { requireSpace = checkFunctions; } else if (node.type === "ClassBody") { requireSpace = checkClasses; } else { requireSpace = checkKeywords; } if (requireSpace) { if (!hasSpace) { context.report({ node: node, message: "Missing space before opening brace.", fix: function fix(fixer) { return fixer.insertTextBefore(node, " "); } }); } } else { if (hasSpace) { context.report({ node: node, message: "Unexpected space before opening brace.", fix: function fix(fixer) { return fixer.removeRange([precedingToken.range[1], node.range[0]]); } }); } } } } /** * Checks if the CaseBlock of an given SwitchStatement node has a preceding space. * @param {ASTNode} node The node of a SwitchStatement. * @returns {void} undefined. */ function checkSpaceBeforeCaseBlock(node) { var cases = node.cases; var openingBrace = void 0; if (cases.length > 0) { openingBrace = sourceCode.getTokenBefore(cases[0]); } else { openingBrace = sourceCode.getLastToken(node, 1); } checkPrecedingSpace(openingBrace); } return { BlockStatement: checkPrecedingSpace, ClassBody: checkPrecedingSpace, SwitchStatement: checkSpaceBeforeCaseBlock }; } }; },{"../ast-utils":67}],315:[function(require,module,exports){ /** * @fileoverview Rule to validate spacing before function paren. * @author Mathias Schreck */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce consistent spacing before `function` definition opening parenthesis", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ oneOf: [{ enum: ["always", "never"] }, { type: "object", properties: { anonymous: { enum: ["always", "never", "ignore"] }, named: { enum: ["always", "never", "ignore"] }, asyncArrow: { enum: ["always", "never", "ignore"] } }, additionalProperties: false }] }] }, create: function create(context) { var sourceCode = context.getSourceCode(); var baseConfig = typeof context.options[0] === "string" ? context.options[0] : "always"; var overrideConfig = _typeof(context.options[0]) === "object" ? context.options[0] : {}; /** * Determines whether a function has a name. * @param {ASTNode} node The function node. * @returns {boolean} Whether the function has a name. */ function isNamedFunction(node) { if (node.id) { return true; } var parent = node.parent; return parent.type === "MethodDefinition" || parent.type === "Property" && (parent.kind === "get" || parent.kind === "set" || parent.method); } /** * Gets the config for a given function * @param {ASTNode} node The function node * @returns {string} "always", "never", or "ignore" */ function getConfigForFunction(node) { if (node.type === "ArrowFunctionExpression") { // Always ignore non-async functions and arrow functions without parens, e.g. async foo => bar if (node.async && astUtils.isOpeningParenToken(sourceCode.getFirstToken(node, { skip: 1 }))) { return overrideConfig.asyncArrow || baseConfig; } } else if (isNamedFunction(node)) { return overrideConfig.named || baseConfig; // `generator-star-spacing` should warn anonymous generators. E.g. `function* () {}` } else if (!node.generator) { return overrideConfig.anonymous || baseConfig; } return "ignore"; } /** * Checks the parens of a function node * @param {ASTNode} node A function node * @returns {void} */ function checkFunction(node) { var functionConfig = getConfigForFunction(node); if (functionConfig === "ignore") { return; } var rightToken = sourceCode.getFirstToken(node, astUtils.isOpeningParenToken); var leftToken = sourceCode.getTokenBefore(rightToken); var hasSpacing = sourceCode.isSpaceBetweenTokens(leftToken, rightToken); if (hasSpacing && functionConfig === "never") { context.report({ node: node, loc: leftToken.loc.end, message: "Unexpected space before function parentheses.", fix: function fix(fixer) { return fixer.removeRange([leftToken.range[1], rightToken.range[0]]); } }); } else if (!hasSpacing && functionConfig === "always") { context.report({ node: node, loc: leftToken.loc.end, message: "Missing space before function parentheses.", fix: function fix(fixer) { return fixer.insertTextAfter(leftToken, " "); } }); } } return { ArrowFunctionExpression: checkFunction, FunctionDeclaration: checkFunction, FunctionExpression: checkFunction }; } }; },{"../ast-utils":67}],316:[function(require,module,exports){ /** * @fileoverview Disallows or enforces spaces inside of parentheses. * @author Jonathan Rajavuori */ "use strict"; var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce consistent spacing inside parentheses", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ enum: ["always", "never"] }, { type: "object", properties: { exceptions: { type: "array", items: { enum: ["{}", "[]", "()", "empty"] }, uniqueItems: true } }, additionalProperties: false }] }, create: function create(context) { var MISSING_SPACE_MESSAGE = "There must be a space inside this paren.", REJECTED_SPACE_MESSAGE = "There should be no spaces inside this paren.", ALWAYS = context.options[0] === "always", exceptionsArrayOptions = context.options.length === 2 ? context.options[1].exceptions : [], options = {}; var exceptions = void 0; if (exceptionsArrayOptions.length) { options.braceException = exceptionsArrayOptions.indexOf("{}") !== -1; options.bracketException = exceptionsArrayOptions.indexOf("[]") !== -1; options.parenException = exceptionsArrayOptions.indexOf("()") !== -1; options.empty = exceptionsArrayOptions.indexOf("empty") !== -1; } /** * Produces an object with the opener and closer exception values * @param {Object} opts The exception options * @returns {Object} `openers` and `closers` exception values * @private */ function getExceptions() { var openers = [], closers = []; if (options.braceException) { openers.push("{"); closers.push("}"); } if (options.bracketException) { openers.push("["); closers.push("]"); } if (options.parenException) { openers.push("("); closers.push(")"); } if (options.empty) { openers.push(")"); closers.push("("); } return { openers: openers, closers: closers }; } //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- var sourceCode = context.getSourceCode(); /** * Determines if a token is one of the exceptions for the opener paren * @param {Object} token The token to check * @returns {boolean} True if the token is one of the exceptions for the opener paren */ function isOpenerException(token) { return token.type === "Punctuator" && exceptions.openers.indexOf(token.value) >= 0; } /** * Determines if a token is one of the exceptions for the closer paren * @param {Object} token The token to check * @returns {boolean} True if the token is one of the exceptions for the closer paren */ function isCloserException(token) { return token.type === "Punctuator" && exceptions.closers.indexOf(token.value) >= 0; } /** * Determines if an opener paren should have a missing space after it * @param {Object} left The paren token * @param {Object} right The token after it * @returns {boolean} True if the paren should have a space */ function shouldOpenerHaveSpace(left, right) { if (sourceCode.isSpaceBetweenTokens(left, right)) { return false; } if (ALWAYS) { if (astUtils.isClosingParenToken(right)) { return false; } return !isOpenerException(right); } return isOpenerException(right); } /** * Determines if an closer paren should have a missing space after it * @param {Object} left The token before the paren * @param {Object} right The paren token * @returns {boolean} True if the paren should have a space */ function shouldCloserHaveSpace(left, right) { if (astUtils.isOpeningParenToken(left)) { return false; } if (sourceCode.isSpaceBetweenTokens(left, right)) { return false; } if (ALWAYS) { return !isCloserException(left); } return isCloserException(left); } /** * Determines if an opener paren should not have an existing space after it * @param {Object} left The paren token * @param {Object} right The token after it * @returns {boolean} True if the paren should reject the space */ function shouldOpenerRejectSpace(left, right) { if (right.type === "Line") { return false; } if (!astUtils.isTokenOnSameLine(left, right)) { return false; } if (!sourceCode.isSpaceBetweenTokens(left, right)) { return false; } if (ALWAYS) { return isOpenerException(right); } return !isOpenerException(right); } /** * Determines if an closer paren should not have an existing space after it * @param {Object} left The token before the paren * @param {Object} right The paren token * @returns {boolean} True if the paren should reject the space */ function shouldCloserRejectSpace(left, right) { if (astUtils.isOpeningParenToken(left)) { return false; } if (!astUtils.isTokenOnSameLine(left, right)) { return false; } if (!sourceCode.isSpaceBetweenTokens(left, right)) { return false; } if (ALWAYS) { return isCloserException(left); } return !isCloserException(left); } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { Program: function checkParenSpaces(node) { exceptions = getExceptions(); var tokens = sourceCode.tokensAndComments; tokens.forEach(function (token, i) { var prevToken = tokens[i - 1]; var nextToken = tokens[i + 1]; if (!astUtils.isOpeningParenToken(token) && !astUtils.isClosingParenToken(token)) { return; } if (token.value === "(" && shouldOpenerHaveSpace(token, nextToken)) { context.report({ node: node, loc: token.loc.start, message: MISSING_SPACE_MESSAGE, fix: function fix(fixer) { return fixer.insertTextAfter(token, " "); } }); } else if (token.value === "(" && shouldOpenerRejectSpace(token, nextToken)) { context.report({ node: node, loc: token.loc.start, message: REJECTED_SPACE_MESSAGE, fix: function fix(fixer) { return fixer.removeRange([token.range[1], nextToken.range[0]]); } }); } else if (token.value === ")" && shouldCloserHaveSpace(prevToken, token)) { // context.report(node, token.loc.start, MISSING_SPACE_MESSAGE); context.report({ node: node, loc: token.loc.start, message: MISSING_SPACE_MESSAGE, fix: function fix(fixer) { return fixer.insertTextBefore(token, " "); } }); } else if (token.value === ")" && shouldCloserRejectSpace(prevToken, token)) { context.report({ node: node, loc: token.loc.start, message: REJECTED_SPACE_MESSAGE, fix: function fix(fixer) { return fixer.removeRange([prevToken.range[1], token.range[0]]); } }); } }); } }; } }; },{"../ast-utils":67}],317:[function(require,module,exports){ /** * @fileoverview Require spaces around infix operators * @author Michael Ficarra */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require spacing around infix operators", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ type: "object", properties: { int32Hint: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var int32Hint = context.options[0] ? context.options[0].int32Hint === true : false; var OPERATORS = ["*", "/", "%", "+", "-", "<<", ">>", ">>>", "<", "<=", ">", ">=", "in", "instanceof", "==", "!=", "===", "!==", "&", "^", "|", "&&", "||", "=", "+=", "-=", "*=", "/=", "%=", "<<=", ">>=", ">>>=", "&=", "^=", "|=", "?", ":", ",", "**"]; var sourceCode = context.getSourceCode(); /** * Returns the first token which violates the rule * @param {ASTNode} left - The left node of the main node * @param {ASTNode} right - The right node of the main node * @returns {Object} The violator token or null * @private */ function getFirstNonSpacedToken(left, right) { var tokens = sourceCode.getTokensBetween(left, right, 1); for (var i = 1, l = tokens.length - 1; i < l; ++i) { var op = tokens[i]; if ((op.type === "Punctuator" || op.type === "Keyword") && OPERATORS.indexOf(op.value) >= 0 && (tokens[i - 1].range[1] >= op.range[0] || op.range[1] >= tokens[i + 1].range[0])) { return op; } } return null; } /** * Reports an AST node as a rule violation * @param {ASTNode} mainNode - The node to report * @param {Object} culpritToken - The token which has a problem * @returns {void} * @private */ function report(mainNode, culpritToken) { context.report({ node: mainNode, loc: culpritToken.loc.start, message: "Infix operators must be spaced.", fix: function fix(fixer) { var previousToken = sourceCode.getTokenBefore(culpritToken); var afterToken = sourceCode.getTokenAfter(culpritToken); var fixString = ""; if (culpritToken.range[0] - previousToken.range[1] === 0) { fixString = " "; } fixString += culpritToken.value; if (afterToken.range[0] - culpritToken.range[1] === 0) { fixString += " "; } return fixer.replaceText(culpritToken, fixString); } }); } /** * Check if the node is binary then report * @param {ASTNode} node node to evaluate * @returns {void} * @private */ function checkBinary(node) { if (node.left.typeAnnotation) { return; } var nonSpacedNode = getFirstNonSpacedToken(node.left, node.right); if (nonSpacedNode) { if (!(int32Hint && sourceCode.getText(node).substr(-2) === "|0")) { report(node, nonSpacedNode); } } } /** * Check if the node is conditional * @param {ASTNode} node node to evaluate * @returns {void} * @private */ function checkConditional(node) { var nonSpacedConsequesntNode = getFirstNonSpacedToken(node.test, node.consequent); var nonSpacedAlternateNode = getFirstNonSpacedToken(node.consequent, node.alternate); if (nonSpacedConsequesntNode) { report(node, nonSpacedConsequesntNode); } else if (nonSpacedAlternateNode) { report(node, nonSpacedAlternateNode); } } /** * Check if the node is a variable * @param {ASTNode} node node to evaluate * @returns {void} * @private */ function checkVar(node) { if (node.init) { var nonSpacedNode = getFirstNonSpacedToken(node.id, node.init); if (nonSpacedNode) { report(node, nonSpacedNode); } } } return { AssignmentExpression: checkBinary, AssignmentPattern: checkBinary, BinaryExpression: checkBinary, LogicalExpression: checkBinary, ConditionalExpression: checkConditional, VariableDeclarator: checkVar }; } }; },{}],318:[function(require,module,exports){ /** * @fileoverview This rule shoud require or disallow spaces before or after unary operations. * @author Marcin Kumorek */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce consistent spacing before or after unary operators", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ type: "object", properties: { words: { type: "boolean" }, nonwords: { type: "boolean" }, overrides: { type: "object", additionalProperties: { type: "boolean" } } }, additionalProperties: false }] }, create: function create(context) { var options = context.options && Array.isArray(context.options) && context.options[0] || { words: true, nonwords: false }; var sourceCode = context.getSourceCode(); //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Check if the node is the first "!" in a "!!" convert to Boolean expression * @param {ASTnode} node AST node * @returns {boolean} Whether or not the node is first "!" in "!!" */ function isFirstBangInBangBangExpression(node) { return node && node.type === "UnaryExpression" && node.argument.operator === "!" && node.argument && node.argument.type === "UnaryExpression" && node.argument.operator === "!"; } /** * Check if the node's child argument is an "ObjectExpression" * @param {ASTnode} node AST node * @returns {boolean} Whether or not the argument's type is "ObjectExpression" */ function isArgumentObjectExpression(node) { return node.argument && node.argument.type && node.argument.type === "ObjectExpression"; } /** * Checks if an override exists for a given operator. * @param {ASTnode} node AST node * @param {string} operator Operator * @returns {boolean} Whether or not an override has been provided for the operator */ function overrideExistsForOperator(node, operator) { return options.overrides && options.overrides.hasOwnProperty(operator); } /** * Gets the value that the override was set to for this operator * @param {ASTnode} node AST node * @param {string} operator Operator * @returns {boolean} Whether or not an override enforces a space with this operator */ function overrideEnforcesSpaces(node, operator) { return options.overrides[operator]; } /** * Verify Unary Word Operator has spaces after the word operator * @param {ASTnode} node AST node * @param {Object} firstToken first token from the AST node * @param {Object} secondToken second token from the AST node * @param {string} word The word to be used for reporting * @returns {void} */ function verifyWordHasSpaces(node, firstToken, secondToken, word) { if (secondToken.range[0] === firstToken.range[1]) { context.report({ node: node, message: "Unary word operator '{{word}}' must be followed by whitespace.", data: { word: word }, fix: function fix(fixer) { return fixer.insertTextAfter(firstToken, " "); } }); } } /** * Verify Unary Word Operator doesn't have spaces after the word operator * @param {ASTnode} node AST node * @param {Object} firstToken first token from the AST node * @param {Object} secondToken second token from the AST node * @param {string} word The word to be used for reporting * @returns {void} */ function verifyWordDoesntHaveSpaces(node, firstToken, secondToken, word) { if (isArgumentObjectExpression(node)) { if (secondToken.range[0] > firstToken.range[1]) { context.report({ node: node, message: "Unexpected space after unary word operator '{{word}}'.", data: { word: word }, fix: function fix(fixer) { return fixer.removeRange([firstToken.range[1], secondToken.range[0]]); } }); } } } /** * Check Unary Word Operators for spaces after the word operator * @param {ASTnode} node AST node * @param {Object} firstToken first token from the AST node * @param {Object} secondToken second token from the AST node * @param {string} word The word to be used for reporting * @returns {void} */ function checkUnaryWordOperatorForSpaces(node, firstToken, secondToken, word) { word = word || firstToken.value; if (overrideExistsForOperator(node, word)) { if (overrideEnforcesSpaces(node, word)) { verifyWordHasSpaces(node, firstToken, secondToken, word); } else { verifyWordDoesntHaveSpaces(node, firstToken, secondToken, word); } } else if (options.words) { verifyWordHasSpaces(node, firstToken, secondToken, word); } else { verifyWordDoesntHaveSpaces(node, firstToken, secondToken, word); } } /** * Verifies YieldExpressions satisfy spacing requirements * @param {ASTnode} node AST node * @returns {void} */ function checkForSpacesAfterYield(node) { var tokens = sourceCode.getFirstTokens(node, 3), word = "yield"; if (!node.argument || node.delegate) { return; } checkUnaryWordOperatorForSpaces(node, tokens[0], tokens[1], word); } /** * Verifies AwaitExpressions satisfy spacing requirements * @param {ASTNode} node AwaitExpression AST node * @returns {void} */ function checkForSpacesAfterAwait(node) { var tokens = sourceCode.getFirstTokens(node, 3); checkUnaryWordOperatorForSpaces(node, tokens[0], tokens[1], "await"); } /** * Verifies UnaryExpression, UpdateExpression and NewExpression have spaces before or after the operator * @param {ASTnode} node AST node * @param {Object} firstToken First token in the expression * @param {Object} secondToken Second token in the expression * @returns {void} */ function verifyNonWordsHaveSpaces(node, firstToken, secondToken) { if (node.prefix) { if (isFirstBangInBangBangExpression(node)) { return; } if (firstToken.range[1] === secondToken.range[0]) { context.report({ node: node, message: "Unary operator '{{operator}}' must be followed by whitespace.", data: { operator: firstToken.value }, fix: function fix(fixer) { return fixer.insertTextAfter(firstToken, " "); } }); } } else { if (firstToken.range[1] === secondToken.range[0]) { context.report({ node: node, message: "Space is required before unary expressions '{{token}}'.", data: { token: secondToken.value }, fix: function fix(fixer) { return fixer.insertTextBefore(secondToken, " "); } }); } } } /** * Verifies UnaryExpression, UpdateExpression and NewExpression don't have spaces before or after the operator * @param {ASTnode} node AST node * @param {Object} firstToken First token in the expression * @param {Object} secondToken Second token in the expression * @returns {void} */ function verifyNonWordsDontHaveSpaces(node, firstToken, secondToken) { if (node.prefix) { if (secondToken.range[0] > firstToken.range[1]) { context.report({ node: node, message: "Unexpected space after unary operator '{{operator}}'.", data: { operator: firstToken.value }, fix: function fix(fixer) { if (astUtils.canTokensBeAdjacent(firstToken, secondToken)) { return fixer.removeRange([firstToken.range[1], secondToken.range[0]]); } return null; } }); } } else { if (secondToken.range[0] > firstToken.range[1]) { context.report({ node: node, message: "Unexpected space before unary operator '{{operator}}'.", data: { operator: secondToken.value }, fix: function fix(fixer) { return fixer.removeRange([firstToken.range[1], secondToken.range[0]]); } }); } } } /** * Verifies UnaryExpression, UpdateExpression and NewExpression satisfy spacing requirements * @param {ASTnode} node AST node * @returns {void} */ function checkForSpaces(node) { var tokens = node.type === "UpdateExpression" && !node.prefix ? sourceCode.getLastTokens(node, 2) : sourceCode.getFirstTokens(node, 2); var firstToken = tokens[0]; var secondToken = tokens[1]; if ((node.type === "NewExpression" || node.prefix) && firstToken.type === "Keyword") { checkUnaryWordOperatorForSpaces(node, firstToken, secondToken); return; } var operator = node.prefix ? tokens[0].value : tokens[1].value; if (overrideExistsForOperator(node, operator)) { if (overrideEnforcesSpaces(node, operator)) { verifyNonWordsHaveSpaces(node, firstToken, secondToken); } else { verifyNonWordsDontHaveSpaces(node, firstToken, secondToken); } } else if (options.nonwords) { verifyNonWordsHaveSpaces(node, firstToken, secondToken); } else { verifyNonWordsDontHaveSpaces(node, firstToken, secondToken); } } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { UnaryExpression: checkForSpaces, UpdateExpression: checkForSpaces, NewExpression: checkForSpaces, YieldExpression: checkForSpacesAfterYield, AwaitExpression: checkForSpacesAfterAwait }; } }; },{"../ast-utils":67}],319:[function(require,module,exports){ /** * @fileoverview Source code for spaced-comments rule * @author Gyandeep Singh */ "use strict"; var lodash = require("lodash"); var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Escapes the control characters of a given string. * @param {string} s - A string to escape. * @returns {string} An escaped string. */ function escape(s) { var isOneChar = s.length === 1; s = lodash.escapeRegExp(s); return isOneChar ? s : "(?:" + s + ")"; } /** * Escapes the control characters of a given string. * And adds a repeat flag. * @param {string} s - A string to escape. * @returns {string} An escaped string. */ function escapeAndRepeat(s) { return escape(s) + "+"; } /** * Parses `markers` option. * If markers don't include `"*"`, this adds `"*"` to allow JSDoc comments. * @param {string[]} [markers] - A marker list. * @returns {string[]} A marker list. */ function parseMarkersOption(markers) { markers = markers ? markers.slice(0) : []; // `*` is a marker for JSDoc comments. if (markers.indexOf("*") === -1) { markers.push("*"); } return markers; } /** * Creates string pattern for exceptions. * Generated pattern: * * 1. A space or an exception pattern sequence. * * @param {string[]} exceptions - An exception pattern list. * @returns {string} A regular expression string for exceptions. */ function createExceptionsPattern(exceptions) { var pattern = ""; /* * A space or an exception pattern sequence. * [] ==> "\s" * ["-"] ==> "(?:\s|\-+$)" * ["-", "="] ==> "(?:\s|(?:\-+|=+)$)" * ["-", "=", "--=="] ==> "(?:\s|(?:\-+|=+|(?:\-\-==)+)$)" ==> https://jex.im/regulex/#!embed=false&flags=&re=(%3F%3A%5Cs%7C(%3F%3A%5C-%2B%7C%3D%2B%7C(%3F%3A%5C-%5C-%3D%3D)%2B)%24) */ if (exceptions.length === 0) { // a space. pattern += "\\s"; } else { // a space or... pattern += "(?:\\s|"; if (exceptions.length === 1) { // a sequence of the exception pattern. pattern += escapeAndRepeat(exceptions[0]); } else { // a sequence of one of the exception patterns. pattern += "(?:"; pattern += exceptions.map(escapeAndRepeat).join("|"); pattern += ")"; } pattern += "(?:$|[" + Array.from(astUtils.LINEBREAKS).join("") + "]))"; } return pattern; } /** * Creates RegExp object for `always` mode. * Generated pattern for beginning of comment: * * 1. First, a marker or nothing. * 2. Next, a space or an exception pattern sequence. * * @param {string[]} markers - A marker list. * @param {string[]} exceptions - An exception pattern list. * @returns {RegExp} A RegExp object for the beginning of a comment in `always` mode. */ function createAlwaysStylePattern(markers, exceptions) { var pattern = "^"; /* * A marker or nothing. * ["*"] ==> "\*?" * ["*", "!"] ==> "(?:\*|!)?" * ["*", "/", "!<"] ==> "(?:\*|\/|(?:!<))?" ==> https://jex.im/regulex/#!embed=false&flags=&re=(%3F%3A%5C*%7C%5C%2F%7C(%3F%3A!%3C))%3F */ if (markers.length === 1) { // the marker. pattern += escape(markers[0]); } else { // one of markers. pattern += "(?:"; pattern += markers.map(escape).join("|"); pattern += ")"; } pattern += "?"; // or nothing. pattern += createExceptionsPattern(exceptions); return new RegExp(pattern); } /** * Creates RegExp object for `never` mode. * Generated pattern for beginning of comment: * * 1. First, a marker or nothing (captured). * 2. Next, a space or a tab. * * @param {string[]} markers - A marker list. * @returns {RegExp} A RegExp object for `never` mode. */ function createNeverStylePattern(markers) { var pattern = "^(" + markers.map(escape).join("|") + ")?[ \t]+"; return new RegExp(pattern); } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce consistent spacing after the `//` or `/*` in a comment", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ enum: ["always", "never"] }, { type: "object", properties: { exceptions: { type: "array", items: { type: "string" } }, markers: { type: "array", items: { type: "string" } }, line: { type: "object", properties: { exceptions: { type: "array", items: { type: "string" } }, markers: { type: "array", items: { type: "string" } } }, additionalProperties: false }, block: { type: "object", properties: { exceptions: { type: "array", items: { type: "string" } }, markers: { type: "array", items: { type: "string" } }, balanced: { type: "boolean" } }, additionalProperties: false } }, additionalProperties: false }] }, create: function create(context) { var sourceCode = context.getSourceCode(); // Unless the first option is never, require a space var requireSpace = context.options[0] !== "never"; /* * Parse the second options. * If markers don't include `"*"`, it's added automatically for JSDoc * comments. */ var config = context.options[1] || {}; var balanced = config.block && config.block.balanced; var styleRules = ["block", "line"].reduce(function (rule, type) { var markers = parseMarkersOption(config[type] && config[type].markers || config.markers); var exceptions = config[type] && config[type].exceptions || config.exceptions || []; var endNeverPattern = "[ \t]+$"; // Create RegExp object for valid patterns. rule[type] = { beginRegex: requireSpace ? createAlwaysStylePattern(markers, exceptions) : createNeverStylePattern(markers), endRegex: balanced && requireSpace ? new RegExp(createExceptionsPattern(exceptions) + "$") : new RegExp(endNeverPattern), hasExceptions: exceptions.length > 0, markers: new RegExp("^(" + markers.map(escape).join("|") + ")") }; return rule; }, {}); /** * Reports a beginning spacing error with an appropriate message. * @param {ASTNode} node - A comment node to check. * @param {string} message - An error message to report. * @param {Array} match - An array of match results for markers. * @param {string} refChar - Character used for reference in the error message. * @returns {void} */ function reportBegin(node, message, match, refChar) { var type = node.type.toLowerCase(), commentIdentifier = type === "block" ? "/*" : "//"; context.report({ node: node, fix: function fix(fixer) { var start = node.range[0]; var end = start + 2; if (requireSpace) { if (match) { end += match[0].length; } return fixer.insertTextAfterRange([start, end], " "); } end += match[0].length; return fixer.replaceTextRange([start, end], commentIdentifier + (match[1] ? match[1] : "")); }, message: message, data: { refChar: refChar } }); } /** * Reports an ending spacing error with an appropriate message. * @param {ASTNode} node - A comment node to check. * @param {string} message - An error message to report. * @param {string} match - An array of the matched whitespace characters. * @returns {void} */ function reportEnd(node, message, match) { context.report({ node: node, fix: function fix(fixer) { if (requireSpace) { return fixer.insertTextAfterRange([node.start, node.end - 2], " "); } var end = node.end - 2, start = end - match[0].length; return fixer.replaceTextRange([start, end], ""); }, message: message }); } /** * Reports a given comment if it's invalid. * @param {ASTNode} node - a comment node to check. * @returns {void} */ function checkCommentForSpace(node) { var type = node.type.toLowerCase(), rule = styleRules[type], commentIdentifier = type === "block" ? "/*" : "//"; // Ignores empty comments. if (node.value.length === 0) { return; } var beginMatch = rule.beginRegex.exec(node.value); var endMatch = rule.endRegex.exec(node.value); // Checks. if (requireSpace) { if (!beginMatch) { var hasMarker = rule.markers.exec(node.value); var marker = hasMarker ? commentIdentifier + hasMarker[0] : commentIdentifier; if (rule.hasExceptions) { reportBegin(node, "Expected exception block, space or tab after '{{refChar}}' in comment.", hasMarker, marker); } else { reportBegin(node, "Expected space or tab after '{{refChar}}' in comment.", hasMarker, marker); } } if (balanced && type === "block" && !endMatch) { reportEnd(node, "Expected space or tab before '*/' in comment."); } } else { if (beginMatch) { if (!beginMatch[1]) { reportBegin(node, "Unexpected space or tab after '{{refChar}}' in comment.", beginMatch, commentIdentifier); } else { reportBegin(node, "Unexpected space or tab after marker ({{refChar}}) in comment.", beginMatch, beginMatch[1]); } } if (balanced && type === "block" && endMatch) { reportEnd(node, "Unexpected space or tab before '*/' in comment.", endMatch); } } } return { Program: function Program() { var comments = sourceCode.getAllComments(); comments.filter(function (token) { return token.type !== "Shebang"; }).forEach(checkCommentForSpace); } }; } }; },{"../ast-utils":67,"lodash":48}],320:[function(require,module,exports){ /** * @fileoverview Rule to control usage of strict mode directives. * @author Brandon Mills */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var messages = { function: "Use the function form of 'use strict'.", global: "Use the global form of 'use strict'.", multiple: "Multiple 'use strict' directives.", never: "Strict mode is not permitted.", unnecessary: "Unnecessary 'use strict' directive.", module: "'use strict' is unnecessary inside of modules.", implied: "'use strict' is unnecessary when implied strict mode is enabled.", unnecessaryInClasses: "'use strict' is unnecessary inside of classes.", nonSimpleParameterList: "'use strict' directive inside a function with non-simple parameter list throws a syntax error since ES2016.", wrap: "Wrap {{name}} in a function with 'use strict' directive." }; /** * Gets all of the Use Strict Directives in the Directive Prologue of a group of * statements. * @param {ASTNode[]} statements Statements in the program or function body. * @returns {ASTNode[]} All of the Use Strict Directives. */ function getUseStrictDirectives(statements) { var directives = []; for (var i = 0; i < statements.length; i++) { var statement = statements[i]; if (statement.type === "ExpressionStatement" && statement.expression.type === "Literal" && statement.expression.value === "use strict") { directives[i] = statement; } else { break; } } return directives; } /** * Checks whether a given parameter is a simple parameter. * * @param {ASTNode} node - A pattern node to check. * @returns {boolean} `true` if the node is an Identifier node. */ function isSimpleParameter(node) { return node.type === "Identifier"; } /** * Checks whether a given parameter list is a simple parameter list. * * @param {ASTNode[]} params - A parameter list to check. * @returns {boolean} `true` if the every parameter is an Identifier node. */ function isSimpleParameterList(params) { return params.every(isSimpleParameter); } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require or disallow strict mode directives", category: "Strict Mode", recommended: false }, schema: [{ enum: ["never", "global", "function", "safe"] }], fixable: "code" }, create: function create(context) { var ecmaFeatures = context.parserOptions.ecmaFeatures || {}, scopes = [], classScopes = []; var mode = context.options[0] || "safe"; if (ecmaFeatures.impliedStrict) { mode = "implied"; } else if (mode === "safe") { mode = ecmaFeatures.globalReturn ? "global" : "function"; } /** * Determines whether a reported error should be fixed, depending on the error type. * @param {string} errorType The type of error * @returns {boolean} `true` if the reported error should be fixed */ function shouldFix(errorType) { return errorType === "multiple" || errorType === "unnecessary" || errorType === "module" || errorType === "implied" || errorType === "unnecessaryInClasses"; } /** * Gets a fixer function to remove a given 'use strict' directive. * @param {ASTNode} node The directive that should be removed * @returns {Function} A fixer function */ function getFixFunction(node) { return function (fixer) { return fixer.remove(node); }; } /** * Report a slice of an array of nodes with a given message. * @param {ASTNode[]} nodes Nodes. * @param {string} start Index to start from. * @param {string} end Index to end before. * @param {string} message Message to display. * @param {boolean} fix `true` if the directive should be fixed (i.e. removed) * @returns {void} */ function reportSlice(nodes, start, end, message, fix) { nodes.slice(start, end).forEach(function (node) { context.report({ node: node, message: message, fix: fix ? getFixFunction(node) : null }); }); } /** * Report all nodes in an array with a given message. * @param {ASTNode[]} nodes Nodes. * @param {string} message Message to display. * @param {boolean} fix `true` if the directive should be fixed (i.e. removed) * @returns {void} */ function reportAll(nodes, message, fix) { reportSlice(nodes, 0, nodes.length, message, fix); } /** * Report all nodes in an array, except the first, with a given message. * @param {ASTNode[]} nodes Nodes. * @param {string} message Message to display. * @param {boolean} fix `true` if the directive should be fixed (i.e. removed) * @returns {void} */ function reportAllExceptFirst(nodes, message, fix) { reportSlice(nodes, 1, nodes.length, message, fix); } /** * Entering a function in 'function' mode pushes a new nested scope onto the * stack. The new scope is true if the nested function is strict mode code. * @param {ASTNode} node The function declaration or expression. * @param {ASTNode[]} useStrictDirectives The Use Strict Directives of the node. * @returns {void} */ function enterFunctionInFunctionMode(node, useStrictDirectives) { var isInClass = classScopes.length > 0, isParentGlobal = scopes.length === 0 && classScopes.length === 0, isParentStrict = scopes.length > 0 && scopes[scopes.length - 1], isStrict = useStrictDirectives.length > 0; if (isStrict) { if (!isSimpleParameterList(node.params)) { context.report({ node: useStrictDirectives[0], message: messages.nonSimpleParameterList }); } else if (isParentStrict) { context.report({ node: useStrictDirectives[0], message: messages.unnecessary, fix: getFixFunction(useStrictDirectives[0]) }); } else if (isInClass) { context.report({ node: useStrictDirectives[0], message: messages.unnecessaryInClasses, fix: getFixFunction(useStrictDirectives[0]) }); } reportAllExceptFirst(useStrictDirectives, messages.multiple, true); } else if (isParentGlobal) { if (isSimpleParameterList(node.params)) { context.report({ node: node, message: messages.function }); } else { context.report({ node: node, message: messages.wrap, data: { name: astUtils.getFunctionNameWithKind(node) } }); } } scopes.push(isParentStrict || isStrict); } /** * Exiting a function in 'function' mode pops its scope off the stack. * @returns {void} */ function exitFunctionInFunctionMode() { scopes.pop(); } /** * Enter a function and either: * - Push a new nested scope onto the stack (in 'function' mode). * - Report all the Use Strict Directives (in the other modes). * @param {ASTNode} node The function declaration or expression. * @returns {void} */ function enterFunction(node) { var isBlock = node.body.type === "BlockStatement", useStrictDirectives = isBlock ? getUseStrictDirectives(node.body.body) : []; if (mode === "function") { enterFunctionInFunctionMode(node, useStrictDirectives); } else if (useStrictDirectives.length > 0) { if (isSimpleParameterList(node.params)) { reportAll(useStrictDirectives, messages[mode], shouldFix(mode)); } else { context.report({ node: useStrictDirectives[0], message: messages.nonSimpleParameterList }); reportAllExceptFirst(useStrictDirectives, messages.multiple, true); } } } var rule = { Program: function Program(node) { var useStrictDirectives = getUseStrictDirectives(node.body); if (node.sourceType === "module") { mode = "module"; } if (mode === "global") { if (node.body.length > 0 && useStrictDirectives.length === 0) { context.report({ node: node, message: messages.global }); } reportAllExceptFirst(useStrictDirectives, messages.multiple, true); } else { reportAll(useStrictDirectives, messages[mode], shouldFix(mode)); } }, FunctionDeclaration: enterFunction, FunctionExpression: enterFunction, ArrowFunctionExpression: enterFunction }; if (mode === "function") { Object.assign(rule, { // Inside of class bodies are always strict mode. ClassBody: function ClassBody() { classScopes.push(true); }, "ClassBody:exit": function ClassBodyExit() { classScopes.pop(); }, "FunctionDeclaration:exit": exitFunctionInFunctionMode, "FunctionExpression:exit": exitFunctionInFunctionMode, "ArrowFunctionExpression:exit": exitFunctionInFunctionMode }); } return rule; } }; },{"../ast-utils":67}],321:[function(require,module,exports){ /** * @fileoverview Rule to enforce spacing around colons of switch statements. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce spacing around colons of switch statements", category: "Stylistic Issues", recommended: false }, schema: [{ type: "object", properties: { before: { type: "boolean" }, after: { type: "boolean" } }, additionalProperties: false }], fixable: "whitespace" }, create: function create(context) { var sourceCode = context.getSourceCode(); var options = context.options[0] || {}; var beforeSpacing = options.before === true; // false by default var afterSpacing = options.after !== false; // true by default /** * Get the colon token of the given SwitchCase node. * @param {ASTNode} node The SwitchCase node to get. * @returns {Token} The colon token of the node. */ function getColonToken(node) { if (node.test) { return sourceCode.getTokenAfter(node.test, astUtils.isColonToken); } return sourceCode.getFirstToken(node, 1); } /** * Check whether the spacing between the given 2 tokens is valid or not. * @param {Token} left The left token to check. * @param {Token} right The right token to check. * @param {boolean} expected The expected spacing to check. `true` if there should be a space. * @returns {boolean} `true` if the spacing between the tokens is valid. */ function isValidSpacing(left, right, expected) { return astUtils.isClosingBraceToken(right) || !astUtils.isTokenOnSameLine(left, right) || sourceCode.isSpaceBetweenTokens(left, right) === expected; } /** * Check whether comments exist between the given 2 tokens. * @param {Token} left The left token to check. * @param {Token} right The right token to check. * @returns {boolean} `true` if comments exist between the given 2 tokens. */ function commentsExistBetween(left, right) { return sourceCode.getFirstTokenBetween(left, right, { includeComments: true, filter: astUtils.isCommentToken }) !== null; } /** * Fix the spacing between the given 2 tokens. * @param {RuleFixer} fixer The fixer to fix. * @param {Token} left The left token of fix range. * @param {Token} right The right token of fix range. * @param {boolean} spacing The spacing style. `true` if there should be a space. * @returns {Fix|null} The fix object. */ function _fix(fixer, left, right, spacing) { if (commentsExistBetween(left, right)) { return null; } if (spacing) { return fixer.insertTextAfter(left, " "); } return fixer.removeRange([left.range[1], right.range[0]]); } return { SwitchCase: function SwitchCase(node) { var colonToken = getColonToken(node); var beforeToken = sourceCode.getTokenBefore(colonToken); var afterToken = sourceCode.getTokenAfter(colonToken); if (!isValidSpacing(beforeToken, colonToken, beforeSpacing)) { context.report({ node: node, loc: colonToken.loc, message: "{{verb}} space(s) before this colon.", data: { verb: beforeSpacing ? "Expected" : "Unexpected" }, fix: function fix(fixer) { return _fix(fixer, beforeToken, colonToken, beforeSpacing); } }); } if (!isValidSpacing(colonToken, afterToken, afterSpacing)) { context.report({ node: node, loc: colonToken.loc, message: "{{verb}} space(s) after this colon.", data: { verb: afterSpacing ? "Expected" : "Unexpected" }, fix: function fix(fixer) { return _fix(fixer, colonToken, afterToken, afterSpacing); } }); } } }; } }; },{"../ast-utils":67}],322:[function(require,module,exports){ /** * @fileoverview Rule to enforce description with the `Symbol` object * @author Jarek Rencz */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require symbol descriptions", category: "ECMAScript 6", recommended: false }, schema: [] }, create: function create(context) { /** * Reports if node does not conform the rule in case rule is set to * report missing description * * @param {ASTNode} node - A CallExpression node to check. * @returns {void} */ function checkArgument(node) { if (node.arguments.length === 0) { context.report({ node: node, message: "Expected Symbol to have a description." }); } } return { "Program:exit": function ProgramExit() { var scope = context.getScope(); var variable = astUtils.getVariableByName(scope, "Symbol"); if (variable && variable.defs.length === 0) { variable.references.forEach(function (reference) { var node = reference.identifier; if (astUtils.isCallee(node)) { checkArgument(node.parent); } }); } } }; } }; },{"../ast-utils":67}],323:[function(require,module,exports){ /** * @fileoverview Rule to enforce spacing around embedded expressions of template strings * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var OPEN_PAREN = /\$\{$/; var CLOSE_PAREN = /^\}/; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require or disallow spacing around embedded expressions of template strings", category: "ECMAScript 6", recommended: false }, fixable: "whitespace", schema: [{ enum: ["always", "never"] }] }, create: function create(context) { var sourceCode = context.getSourceCode(); var always = context.options[0] === "always"; var prefix = always ? "Expected" : "Unexpected"; /** * Checks spacing before `}` of a given token. * @param {Token} token - A token to check. This is a Template token. * @returns {void} */ function checkSpacingBefore(token) { var prevToken = sourceCode.getTokenBefore(token); if (prevToken && CLOSE_PAREN.test(token.value) && astUtils.isTokenOnSameLine(prevToken, token) && sourceCode.isSpaceBetweenTokens(prevToken, token) !== always) { context.report({ loc: token.loc.start, message: "{{prefix}} space(s) before '}'.", data: { prefix: prefix }, fix: function fix(fixer) { if (always) { return fixer.insertTextBefore(token, " "); } return fixer.removeRange([prevToken.range[1], token.range[0]]); } }); } } /** * Checks spacing after `${` of a given token. * @param {Token} token - A token to check. This is a Template token. * @returns {void} */ function checkSpacingAfter(token) { var nextToken = sourceCode.getTokenAfter(token); if (nextToken && OPEN_PAREN.test(token.value) && astUtils.isTokenOnSameLine(token, nextToken) && sourceCode.isSpaceBetweenTokens(token, nextToken) !== always) { context.report({ loc: { line: token.loc.end.line, column: token.loc.end.column - 2 }, message: "{{prefix}} space(s) after '${'.", data: { prefix: prefix }, fix: function fix(fixer) { if (always) { return fixer.insertTextAfter(token, " "); } return fixer.removeRange([token.range[1], nextToken.range[0]]); } }); } } return { TemplateElement: function TemplateElement(node) { var token = sourceCode.getFirstToken(node); checkSpacingBefore(token); checkSpacingAfter(token); } }; } }; },{"../ast-utils":67}],324:[function(require,module,exports){ /** * @fileoverview Rule to check spacing between template tags and their literals * @author Jonathan Wilsson */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require or disallow spacing between template tags and their literals", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ enum: ["always", "never"] }] }, create: function create(context) { var never = context.options[0] !== "always"; var sourceCode = context.getSourceCode(); /** * Check if a space is present between a template tag and its literal * @param {ASTNode} node node to evaluate * @returns {void} * @private */ function checkSpacing(node) { var tagToken = sourceCode.getTokenBefore(node.quasi); var literalToken = sourceCode.getFirstToken(node.quasi); var hasWhitespace = sourceCode.isSpaceBetweenTokens(tagToken, literalToken); if (never && hasWhitespace) { context.report({ node: node, loc: tagToken.loc.start, message: "Unexpected space between template tag and template literal.", fix: function fix(fixer) { var comments = sourceCode.getCommentsBefore(node.quasi); // Don't fix anything if there's a single line comment after the template tag if (comments.some(function (comment) { return comment.type === "Line"; })) { return null; } return fixer.replaceTextRange([tagToken.range[1], literalToken.range[0]], comments.reduce(function (text, comment) { return text + sourceCode.getText(comment); }, "")); } }); } else if (!never && !hasWhitespace) { context.report({ node: node, loc: tagToken.loc.start, message: "Missing space between template tag and template literal.", fix: function fix(fixer) { return fixer.insertTextAfter(tagToken, " "); } }); } } return { TaggedTemplateExpression: checkSpacing }; } }; },{}],325:[function(require,module,exports){ /** * @fileoverview Require or disallow Unicode BOM * @author Andrew Johnston */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require or disallow Unicode byte order mark (BOM)", category: "Stylistic Issues", recommended: false }, fixable: "whitespace", schema: [{ enum: ["always", "never"] }] }, create: function create(context) { //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { Program: function checkUnicodeBOM(node) { var sourceCode = context.getSourceCode(), location = { column: 0, line: 1 }, requireBOM = context.options[0] || "never"; if (!sourceCode.hasBOM && requireBOM === "always") { context.report({ node: node, loc: location, message: "Expected Unicode BOM (Byte Order Mark).", fix: function fix(fixer) { return fixer.insertTextBeforeRange([0, 1], "\uFEFF"); } }); } else if (sourceCode.hasBOM && requireBOM === "never") { context.report({ node: node, loc: location, message: "Unexpected Unicode BOM (Byte Order Mark).", fix: function fix(fixer) { return fixer.removeRange([-1, 0]); } }); } } }; } }; },{}],326:[function(require,module,exports){ /** * @fileoverview Rule to flag comparisons to the value NaN * @author James Allardice */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require calls to `isNaN()` when checking for `NaN`", category: "Possible Errors", recommended: true }, schema: [] }, create: function create(context) { return { BinaryExpression: function BinaryExpression(node) { if (/^(?:[<>]|[!=]=)=?$/.test(node.operator) && (node.left.name === "NaN" || node.right.name === "NaN")) { context.report({ node: node, message: "Use the isNaN function to compare with NaN." }); } } }; } }; },{}],327:[function(require,module,exports){ /** * @fileoverview Validates JSDoc comments are syntactically correct * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var doctrine = require("doctrine"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce valid JSDoc comments", category: "Possible Errors", recommended: false }, schema: [{ type: "object", properties: { prefer: { type: "object", additionalProperties: { type: "string" } }, preferType: { type: "object", additionalProperties: { type: "string" } }, requireReturn: { type: "boolean" }, requireParamDescription: { type: "boolean" }, requireReturnDescription: { type: "boolean" }, matchDescription: { type: "string" }, requireReturnType: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var options = context.options[0] || {}, prefer = options.prefer || {}, sourceCode = context.getSourceCode(), // these both default to true, so you have to explicitly make them false requireReturn = options.requireReturn !== false, requireParamDescription = options.requireParamDescription !== false, requireReturnDescription = options.requireReturnDescription !== false, requireReturnType = options.requireReturnType !== false, preferType = options.preferType || {}, checkPreferType = Object.keys(preferType).length !== 0; //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- // Using a stack to store if a function returns or not (handling nested functions) var fns = []; /** * Check if node type is a Class * @param {ASTNode} node node to check. * @returns {boolean} True is its a class * @private */ function isTypeClass(node) { return node.type === "ClassExpression" || node.type === "ClassDeclaration"; } /** * When parsing a new function, store it in our function stack. * @param {ASTNode} node A function node to check. * @returns {void} * @private */ function startFunction(node) { fns.push({ returnPresent: node.type === "ArrowFunctionExpression" && node.body.type !== "BlockStatement" || isTypeClass(node) }); } /** * Indicate that return has been found in the current function. * @param {ASTNode} node The return node. * @returns {void} * @private */ function addReturn(node) { var functionState = fns[fns.length - 1]; if (functionState && node.argument !== null) { functionState.returnPresent = true; } } /** * Check if return tag type is void or undefined * @param {Object} tag JSDoc tag * @returns {boolean} True if its of type void or undefined * @private */ function isValidReturnType(tag) { return tag.type === null || tag.type.name === "void" || tag.type.type === "UndefinedLiteral"; } /** * Check if type should be validated based on some exceptions * @param {Object} type JSDoc tag * @returns {boolean} True if it can be validated * @private */ function canTypeBeValidated(type) { return type !== "UndefinedLiteral" && // {undefined} as there is no name property available. type !== "NullLiteral" && // {null} type !== "NullableLiteral" && // {?} type !== "FunctionType" && // {function(a)} type !== "AllLiteral"; // {*} } /** * Extract the current and expected type based on the input type object * @param {Object} type JSDoc tag * @returns {Object} current and expected type object * @private */ function getCurrentExpectedTypes(type) { var currentType = void 0; if (type.name) { currentType = type.name; } else if (type.expression) { currentType = type.expression.name; } var expectedType = currentType && preferType[currentType]; return { currentType: currentType, expectedType: expectedType }; } /** * Validate type for a given JSDoc node * @param {Object} jsdocNode JSDoc node * @param {Object} type JSDoc tag * @returns {void} * @private */ function validateType(jsdocNode, type) { if (!type || !canTypeBeValidated(type.type)) { return; } var typesToCheck = []; var elements = []; switch (type.type) { case "TypeApplication": // {Array.} elements = type.applications[0].type === "UnionType" ? type.applications[0].elements : type.applications; typesToCheck.push(getCurrentExpectedTypes(type)); break; case "RecordType": // {{20:String}} elements = type.fields; break; case "UnionType": // {String|number|Test} case "ArrayType": // {[String, number, Test]} elements = type.elements; break; case "FieldType": // Array.<{count: number, votes: number}> if (type.value) { typesToCheck.push(getCurrentExpectedTypes(type.value)); } break; default: typesToCheck.push(getCurrentExpectedTypes(type)); } elements.forEach(validateType.bind(null, jsdocNode)); typesToCheck.forEach(function (typeToCheck) { if (typeToCheck.expectedType && typeToCheck.expectedType !== typeToCheck.currentType) { context.report({ node: jsdocNode, message: "Use '{{expectedType}}' instead of '{{currentType}}'.", data: { currentType: typeToCheck.currentType, expectedType: typeToCheck.expectedType } }); } }); } /** * Validate the JSDoc node and output warnings if anything is wrong. * @param {ASTNode} node The AST node to check. * @returns {void} * @private */ function checkJSDoc(node) { var jsdocNode = sourceCode.getJSDocComment(node), functionData = fns.pop(), params = Object.create(null); var hasReturns = false, hasConstructor = false, isInterface = false, isOverride = false, isAbstract = false, jsdoc = void 0; // make sure only to validate JSDoc comments if (jsdocNode) { try { jsdoc = doctrine.parse(jsdocNode.value, { strict: true, unwrap: true, sloppy: true }); } catch (ex) { if (/braces/i.test(ex.message)) { context.report({ node: jsdocNode, message: "JSDoc type missing brace." }); } else { context.report({ node: jsdocNode, message: "JSDoc syntax error." }); } return; } jsdoc.tags.forEach(function (tag) { switch (tag.title.toLowerCase()) { case "param": case "arg": case "argument": if (!tag.type) { context.report({ node: jsdocNode, message: "Missing JSDoc parameter type for '{{name}}'.", data: { name: tag.name } }); } if (!tag.description && requireParamDescription) { context.report({ node: jsdocNode, message: "Missing JSDoc parameter description for '{{name}}'.", data: { name: tag.name } }); } if (params[tag.name]) { context.report({ node: jsdocNode, message: "Duplicate JSDoc parameter '{{name}}'.", data: { name: tag.name } }); } else if (tag.name.indexOf(".") === -1) { params[tag.name] = 1; } break; case "return": case "returns": hasReturns = true; if (!requireReturn && !functionData.returnPresent && (tag.type === null || !isValidReturnType(tag)) && !isAbstract) { context.report({ node: jsdocNode, message: "Unexpected @{{title}} tag; function has no return statement.", data: { title: tag.title } }); } else { if (requireReturnType && !tag.type) { context.report({ node: jsdocNode, message: "Missing JSDoc return type." }); } if (!isValidReturnType(tag) && !tag.description && requireReturnDescription) { context.report({ node: jsdocNode, message: "Missing JSDoc return description." }); } } break; case "constructor": case "class": hasConstructor = true; break; case "override": case "inheritdoc": isOverride = true; break; case "abstract": case "virtual": isAbstract = true; break; case "interface": isInterface = true; break; // no default } // check tag preferences if (prefer.hasOwnProperty(tag.title) && tag.title !== prefer[tag.title]) { context.report({ node: jsdocNode, message: "Use @{{name}} instead.", data: { name: prefer[tag.title] } }); } // validate the types if (checkPreferType && tag.type) { validateType(jsdocNode, tag.type); } }); // check for functions missing @returns if (!isOverride && !hasReturns && !hasConstructor && !isInterface && node.parent.kind !== "get" && node.parent.kind !== "constructor" && node.parent.kind !== "set" && !isTypeClass(node)) { if (requireReturn || functionData.returnPresent) { context.report({ node: jsdocNode, message: "Missing JSDoc @{{returns}} for function.", data: { returns: prefer.returns || "returns" } }); } } // check the parameters var jsdocParams = Object.keys(params); if (node.params) { node.params.forEach(function (param, i) { if (param.type === "AssignmentPattern") { param = param.left; } var name = param.name; // TODO(nzakas): Figure out logical things to do with destructured, default, rest params if (param.type === "Identifier") { if (jsdocParams[i] && name !== jsdocParams[i]) { context.report({ node: jsdocNode, message: "Expected JSDoc for '{{name}}' but found '{{jsdocName}}'.", data: { name: name, jsdocName: jsdocParams[i] } }); } else if (!params[name] && !isOverride) { context.report({ node: jsdocNode, message: "Missing JSDoc for parameter '{{name}}'.", data: { name: name } }); } } }); } if (options.matchDescription) { var regex = new RegExp(options.matchDescription); if (!regex.test(jsdoc.description)) { context.report({ node: jsdocNode, message: "JSDoc description does not satisfy the regex pattern." }); } } } } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { ArrowFunctionExpression: startFunction, FunctionExpression: startFunction, FunctionDeclaration: startFunction, ClassExpression: startFunction, ClassDeclaration: startFunction, "ArrowFunctionExpression:exit": checkJSDoc, "FunctionExpression:exit": checkJSDoc, "FunctionDeclaration:exit": checkJSDoc, "ClassExpression:exit": checkJSDoc, "ClassDeclaration:exit": checkJSDoc, ReturnStatement: addReturn }; } }; },{"doctrine":9}],328:[function(require,module,exports){ /** * @fileoverview Ensures that the results of typeof are compared against a valid string * @author Ian Christian Myers */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "enforce comparing `typeof` expressions against valid strings", category: "Possible Errors", recommended: true }, schema: [{ type: "object", properties: { requireStringLiterals: { type: "boolean" } }, additionalProperties: false }] }, create: function create(context) { var VALID_TYPES = ["symbol", "undefined", "object", "boolean", "number", "string", "function"], OPERATORS = ["==", "===", "!=", "!=="]; var requireStringLiterals = context.options[0] && context.options[0].requireStringLiterals; /** * Determines whether a node is a typeof expression. * @param {ASTNode} node The node * @returns {boolean} `true` if the node is a typeof expression */ function isTypeofExpression(node) { return node.type === "UnaryExpression" && node.operator === "typeof"; } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { UnaryExpression: function UnaryExpression(node) { if (isTypeofExpression(node)) { var parent = context.getAncestors().pop(); if (parent.type === "BinaryExpression" && OPERATORS.indexOf(parent.operator) !== -1) { var sibling = parent.left === node ? parent.right : parent.left; if (sibling.type === "Literal" || sibling.type === "TemplateLiteral" && !sibling.expressions.length) { var value = sibling.type === "Literal" ? sibling.value : sibling.quasis[0].value.cooked; if (VALID_TYPES.indexOf(value) === -1) { context.report({ node: sibling, message: "Invalid typeof comparison value." }); } } else if (requireStringLiterals && !isTypeofExpression(sibling)) { context.report({ node: sibling, message: "Typeof comparisons should be to string literals." }); } } } } }; } }; },{}],329:[function(require,module,exports){ /** * @fileoverview Rule to enforce var declarations are only at the top of a function. * @author Danny Fritz * @author Gyandeep Singh */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require `var` declarations be placed at the top of their containing scope", category: "Best Practices", recommended: false }, schema: [] }, create: function create(context) { var errorMessage = "All 'var' declarations must be at the top of the function scope."; //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * @param {ASTNode} node - any node * @returns {boolean} whether the given node structurally represents a directive */ function looksLikeDirective(node) { return node.type === "ExpressionStatement" && node.expression.type === "Literal" && typeof node.expression.value === "string"; } /** * Check to see if its a ES6 import declaration * @param {ASTNode} node - any node * @returns {boolean} whether the given node represents a import declaration */ function looksLikeImport(node) { return node.type === "ImportDeclaration" || node.type === "ImportSpecifier" || node.type === "ImportDefaultSpecifier" || node.type === "ImportNamespaceSpecifier"; } /** * Checks whether a given node is a variable declaration or not. * * @param {ASTNode} node - any node * @returns {boolean} `true` if the node is a variable declaration. */ function isVariableDeclaration(node) { return node.type === "VariableDeclaration" || node.type === "ExportNamedDeclaration" && node.declaration && node.declaration.type === "VariableDeclaration"; } /** * Checks whether this variable is on top of the block body * @param {ASTNode} node - The node to check * @param {ASTNode[]} statements - collection of ASTNodes for the parent node block * @returns {boolean} True if var is on top otherwise false */ function isVarOnTop(node, statements) { var l = statements.length; var i = 0; // skip over directives for (; i < l; ++i) { if (!looksLikeDirective(statements[i]) && !looksLikeImport(statements[i])) { break; } } for (; i < l; ++i) { if (!isVariableDeclaration(statements[i])) { return false; } if (statements[i] === node) { return true; } } return false; } /** * Checks whether variable is on top at the global level * @param {ASTNode} node - The node to check * @param {ASTNode} parent - Parent of the node * @returns {void} */ function globalVarCheck(node, parent) { if (!isVarOnTop(node, parent.body)) { context.report({ node: node, message: errorMessage }); } } /** * Checks whether variable is on top at functional block scope level * @param {ASTNode} node - The node to check * @param {ASTNode} parent - Parent of the node * @param {ASTNode} grandParent - Parent of the node's parent * @returns {void} */ function blockScopeVarCheck(node, parent, grandParent) { if (!(/Function/.test(grandParent.type) && parent.type === "BlockStatement" && isVarOnTop(node, parent.body))) { context.report({ node: node, message: errorMessage }); } } //-------------------------------------------------------------------------- // Public API //-------------------------------------------------------------------------- return { VariableDeclaration: function VariableDeclaration(node) { var ancestors = context.getAncestors(); var parent = ancestors.pop(); var grandParent = ancestors.pop(); if (node.kind === "var") { // check variable is `var` type and not `let` or `const` if (parent.type === "ExportNamedDeclaration") { node = parent; parent = grandParent; grandParent = ancestors.pop(); } if (parent.type === "Program") { // That means its a global variable globalVarCheck(node, parent); } else { blockScopeVarCheck(node, parent, grandParent); } } } }; } }; },{}],330:[function(require,module,exports){ /** * @fileoverview Rule to flag when IIFE is not wrapped in parens * @author Ilya Volodin */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require parentheses around immediate `function` invocations", category: "Best Practices", recommended: false }, schema: [{ enum: ["outside", "inside", "any"] }, { type: "object", properties: { functionPrototypeMethods: { type: "boolean" } }, additionalProperties: false }], fixable: "code" }, create: function create(context) { var style = context.options[0] || "outside"; var includeFunctionPrototypeMethods = context.options[1] && context.options[1].functionPrototypeMethods || false; var sourceCode = context.getSourceCode(); /** * Check if the node is wrapped in () * @param {ASTNode} node node to evaluate * @returns {boolean} True if it is wrapped * @private */ function wrapped(node) { return astUtils.isParenthesised(sourceCode, node); } /** * Get the function node from an IIFE * @param {ASTNode} node node to evaluate * @returns {ASTNode} node that is the function expression of the given IIFE, or null if none exist */ function getFunctionNodeFromIIFE(node) { var callee = node.callee; if (callee.type === "FunctionExpression") { return callee; } if (includeFunctionPrototypeMethods && callee.type === "MemberExpression" && callee.object.type === "FunctionExpression" && (astUtils.getStaticPropertyName(callee) === "call" || astUtils.getStaticPropertyName(callee) === "apply")) { return callee.object; } return null; } return { CallExpression: function CallExpression(node) { var innerNode = getFunctionNodeFromIIFE(node); if (!innerNode) { return; } var callExpressionWrapped = wrapped(node), functionExpressionWrapped = wrapped(innerNode); if (!callExpressionWrapped && !functionExpressionWrapped) { context.report({ node: node, message: "Wrap an immediate function invocation in parentheses.", fix: function fix(fixer) { var nodeToSurround = style === "inside" ? innerNode : node; return fixer.replaceText(nodeToSurround, "(" + sourceCode.getText(nodeToSurround) + ")"); } }); } else if (style === "inside" && !functionExpressionWrapped) { context.report({ node: node, message: "Wrap only the function expression in parens.", fix: function fix(fixer) { /* * The outer call expression will always be wrapped at this point. * Replace the range between the end of the function expression and the end of the call expression. * for example, in `(function(foo) {}(bar))`, the range `(bar))` should get replaced with `)(bar)`. * Replace the parens from the outer expression, and parenthesize the function expression. */ var parenAfter = sourceCode.getTokenAfter(node); return fixer.replaceTextRange([innerNode.range[1], parenAfter.range[1]], ")" + sourceCode.getText().slice(innerNode.range[1], parenAfter.range[0])); } }); } else if (style === "outside" && !callExpressionWrapped) { context.report({ node: node, message: "Move the invocation into the parens that contain the function.", fix: function fix(fixer) { /* * The inner function expression will always be wrapped at this point. * It's only necessary to replace the range between the end of the function expression * and the call expression. For example, in `(function(foo) {})(bar)`, the range `)(bar)` * should get replaced with `(bar))`. */ var parenAfter = sourceCode.getTokenAfter(innerNode); return fixer.replaceTextRange([parenAfter.range[0], node.range[1]], sourceCode.getText().slice(parenAfter.range[1], node.range[1]) + ")"); } }); } } }; } }; },{"../ast-utils":67}],331:[function(require,module,exports){ /** * @fileoverview Rule to flag when regex literals are not wrapped in parens * @author Matt DuVall */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require parenthesis around regex literals", category: "Stylistic Issues", recommended: false }, schema: [], fixable: "code" }, create: function create(context) { var sourceCode = context.getSourceCode(); return { Literal: function Literal(node) { var token = sourceCode.getFirstToken(node), nodeType = token.type; if (nodeType === "RegularExpression") { var source = sourceCode.getTokenBefore(node); var ancestors = context.getAncestors(); var grandparent = ancestors[ancestors.length - 1]; if (grandparent.type === "MemberExpression" && grandparent.object === node && (!source || source.value !== "(")) { context.report({ node: node, message: "Wrap the regexp literal in parens to disambiguate the slash.", fix: function fix(fixer) { return fixer.replaceText(node, "(" + sourceCode.getText(node) + ")"); } }); } } } }; } }; },{}],332:[function(require,module,exports){ /** * @fileoverview Rule to check the spacing around the * in yield* expressions. * @author Bryan Smith */ "use strict"; //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require or disallow spacing around the `*` in `yield*` expressions", category: "ECMAScript 6", recommended: false }, fixable: "whitespace", schema: [{ oneOf: [{ enum: ["before", "after", "both", "neither"] }, { type: "object", properties: { before: { type: "boolean" }, after: { type: "boolean" } }, additionalProperties: false }] }] }, create: function create(context) { var sourceCode = context.getSourceCode(); var mode = function (option) { if (!option || typeof option === "string") { return { before: { before: true, after: false }, after: { before: false, after: true }, both: { before: true, after: true }, neither: { before: false, after: false } }[option || "after"]; } return option; }(context.options[0]); /** * Checks the spacing between two tokens before or after the star token. * @param {string} side Either "before" or "after". * @param {Token} leftToken `function` keyword token if side is "before", or * star token if side is "after". * @param {Token} rightToken Star token if side is "before", or identifier * token if side is "after". * @returns {void} */ function checkSpacing(side, leftToken, rightToken) { if (sourceCode.isSpaceBetweenTokens(leftToken, rightToken) !== mode[side]) { var after = leftToken.value === "*"; var spaceRequired = mode[side]; var node = after ? leftToken : rightToken; var type = spaceRequired ? "Missing" : "Unexpected"; var message = "{{type}} space {{side}} *."; context.report({ node: node, message: message, data: { type: type, side: side }, fix: function fix(fixer) { if (spaceRequired) { if (after) { return fixer.insertTextAfter(node, " "); } return fixer.insertTextBefore(node, " "); } return fixer.removeRange([leftToken.range[1], rightToken.range[0]]); } }); } } /** * Enforces the spacing around the star if node is a yield* expression. * @param {ASTNode} node A yield expression node. * @returns {void} */ function checkExpression(node) { if (!node.delegate) { return; } var tokens = sourceCode.getFirstTokens(node, 3); var yieldToken = tokens[0]; var starToken = tokens[1]; var nextToken = tokens[2]; checkSpacing("before", yieldToken, starToken); checkSpacing("after", starToken, nextToken); } return { YieldExpression: checkExpression }; } }; },{}],333:[function(require,module,exports){ /** * @fileoverview Rule to require or disallow yoda comparisons * @author Nicholas C. Zakas */ "use strict"; //-------------------------------------------------------------------------- // Requirements //-------------------------------------------------------------------------- var astUtils = require("../ast-utils"); //-------------------------------------------------------------------------- // Helpers //-------------------------------------------------------------------------- /** * Determines whether an operator is a comparison operator. * @param {string} operator The operator to check. * @returns {boolean} Whether or not it is a comparison operator. */ function isComparisonOperator(operator) { return (/^(==|===|!=|!==|<|>|<=|>=)$/.test(operator) ); } /** * Determines whether an operator is an equality operator. * @param {string} operator The operator to check. * @returns {boolean} Whether or not it is an equality operator. */ function isEqualityOperator(operator) { return (/^(==|===)$/.test(operator) ); } /** * Determines whether an operator is one used in a range test. * Allowed operators are `<` and `<=`. * @param {string} operator The operator to check. * @returns {boolean} Whether the operator is used in range tests. */ function isRangeTestOperator(operator) { return ["<", "<="].indexOf(operator) >= 0; } /** * Determines whether a non-Literal node is a negative number that should be * treated as if it were a single Literal node. * @param {ASTNode} node Node to test. * @returns {boolean} True if the node is a negative number that looks like a * real literal and should be treated as such. */ function looksLikeLiteral(node) { return node.type === "UnaryExpression" && node.operator === "-" && node.prefix && node.argument.type === "Literal" && typeof node.argument.value === "number"; } /** * Attempts to derive a Literal node from nodes that are treated like literals. * @param {ASTNode} node Node to normalize. * @param {number} [defaultValue] The default value to be returned if the node * is not a Literal. * @returns {ASTNode} One of the following options. * 1. The original node if the node is already a Literal * 2. A normalized Literal node with the negative number as the value if the * node represents a negative number literal. * 3. The Literal node which has the `defaultValue` argument if it exists. * 4. Otherwise `null`. */ function getNormalizedLiteral(node, defaultValue) { if (node.type === "Literal") { return node; } if (looksLikeLiteral(node)) { return { type: "Literal", value: -node.argument.value, raw: "-" + node.argument.value }; } if (defaultValue) { return { type: "Literal", value: defaultValue, raw: String(defaultValue) }; } return null; } /** * Checks whether two expressions reference the same value. For example: * a = a * a.b = a.b * a[0] = a[0] * a['b'] = a['b'] * @param {ASTNode} a Left side of the comparison. * @param {ASTNode} b Right side of the comparison. * @returns {boolean} True if both sides match and reference the same value. */ function same(a, b) { if (a.type !== b.type) { return false; } switch (a.type) { case "Identifier": return a.name === b.name; case "Literal": return a.value === b.value; case "MemberExpression": { var nameA = astUtils.getStaticPropertyName(a); // x.y = x["y"] if (nameA) { return same(a.object, b.object) && nameA === astUtils.getStaticPropertyName(b); } // x[0] = x[0] // x[y] = x[y] // x.y = x.y return a.computed === b.computed && same(a.object, b.object) && same(a.property, b.property); } case "ThisExpression": return true; default: return false; } } //------------------------------------------------------------------------------ // Rule Definition //------------------------------------------------------------------------------ module.exports = { meta: { docs: { description: "require or disallow \"Yoda\" conditions", category: "Best Practices", recommended: false }, schema: [{ enum: ["always", "never"] }, { type: "object", properties: { exceptRange: { type: "boolean" }, onlyEquality: { type: "boolean" } }, additionalProperties: false }], fixable: "code" }, create: function create(context) { // Default to "never" (!always) if no option var always = context.options[0] === "always"; var exceptRange = context.options[1] && context.options[1].exceptRange; var onlyEquality = context.options[1] && context.options[1].onlyEquality; var sourceCode = context.getSourceCode(); /** * Determines whether node represents a range test. * A range test is a "between" test like `(0 <= x && x < 1)` or an "outside" * test like `(x < 0 || 1 <= x)`. It must be wrapped in parentheses, and * both operators must be `<` or `<=`. Finally, the literal on the left side * must be less than or equal to the literal on the right side so that the * test makes any sense. * @param {ASTNode} node LogicalExpression node to test. * @returns {boolean} Whether node is a range test. */ function isRangeTest(node) { var left = node.left, right = node.right; /** * Determines whether node is of the form `0 <= x && x < 1`. * @returns {boolean} Whether node is a "between" range test. */ function isBetweenTest() { var leftLiteral = void 0, rightLiteral = void 0; return node.operator === "&&" && (leftLiteral = getNormalizedLiteral(left.left)) && (rightLiteral = getNormalizedLiteral(right.right, Number.POSITIVE_INFINITY)) && leftLiteral.value <= rightLiteral.value && same(left.right, right.left); } /** * Determines whether node is of the form `x < 0 || 1 <= x`. * @returns {boolean} Whether node is an "outside" range test. */ function isOutsideTest() { var leftLiteral = void 0, rightLiteral = void 0; return node.operator === "||" && (leftLiteral = getNormalizedLiteral(left.right, Number.NEGATIVE_INFINITY)) && (rightLiteral = getNormalizedLiteral(right.left)) && leftLiteral.value <= rightLiteral.value && same(left.left, right.right); } /** * Determines whether node is wrapped in parentheses. * @returns {boolean} Whether node is preceded immediately by an open * paren token and followed immediately by a close * paren token. */ function isParenWrapped() { return astUtils.isParenthesised(sourceCode, node); } return node.type === "LogicalExpression" && left.type === "BinaryExpression" && right.type === "BinaryExpression" && isRangeTestOperator(left.operator) && isRangeTestOperator(right.operator) && (isBetweenTest() || isOutsideTest()) && isParenWrapped(); } var OPERATOR_FLIP_MAP = { "===": "===", "!==": "!==", "==": "==", "!=": "!=", "<": ">", ">": "<", "<=": ">=", ">=": "<=" }; /** * Returns a string representation of a BinaryExpression node with its sides/operator flipped around. * @param {ASTNode} node The BinaryExpression node * @returns {string} A string representation of the node with the sides and operator flipped */ function getFlippedString(node) { var operatorToken = sourceCode.getFirstTokenBetween(node.left, node.right, function (token) { return token.value === node.operator; }); var textBeforeOperator = sourceCode.getText().slice(sourceCode.getTokenBefore(operatorToken).range[1], operatorToken.range[0]); var textAfterOperator = sourceCode.getText().slice(operatorToken.range[1], sourceCode.getTokenAfter(operatorToken).range[0]); var leftText = sourceCode.getText().slice(node.range[0], sourceCode.getTokenBefore(operatorToken).range[1]); var rightText = sourceCode.getText().slice(sourceCode.getTokenAfter(operatorToken).range[0], node.range[1]); return rightText + textBeforeOperator + OPERATOR_FLIP_MAP[operatorToken.value] + textAfterOperator + leftText; } //-------------------------------------------------------------------------- // Public //-------------------------------------------------------------------------- return { BinaryExpression: function BinaryExpression(node) { var expectedLiteral = always ? node.left : node.right; var expectedNonLiteral = always ? node.right : node.left; // If `expectedLiteral` is not a literal, and `expectedNonLiteral` is a literal, raise an error. if ((expectedNonLiteral.type === "Literal" || looksLikeLiteral(expectedNonLiteral)) && !(expectedLiteral.type === "Literal" || looksLikeLiteral(expectedLiteral)) && !(!isEqualityOperator(node.operator) && onlyEquality) && isComparisonOperator(node.operator) && !(exceptRange && isRangeTest(context.getAncestors().pop()))) { context.report({ node: node, message: "Expected literal to be on the {{expectedSide}} side of {{operator}}.", data: { operator: node.operator, expectedSide: always ? "left" : "right" }, fix: function fix(fixer) { return fixer.replaceText(node, getFlippedString(node)); } }); } } }; } }; },{"../ast-utils":67}],334:[function(require,module,exports){ (function (process){ /** * @fileoverview Tracks performance of individual rules. * @author Brandon Mills */ "use strict"; //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /* istanbul ignore next */ /** * Align the string to left * @param {string} str string to evaluate * @param {int} len length of the string * @param {string} ch delimiter character * @returns {string} modified string * @private */ function alignLeft(str, len, ch) { return str + new Array(len - str.length + 1).join(ch || " "); } /* istanbul ignore next */ /** * Align the string to right * @param {string} str string to evaluate * @param {int} len length of the string * @param {string} ch delimiter character * @returns {string} modified string * @private */ function alignRight(str, len, ch) { return new Array(len - str.length + 1).join(ch || " ") + str; } //------------------------------------------------------------------------------ // Module definition //------------------------------------------------------------------------------ var enabled = !!process.env.TIMING; var HEADERS = ["Rule", "Time (ms)", "Relative"]; var ALIGN = [alignLeft, alignRight, alignRight]; /* istanbul ignore next */ /** * display the data * @param {Object} data Data object to be displayed * @returns {string} modified string * @private */ function display(data) { var total = 0; var rows = Object.keys(data).map(function (key) { var time = data[key]; total += time; return [key, time]; }).sort(function (a, b) { return b[1] - a[1]; }).slice(0, 10); rows.forEach(function (row) { row.push((row[1] * 100 / total).toFixed(1) + "%"); row[1] = row[1].toFixed(3); }); rows.unshift(HEADERS); var widths = []; rows.forEach(function (row) { var len = row.length; for (var i = 0; i < len; i++) { var n = row[i].length; if (!widths[i] || n > widths[i]) { widths[i] = n; } } }); var table = rows.map(function (row) { return row.map(function (cell, index) { return ALIGN[index](cell, widths[index]); }).join(" | "); }); table.splice(1, 0, widths.map(function (w, index) { if (index !== 0 && index !== widths.length - 1) { w++; } return ALIGN[index](":", w + 1, "-"); }).join("|")); console.log(table.join("\n")); // eslint-disable-line no-console } /* istanbul ignore next */ module.exports = function () { var data = Object.create(null); /** * Time the run * @param {*} key key from the data object * @param {Function} fn function to be called * @returns {Function} function to be executed * @private */ function time(key, fn) { if (typeof data[key] === "undefined") { data[key] = 0; } return function () { var t = process.hrtime(); fn.apply(null, Array.prototype.slice.call(arguments)); t = process.hrtime(t); data[key] += t[0] * 1e3 + t[1] / 1e6; }; } if (enabled) { process.on("exit", function () { display(data); }); } return { time: time, enabled: enabled }; }(); }).call(this,require('_process')) },{"_process":58}],335:[function(require,module,exports){ /** * @fileoverview Define the cursor which iterates tokens and comments in reverse. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } function _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return call && (typeof call === "object" || typeof call === "function") ? call : self; } function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function, not " + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; } var Cursor = require("./cursor"); var utils = require("./utils"); //------------------------------------------------------------------------------ // Exports //------------------------------------------------------------------------------ /** * The cursor which iterates tokens and comments in reverse. */ module.exports = function (_Cursor) { _inherits(BackwardTokenCommentCursor, _Cursor); /** * Initializes this cursor. * @param {Token[]} tokens - The array of tokens. * @param {Comment[]} comments - The array of comments. * @param {Object} indexMap - The map from locations to indices in `tokens`. * @param {number} startLoc - The start location of the iteration range. * @param {number} endLoc - The end location of the iteration range. */ function BackwardTokenCommentCursor(tokens, comments, indexMap, startLoc, endLoc) { _classCallCheck(this, BackwardTokenCommentCursor); var _this = _possibleConstructorReturn(this, (BackwardTokenCommentCursor.__proto__ || Object.getPrototypeOf(BackwardTokenCommentCursor)).call(this)); _this.tokens = tokens; _this.comments = comments; _this.tokenIndex = utils.getLastIndex(tokens, indexMap, endLoc); _this.commentIndex = utils.search(comments, endLoc) - 1; _this.border = startLoc; return _this; } /** @inheritdoc */ _createClass(BackwardTokenCommentCursor, [{ key: "moveNext", value: function moveNext() { var token = this.tokenIndex >= 0 ? this.tokens[this.tokenIndex] : null; var comment = this.commentIndex >= 0 ? this.comments[this.commentIndex] : null; if (token && (!comment || token.range[1] > comment.range[1])) { this.current = token; this.tokenIndex -= 1; } else if (comment) { this.current = comment; this.commentIndex -= 1; } else { this.current = null; } return Boolean(this.current) && (this.border === -1 || this.current.range[0] >= this.border); } }]); return BackwardTokenCommentCursor; }(Cursor); },{"./cursor":337,"./utils":347}],336:[function(require,module,exports){ /** * @fileoverview Define the cursor which iterates tokens only in reverse. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } function _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return call && (typeof call === "object" || typeof call === "function") ? call : self; } function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function, not " + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; } var Cursor = require("./cursor"); var utils = require("./utils"); //------------------------------------------------------------------------------ // Exports //------------------------------------------------------------------------------ /** * The cursor which iterates tokens only in reverse. */ module.exports = function (_Cursor) { _inherits(BackwardTokenCursor, _Cursor); /** * Initializes this cursor. * @param {Token[]} tokens - The array of tokens. * @param {Comment[]} comments - The array of comments. * @param {Object} indexMap - The map from locations to indices in `tokens`. * @param {number} startLoc - The start location of the iteration range. * @param {number} endLoc - The end location of the iteration range. */ function BackwardTokenCursor(tokens, comments, indexMap, startLoc, endLoc) { _classCallCheck(this, BackwardTokenCursor); var _this = _possibleConstructorReturn(this, (BackwardTokenCursor.__proto__ || Object.getPrototypeOf(BackwardTokenCursor)).call(this)); _this.tokens = tokens; _this.index = utils.getLastIndex(tokens, indexMap, endLoc); _this.indexEnd = utils.getFirstIndex(tokens, indexMap, startLoc); return _this; } /** @inheritdoc */ _createClass(BackwardTokenCursor, [{ key: "moveNext", value: function moveNext() { if (this.index >= this.indexEnd) { this.current = this.tokens[this.index]; this.index -= 1; return true; } return false; } // // Shorthand for performance. // /** @inheritdoc */ }, { key: "getOneToken", value: function getOneToken() { return this.index >= this.indexEnd ? this.tokens[this.index] : null; } }]); return BackwardTokenCursor; }(Cursor); },{"./cursor":337,"./utils":347}],337:[function(require,module,exports){ /** * @fileoverview Define the abstract class about cursors which iterate tokens. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Exports //------------------------------------------------------------------------------ /** * The abstract class about cursors which iterate tokens. * * This class has 2 abstract methods. * * - `current: Token | Comment | null` ... The current token. * - `moveNext(): boolean` ... Moves this cursor to the next token. If the next token didn't exist, it returns `false`. * * This is similar to ES2015 Iterators. * However, Iterators were slow (at 2017-01), so I created this class as similar to C# IEnumerable. * * There are the following known sub classes. * * - ForwardTokenCursor .......... The cursor which iterates tokens only. * - BackwardTokenCursor ......... The cursor which iterates tokens only in reverse. * - ForwardTokenCommentCursor ... The cursor which iterates tokens and comments. * - BackwardTokenCommentCursor .. The cursor which iterates tokens and comments in reverse. * - DecorativeCursor * - FilterCursor ............ The cursor which ignores the specified tokens. * - SkipCursor .............. The cursor which ignores the first few tokens. * - LimitCursor ............. The cursor which limits the count of tokens. * */ var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } module.exports = function () { /** * Initializes this cursor. */ function Cursor() { _classCallCheck(this, Cursor); this.current = null; } /** * Gets the first token. * This consumes this cursor. * @returns {Token|Comment} The first token or null. */ _createClass(Cursor, [{ key: "getOneToken", value: function getOneToken() { return this.moveNext() ? this.current : null; } /** * Gets the first tokens. * This consumes this cursor. * @returns {(Token|Comment)[]} All tokens. */ }, { key: "getAllTokens", value: function getAllTokens() { var tokens = []; while (this.moveNext()) { tokens.push(this.current); } return tokens; } /** * Moves this cursor to the next token. * @returns {boolean} `true` if the next token exists. * @abstract */ /* istanbul ignore next */ }, { key: "moveNext", value: function moveNext() { // eslint-disable-line class-methods-use-this throw new Error("Not implemented."); } }]); return Cursor; }(); },{}],338:[function(require,module,exports){ /** * @fileoverview Define 2 token factories; forward and backward. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } var BackwardTokenCommentCursor = require("./backward-token-comment-cursor"); var BackwardTokenCursor = require("./backward-token-cursor"); var FilterCursor = require("./filter-cursor"); var ForwardTokenCommentCursor = require("./forward-token-comment-cursor"); var ForwardTokenCursor = require("./forward-token-cursor"); var LimitCursor = require("./limit-cursor"); var SkipCursor = require("./skip-cursor"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * The cursor factory. * @private */ var CursorFactory = function () { /** * Initializes this cursor. * @param {Function} TokenCursor - The class of the cursor which iterates tokens only. * @param {Function} TokenCommentCursor - The class of the cursor which iterates the mix of tokens and comments. */ function CursorFactory(TokenCursor, TokenCommentCursor) { _classCallCheck(this, CursorFactory); this.TokenCursor = TokenCursor; this.TokenCommentCursor = TokenCommentCursor; } /** * Creates a base cursor instance that can be decorated by createCursor. * * @param {Token[]} tokens - The array of tokens. * @param {Comment[]} comments - The array of comments. * @param {Object} indexMap - The map from locations to indices in `tokens`. * @param {number} startLoc - The start location of the iteration range. * @param {number} endLoc - The end location of the iteration range. * @param {boolean} includeComments - The flag to iterate comments as well. * @returns {Cursor} The created base cursor. */ _createClass(CursorFactory, [{ key: "createBaseCursor", value: function createBaseCursor(tokens, comments, indexMap, startLoc, endLoc, includeComments) { var Cursor = includeComments ? this.TokenCommentCursor : this.TokenCursor; return new Cursor(tokens, comments, indexMap, startLoc, endLoc); } /** * Creates a cursor that iterates tokens with normalized options. * * @param {Token[]} tokens - The array of tokens. * @param {Comment[]} comments - The array of comments. * @param {Object} indexMap - The map from locations to indices in `tokens`. * @param {number} startLoc - The start location of the iteration range. * @param {number} endLoc - The end location of the iteration range. * @param {boolean} includeComments - The flag to iterate comments as well. * @param {Function|null} filter - The predicate function to choose tokens. * @param {number} skip - The count of tokens the cursor skips. * @param {number} count - The maximum count of tokens the cursor iterates. Zero is no iteration for backward compatibility. * @returns {Cursor} The created cursor. */ }, { key: "createCursor", value: function createCursor(tokens, comments, indexMap, startLoc, endLoc, includeComments, filter, skip, count) { var cursor = this.createBaseCursor(tokens, comments, indexMap, startLoc, endLoc, includeComments); if (filter) { cursor = new FilterCursor(cursor, filter); } if (skip >= 1) { cursor = new SkipCursor(cursor, skip); } if (count >= 0) { cursor = new LimitCursor(cursor, count); } return cursor; } }]); return CursorFactory; }(); //------------------------------------------------------------------------------ // Exports //------------------------------------------------------------------------------ exports.forward = new CursorFactory(ForwardTokenCursor, ForwardTokenCommentCursor); exports.backward = new CursorFactory(BackwardTokenCursor, BackwardTokenCommentCursor); },{"./backward-token-comment-cursor":335,"./backward-token-cursor":336,"./filter-cursor":340,"./forward-token-comment-cursor":341,"./forward-token-cursor":342,"./limit-cursor":344,"./skip-cursor":346}],339:[function(require,module,exports){ /** * @fileoverview Define the abstract class about cursors which manipulate another cursor. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } function _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return call && (typeof call === "object" || typeof call === "function") ? call : self; } function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function, not " + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; } var Cursor = require("./cursor"); //------------------------------------------------------------------------------ // Exports //------------------------------------------------------------------------------ /** * The abstract class about cursors which manipulate another cursor. */ module.exports = function (_Cursor) { _inherits(DecorativeCursor, _Cursor); /** * Initializes this cursor. * @param {Cursor} cursor - The cursor to be decorated. */ function DecorativeCursor(cursor) { _classCallCheck(this, DecorativeCursor); var _this = _possibleConstructorReturn(this, (DecorativeCursor.__proto__ || Object.getPrototypeOf(DecorativeCursor)).call(this)); _this.cursor = cursor; return _this; } /** @inheritdoc */ _createClass(DecorativeCursor, [{ key: "moveNext", value: function moveNext() { var retv = this.cursor.moveNext(); this.current = this.cursor.current; return retv; } }]); return DecorativeCursor; }(Cursor); },{"./cursor":337}],340:[function(require,module,exports){ /** * @fileoverview Define the cursor which ignores specified tokens. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); var _get = function get(object, property, receiver) { if (object === null) object = Function.prototype; var desc = Object.getOwnPropertyDescriptor(object, property); if (desc === undefined) { var parent = Object.getPrototypeOf(object); if (parent === null) { return undefined; } else { return get(parent, property, receiver); } } else if ("value" in desc) { return desc.value; } else { var getter = desc.get; if (getter === undefined) { return undefined; } return getter.call(receiver); } }; function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } function _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return call && (typeof call === "object" || typeof call === "function") ? call : self; } function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function, not " + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; } var DecorativeCursor = require("./decorative-cursor"); //------------------------------------------------------------------------------ // Exports //------------------------------------------------------------------------------ /** * The decorative cursor which ignores specified tokens. */ module.exports = function (_DecorativeCursor) { _inherits(FilterCursor, _DecorativeCursor); /** * Initializes this cursor. * @param {Cursor} cursor - The cursor to be decorated. * @param {Function} predicate - The predicate function to decide tokens this cursor iterates. */ function FilterCursor(cursor, predicate) { _classCallCheck(this, FilterCursor); var _this = _possibleConstructorReturn(this, (FilterCursor.__proto__ || Object.getPrototypeOf(FilterCursor)).call(this, cursor)); _this.predicate = predicate; return _this; } /** @inheritdoc */ _createClass(FilterCursor, [{ key: "moveNext", value: function moveNext() { var predicate = this.predicate; while (_get(FilterCursor.prototype.__proto__ || Object.getPrototypeOf(FilterCursor.prototype), "moveNext", this).call(this)) { if (predicate(this.current)) { return true; } } return false; } }]); return FilterCursor; }(DecorativeCursor); },{"./decorative-cursor":339}],341:[function(require,module,exports){ /** * @fileoverview Define the cursor which iterates tokens and comments. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } function _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return call && (typeof call === "object" || typeof call === "function") ? call : self; } function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function, not " + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; } var Cursor = require("./cursor"); var utils = require("./utils"); //------------------------------------------------------------------------------ // Exports //------------------------------------------------------------------------------ /** * The cursor which iterates tokens and comments. */ module.exports = function (_Cursor) { _inherits(ForwardTokenCommentCursor, _Cursor); /** * Initializes this cursor. * @param {Token[]} tokens - The array of tokens. * @param {Comment[]} comments - The array of comments. * @param {Object} indexMap - The map from locations to indices in `tokens`. * @param {number} startLoc - The start location of the iteration range. * @param {number} endLoc - The end location of the iteration range. */ function ForwardTokenCommentCursor(tokens, comments, indexMap, startLoc, endLoc) { _classCallCheck(this, ForwardTokenCommentCursor); var _this = _possibleConstructorReturn(this, (ForwardTokenCommentCursor.__proto__ || Object.getPrototypeOf(ForwardTokenCommentCursor)).call(this)); _this.tokens = tokens; _this.comments = comments; _this.tokenIndex = utils.getFirstIndex(tokens, indexMap, startLoc); _this.commentIndex = utils.search(comments, startLoc); _this.border = endLoc; return _this; } /** @inheritdoc */ _createClass(ForwardTokenCommentCursor, [{ key: "moveNext", value: function moveNext() { var token = this.tokenIndex < this.tokens.length ? this.tokens[this.tokenIndex] : null; var comment = this.commentIndex < this.comments.length ? this.comments[this.commentIndex] : null; if (token && (!comment || token.range[0] < comment.range[0])) { this.current = token; this.tokenIndex += 1; } else if (comment) { this.current = comment; this.commentIndex += 1; } else { this.current = null; } return Boolean(this.current) && (this.border === -1 || this.current.range[1] <= this.border); } }]); return ForwardTokenCommentCursor; }(Cursor); },{"./cursor":337,"./utils":347}],342:[function(require,module,exports){ /** * @fileoverview Define the cursor which iterates tokens only. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } function _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return call && (typeof call === "object" || typeof call === "function") ? call : self; } function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function, not " + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; } var Cursor = require("./cursor"); var utils = require("./utils"); //------------------------------------------------------------------------------ // Exports //------------------------------------------------------------------------------ /** * The cursor which iterates tokens only. */ module.exports = function (_Cursor) { _inherits(ForwardTokenCursor, _Cursor); /** * Initializes this cursor. * @param {Token[]} tokens - The array of tokens. * @param {Comment[]} comments - The array of comments. * @param {Object} indexMap - The map from locations to indices in `tokens`. * @param {number} startLoc - The start location of the iteration range. * @param {number} endLoc - The end location of the iteration range. */ function ForwardTokenCursor(tokens, comments, indexMap, startLoc, endLoc) { _classCallCheck(this, ForwardTokenCursor); var _this = _possibleConstructorReturn(this, (ForwardTokenCursor.__proto__ || Object.getPrototypeOf(ForwardTokenCursor)).call(this)); _this.tokens = tokens; _this.index = utils.getFirstIndex(tokens, indexMap, startLoc); _this.indexEnd = utils.getLastIndex(tokens, indexMap, endLoc); return _this; } /** @inheritdoc */ _createClass(ForwardTokenCursor, [{ key: "moveNext", value: function moveNext() { if (this.index <= this.indexEnd) { this.current = this.tokens[this.index]; this.index += 1; return true; } return false; } // // Shorthand for performance. // /** @inheritdoc */ }, { key: "getOneToken", value: function getOneToken() { return this.index <= this.indexEnd ? this.tokens[this.index] : null; } /** @inheritdoc */ }, { key: "getAllTokens", value: function getAllTokens() { return this.tokens.slice(this.index, this.indexEnd + 1); } }]); return ForwardTokenCursor; }(Cursor); },{"./cursor":337,"./utils":347}],343:[function(require,module,exports){ /** * @fileoverview Object to handle access and retrieval of tokens. * @author Brandon Mills */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } var assert = require("assert"); var cursors = require("./cursors"); var ForwardTokenCursor = require("./forward-token-cursor"); var PaddedTokenCursor = require("./padded-token-cursor"); var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var TOKENS = Symbol("tokens"); var COMMENTS = Symbol("comments"); var INDEX_MAP = Symbol("indexMap"); /** * Creates the map from locations to indices in `tokens`. * * The first/last location of tokens is mapped to the index of the token. * The first/last location of comments is mapped to the index of the next token of each comment. * * @param {Token[]} tokens - The array of tokens. * @param {Comment[]} comments - The array of comments. * @returns {Object} The map from locations to indices in `tokens`. * @private */ function createIndexMap(tokens, comments) { var map = Object.create(null); var tokenIndex = 0; var commentIndex = 0; var nextStart = 0; var range = null; while (tokenIndex < tokens.length || commentIndex < comments.length) { nextStart = commentIndex < comments.length ? comments[commentIndex].range[0] : Number.MAX_SAFE_INTEGER; while (tokenIndex < tokens.length && (range = tokens[tokenIndex].range)[0] < nextStart) { map[range[0]] = tokenIndex; map[range[1] - 1] = tokenIndex; tokenIndex += 1; } nextStart = tokenIndex < tokens.length ? tokens[tokenIndex].range[0] : Number.MAX_SAFE_INTEGER; while (commentIndex < comments.length && (range = comments[commentIndex].range)[0] < nextStart) { map[range[0]] = tokenIndex; map[range[1] - 1] = tokenIndex; commentIndex += 1; } } return map; } /** * Creates the cursor iterates tokens with options. * * @param {CursorFactory} factory - The cursor factory to initialize cursor. * @param {Token[]} tokens - The array of tokens. * @param {Comment[]} comments - The array of comments. * @param {Object} indexMap - The map from locations to indices in `tokens`. * @param {number} startLoc - The start location of the iteration range. * @param {number} endLoc - The end location of the iteration range. * @param {number|Function|Object} [opts=0] - The option object. If this is a number then it's `opts.skip`. If this is a function then it's `opts.filter`. * @param {boolean} [opts.includeComments=false] - The flag to iterate comments as well. * @param {Function|null} [opts.filter=null] - The predicate function to choose tokens. * @param {number} [opts.skip=0] - The count of tokens the cursor skips. * @returns {Cursor} The created cursor. * @private */ function createCursorWithSkip(factory, tokens, comments, indexMap, startLoc, endLoc, opts) { var includeComments = false; var skip = 0; var filter = null; if (typeof opts === "number") { skip = opts | 0; } else if (typeof opts === "function") { filter = opts; } else if (opts) { includeComments = !!opts.includeComments; skip = opts.skip | 0; filter = opts.filter || null; } assert(skip >= 0, "options.skip should be zero or a positive integer."); assert(!filter || typeof filter === "function", "options.filter should be a function."); return factory.createCursor(tokens, comments, indexMap, startLoc, endLoc, includeComments, filter, skip, -1); } /** * Creates the cursor iterates tokens with options. * * @param {CursorFactory} factory - The cursor factory to initialize cursor. * @param {Token[]} tokens - The array of tokens. * @param {Comment[]} comments - The array of comments. * @param {Object} indexMap - The map from locations to indices in `tokens`. * @param {number} startLoc - The start location of the iteration range. * @param {number} endLoc - The end location of the iteration range. * @param {number|Function|Object} [opts=0] - The option object. If this is a number then it's `opts.count`. If this is a function then it's `opts.filter`. * @param {boolean} [opts.includeComments] - The flag to iterate comments as well. * @param {Function|null} [opts.filter=null] - The predicate function to choose tokens. * @param {number} [opts.count=0] - The maximum count of tokens the cursor iterates. Zero is no iteration for backward compatibility. * @returns {Cursor} The created cursor. * @private */ function createCursorWithCount(factory, tokens, comments, indexMap, startLoc, endLoc, opts) { var includeComments = false; var count = 0; var countExists = false; var filter = null; if (typeof opts === "number") { count = opts | 0; countExists = true; } else if (typeof opts === "function") { filter = opts; } else if (opts) { includeComments = !!opts.includeComments; count = opts.count | 0; countExists = typeof opts.count === "number"; filter = opts.filter || null; } assert(count >= 0, "options.count should be zero or a positive integer."); assert(!filter || typeof filter === "function", "options.filter should be a function."); return factory.createCursor(tokens, comments, indexMap, startLoc, endLoc, includeComments, filter, 0, countExists ? count : -1); } /** * Creates the cursor iterates tokens with options. * This is overload function of the below. * * @param {Token[]} tokens - The array of tokens. * @param {Comment[]} comments - The array of comments. * @param {Object} indexMap - The map from locations to indices in `tokens`. * @param {number} startLoc - The start location of the iteration range. * @param {number} endLoc - The end location of the iteration range. * @param {Function|Object} opts - The option object. If this is a function then it's `opts.filter`. * @param {boolean} [opts.includeComments] - The flag to iterate comments as well. * @param {Function|null} [opts.filter=null] - The predicate function to choose tokens. * @param {number} [opts.count=0] - The maximum count of tokens the cursor iterates. Zero is no iteration for backward compatibility. * @returns {Cursor} The created cursor. * @private */ /** * Creates the cursor iterates tokens with options. * * @param {Token[]} tokens - The array of tokens. * @param {Comment[]} comments - The array of comments. * @param {Object} indexMap - The map from locations to indices in `tokens`. * @param {number} startLoc - The start location of the iteration range. * @param {number} endLoc - The end location of the iteration range. * @param {number} [beforeCount=0] - The number of tokens before the node to retrieve. * @param {boolean} [afterCount=0] - The number of tokens after the node to retrieve. * @returns {Cursor} The created cursor. * @private */ function createCursorWithPadding(tokens, comments, indexMap, startLoc, endLoc, beforeCount, afterCount) { if (typeof beforeCount === "undefined" && typeof afterCount === "undefined") { return new ForwardTokenCursor(tokens, comments, indexMap, startLoc, endLoc); } if (typeof beforeCount === "number" || typeof beforeCount === "undefined") { return new PaddedTokenCursor(tokens, comments, indexMap, startLoc, endLoc, beforeCount | 0, afterCount | 0); } return createCursorWithCount(cursors.forward, tokens, comments, indexMap, startLoc, endLoc, beforeCount); } /** * Gets comment tokens that are adjacent to the current cursor position. * @param {Cursor} cursor - A cursor instance. * @returns {Array} An array of comment tokens adjacent to the current cursor position. * @private */ function getAdjacentCommentTokensFromCursor(cursor) { var tokens = []; var currentToken = cursor.getOneToken(); while (currentToken && astUtils.isCommentToken(currentToken)) { tokens.push(currentToken); currentToken = cursor.getOneToken(); } return tokens; } //------------------------------------------------------------------------------ // Exports //------------------------------------------------------------------------------ /** * The token store. * * This class provides methods to get tokens by locations as fast as possible. * The methods are a part of public API, so we should be careful if it changes this class. * * People can get tokens in O(1) by the hash map which is mapping from the location of tokens/comments to tokens. * Also people can get a mix of tokens and comments in O(log k), the k is the number of comments. * Assuming that comments to be much fewer than tokens, this does not make hash map from token's locations to comments to reduce memory cost. * This uses binary-searching instead for comments. */ module.exports = function () { /** * Initializes this token store. * @param {Token[]} tokens - The array of tokens. * @param {Comment[]} comments - The array of comments. */ function TokenStore(tokens, comments) { _classCallCheck(this, TokenStore); this[TOKENS] = tokens; this[COMMENTS] = comments; this[INDEX_MAP] = createIndexMap(tokens, comments); } //-------------------------------------------------------------------------- // Gets single token. //-------------------------------------------------------------------------- /** * Gets the token starting at the specified index. * @param {number} offset - Index of the start of the token's range. * @param {Object} [options=0] - The option object. * @param {boolean} [options.includeComments=false] - The flag to iterate comments as well. * @returns {Token|null} The token starting at index, or null if no such token. */ _createClass(TokenStore, [{ key: "getTokenByRangeStart", value: function getTokenByRangeStart(offset, options) { var includeComments = options && options.includeComments; var token = cursors.forward.createBaseCursor(this[TOKENS], this[COMMENTS], this[INDEX_MAP], offset, -1, includeComments).getOneToken(); if (token && token.range[0] === offset) { return token; } return null; } /** * Gets the first token of the given node. * @param {ASTNode} node - The AST node. * @param {number|Function|Object} [options=0] - The option object. If this is a number then it's `options.skip`. If this is a function then it's `options.filter`. * @param {boolean} [options.includeComments=false] - The flag to iterate comments as well. * @param {Function|null} [options.filter=null] - The predicate function to choose tokens. * @param {number} [options.skip=0] - The count of tokens the cursor skips. * @returns {Token|null} An object representing the token. */ }, { key: "getFirstToken", value: function getFirstToken(node, options) { return createCursorWithSkip(cursors.forward, this[TOKENS], this[COMMENTS], this[INDEX_MAP], node.range[0], node.range[1], options).getOneToken(); } /** * Gets the last token of the given node. * @param {ASTNode} node - The AST node. * @param {number|Function|Object} [options=0] - The option object. Same options as getFirstToken() * @returns {Token|null} An object representing the token. */ }, { key: "getLastToken", value: function getLastToken(node, options) { return createCursorWithSkip(cursors.backward, this[TOKENS], this[COMMENTS], this[INDEX_MAP], node.range[0], node.range[1], options).getOneToken(); } /** * Gets the token that precedes a given node or token. * @param {ASTNode|Token|Comment} node - The AST node or token. * @param {number|Function|Object} [options=0] - The option object. Same options as getFirstToken() * @returns {Token|null} An object representing the token. */ }, { key: "getTokenBefore", value: function getTokenBefore(node, options) { return createCursorWithSkip(cursors.backward, this[TOKENS], this[COMMENTS], this[INDEX_MAP], -1, node.range[0], options).getOneToken(); } /** * Gets the token that follows a given node or token. * @param {ASTNode|Token|Comment} node - The AST node or token. * @param {number|Function|Object} [options=0] - The option object. Same options as getFirstToken() * @returns {Token|null} An object representing the token. */ }, { key: "getTokenAfter", value: function getTokenAfter(node, options) { return createCursorWithSkip(cursors.forward, this[TOKENS], this[COMMENTS], this[INDEX_MAP], node.range[1], -1, options).getOneToken(); } /** * Gets the first token between two non-overlapping nodes. * @param {ASTNode|Token|Comment} left - Node before the desired token range. * @param {ASTNode|Token|Comment} right - Node after the desired token range. * @param {number|Function|Object} [options=0] - The option object. Same options as getFirstToken() * @returns {Token|null} An object representing the token. */ }, { key: "getFirstTokenBetween", value: function getFirstTokenBetween(left, right, options) { return createCursorWithSkip(cursors.forward, this[TOKENS], this[COMMENTS], this[INDEX_MAP], left.range[1], right.range[0], options).getOneToken(); } /** * Gets the last token between two non-overlapping nodes. * @param {ASTNode|Token|Comment} left Node before the desired token range. * @param {ASTNode|Token|Comment} right Node after the desired token range. * @param {number|Function|Object} [options=0] - The option object. Same options as getFirstToken() * @returns {Token|null} An object representing the token. */ }, { key: "getLastTokenBetween", value: function getLastTokenBetween(left, right, options) { return createCursorWithSkip(cursors.backward, this[TOKENS], this[COMMENTS], this[INDEX_MAP], left.range[1], right.range[0], options).getOneToken(); } /** * Gets the token that precedes a given node or token in the token stream. * This is defined for backward compatibility. Use `includeComments` option instead. * TODO: We have a plan to remove this in a future major version. * @param {ASTNode|Token|Comment} node The AST node or token. * @param {number} [skip=0] A number of tokens to skip. * @returns {Token|null} An object representing the token. * @deprecated */ }, { key: "getTokenOrCommentBefore", value: function getTokenOrCommentBefore(node, skip) { return this.getTokenBefore(node, { includeComments: true, skip: skip }); } /** * Gets the token that follows a given node or token in the token stream. * This is defined for backward compatibility. Use `includeComments` option instead. * TODO: We have a plan to remove this in a future major version. * @param {ASTNode|Token|Comment} node The AST node or token. * @param {number} [skip=0] A number of tokens to skip. * @returns {Token|null} An object representing the token. * @deprecated */ }, { key: "getTokenOrCommentAfter", value: function getTokenOrCommentAfter(node, skip) { return this.getTokenAfter(node, { includeComments: true, skip: skip }); } //-------------------------------------------------------------------------- // Gets multiple tokens. //-------------------------------------------------------------------------- /** * Gets the first `count` tokens of the given node. * @param {ASTNode} node - The AST node. * @param {number|Function|Object} [options=0] - The option object. If this is a number then it's `options.count`. If this is a function then it's `options.filter`. * @param {boolean} [options.includeComments=false] - The flag to iterate comments as well. * @param {Function|null} [options.filter=null] - The predicate function to choose tokens. * @param {number} [options.count=0] - The maximum count of tokens the cursor iterates. * @returns {Token[]} Tokens. */ }, { key: "getFirstTokens", value: function getFirstTokens(node, options) { return createCursorWithCount(cursors.forward, this[TOKENS], this[COMMENTS], this[INDEX_MAP], node.range[0], node.range[1], options).getAllTokens(); } /** * Gets the last `count` tokens of the given node. * @param {ASTNode} node - The AST node. * @param {number|Function|Object} [options=0] - The option object. Same options as getFirstTokens() * @returns {Token[]} Tokens. */ }, { key: "getLastTokens", value: function getLastTokens(node, options) { return createCursorWithCount(cursors.backward, this[TOKENS], this[COMMENTS], this[INDEX_MAP], node.range[0], node.range[1], options).getAllTokens().reverse(); } /** * Gets the `count` tokens that precedes a given node or token. * @param {ASTNode|Token|Comment} node - The AST node or token. * @param {number|Function|Object} [options=0] - The option object. Same options as getFirstTokens() * @returns {Token[]} Tokens. */ }, { key: "getTokensBefore", value: function getTokensBefore(node, options) { return createCursorWithCount(cursors.backward, this[TOKENS], this[COMMENTS], this[INDEX_MAP], -1, node.range[0], options).getAllTokens().reverse(); } /** * Gets the `count` tokens that follows a given node or token. * @param {ASTNode|Token|Comment} node - The AST node or token. * @param {number|Function|Object} [options=0] - The option object. Same options as getFirstTokens() * @returns {Token[]} Tokens. */ }, { key: "getTokensAfter", value: function getTokensAfter(node, options) { return createCursorWithCount(cursors.forward, this[TOKENS], this[COMMENTS], this[INDEX_MAP], node.range[1], -1, options).getAllTokens(); } /** * Gets the first `count` tokens between two non-overlapping nodes. * @param {ASTNode|Token|Comment} left - Node before the desired token range. * @param {ASTNode|Token|Comment} right - Node after the desired token range. * @param {number|Function|Object} [options=0] - The option object. Same options as getFirstTokens() * @returns {Token[]} Tokens between left and right. */ }, { key: "getFirstTokensBetween", value: function getFirstTokensBetween(left, right, options) { return createCursorWithCount(cursors.forward, this[TOKENS], this[COMMENTS], this[INDEX_MAP], left.range[1], right.range[0], options).getAllTokens(); } /** * Gets the last `count` tokens between two non-overlapping nodes. * @param {ASTNode|Token|Comment} left Node before the desired token range. * @param {ASTNode|Token|Comment} right Node after the desired token range. * @param {number|Function|Object} [options=0] - The option object. Same options as getFirstTokens() * @returns {Token[]} Tokens between left and right. */ }, { key: "getLastTokensBetween", value: function getLastTokensBetween(left, right, options) { return createCursorWithCount(cursors.backward, this[TOKENS], this[COMMENTS], this[INDEX_MAP], left.range[1], right.range[0], options).getAllTokens().reverse(); } /** * Gets all tokens that are related to the given node. * @param {ASTNode} node - The AST node. * @param {Function|Object} options The option object. If this is a function then it's `options.filter`. * @param {boolean} [options.includeComments=false] - The flag to iterate comments as well. * @param {Function|null} [options.filter=null] - The predicate function to choose tokens. * @param {number} [options.count=0] - The maximum count of tokens the cursor iterates. * @returns {Token[]} Array of objects representing tokens. */ /** * Gets all tokens that are related to the given node. * @param {ASTNode} node - The AST node. * @param {int} [beforeCount=0] - The number of tokens before the node to retrieve. * @param {int} [afterCount=0] - The number of tokens after the node to retrieve. * @returns {Token[]} Array of objects representing tokens. */ }, { key: "getTokens", value: function getTokens(node, beforeCount, afterCount) { return createCursorWithPadding(this[TOKENS], this[COMMENTS], this[INDEX_MAP], node.range[0], node.range[1], beforeCount, afterCount).getAllTokens(); } /** * Gets all of the tokens between two non-overlapping nodes. * @param {ASTNode|Token|Comment} left Node before the desired token range. * @param {ASTNode|Token|Comment} right Node after the desired token range. * @param {Function|Object} options The option object. If this is a function then it's `options.filter`. * @param {boolean} [options.includeComments=false] - The flag to iterate comments as well. * @param {Function|null} [options.filter=null] - The predicate function to choose tokens. * @param {number} [options.count=0] - The maximum count of tokens the cursor iterates. * @returns {Token[]} Tokens between left and right. */ /** * Gets all of the tokens between two non-overlapping nodes. * @param {ASTNode|Token|Comment} left Node before the desired token range. * @param {ASTNode|Token|Comment} right Node after the desired token range. * @param {int} [padding=0] Number of extra tokens on either side of center. * @returns {Token[]} Tokens between left and right. */ }, { key: "getTokensBetween", value: function getTokensBetween(left, right, padding) { return createCursorWithPadding(this[TOKENS], this[COMMENTS], this[INDEX_MAP], left.range[1], right.range[0], padding, padding).getAllTokens(); } /** * Gets all comment tokens directly before the given node or token. * @param {ASTNode|token} nodeOrToken The AST node or token to check for adjacent comment tokens. * @returns {Array} An array of comments in occurrence order. */ }, { key: "getCommentsBefore", value: function getCommentsBefore(nodeOrToken) { var cursor = createCursorWithCount(cursors.backward, this[TOKENS], this[COMMENTS], this[INDEX_MAP], -1, nodeOrToken.range[0], { includeComments: true }); return getAdjacentCommentTokensFromCursor(cursor).reverse(); } /** * Gets all comment tokens directly after the given node or token. * @param {ASTNode|token} nodeOrToken The AST node or token to check for adjacent comment tokens. * @returns {Array} An array of comments in occurrence order. */ }, { key: "getCommentsAfter", value: function getCommentsAfter(nodeOrToken) { var cursor = createCursorWithCount(cursors.forward, this[TOKENS], this[COMMENTS], this[INDEX_MAP], nodeOrToken.range[1], -1, { includeComments: true }); return getAdjacentCommentTokensFromCursor(cursor); } /** * Gets all comment tokens inside the given node. * @param {ASTNode} node The AST node to get the comments for. * @returns {Array} An array of comments in occurrence order. */ }, { key: "getCommentsInside", value: function getCommentsInside(node) { return this.getTokens(node, { includeComments: true, filter: astUtils.isCommentToken }); } }]); return TokenStore; }(); },{"../ast-utils":67,"./cursors":338,"./forward-token-cursor":342,"./padded-token-cursor":345,"assert":6}],344:[function(require,module,exports){ /** * @fileoverview Define the cursor which limits the number of tokens. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); var _get = function get(object, property, receiver) { if (object === null) object = Function.prototype; var desc = Object.getOwnPropertyDescriptor(object, property); if (desc === undefined) { var parent = Object.getPrototypeOf(object); if (parent === null) { return undefined; } else { return get(parent, property, receiver); } } else if ("value" in desc) { return desc.value; } else { var getter = desc.get; if (getter === undefined) { return undefined; } return getter.call(receiver); } }; function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } function _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return call && (typeof call === "object" || typeof call === "function") ? call : self; } function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function, not " + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; } var DecorativeCursor = require("./decorative-cursor"); //------------------------------------------------------------------------------ // Exports //------------------------------------------------------------------------------ /** * The decorative cursor which limits the number of tokens. */ module.exports = function (_DecorativeCursor) { _inherits(LimitCursor, _DecorativeCursor); /** * Initializes this cursor. * @param {Cursor} cursor - The cursor to be decorated. * @param {number} count - The count of tokens this cursor iterates. */ function LimitCursor(cursor, count) { _classCallCheck(this, LimitCursor); var _this = _possibleConstructorReturn(this, (LimitCursor.__proto__ || Object.getPrototypeOf(LimitCursor)).call(this, cursor)); _this.count = count; return _this; } /** @inheritdoc */ _createClass(LimitCursor, [{ key: "moveNext", value: function moveNext() { if (this.count > 0) { this.count -= 1; return _get(LimitCursor.prototype.__proto__ || Object.getPrototypeOf(LimitCursor.prototype), "moveNext", this).call(this); } return false; } }]); return LimitCursor; }(DecorativeCursor); },{"./decorative-cursor":339}],345:[function(require,module,exports){ /** * @fileoverview Define the cursor which iterates tokens only, with inflated range. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } function _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return call && (typeof call === "object" || typeof call === "function") ? call : self; } function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function, not " + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; } var ForwardTokenCursor = require("./forward-token-cursor"); //------------------------------------------------------------------------------ // Exports //------------------------------------------------------------------------------ /** * The cursor which iterates tokens only, with inflated range. * This is for the backward compatibility of padding options. */ module.exports = function (_ForwardTokenCursor) { _inherits(PaddedTokenCursor, _ForwardTokenCursor); /** * Initializes this cursor. * @param {Token[]} tokens - The array of tokens. * @param {Comment[]} comments - The array of comments. * @param {Object} indexMap - The map from locations to indices in `tokens`. * @param {number} startLoc - The start location of the iteration range. * @param {number} endLoc - The end location of the iteration range. * @param {number} beforeCount - The number of tokens this cursor iterates before start. * @param {number} afterCount - The number of tokens this cursor iterates after end. */ function PaddedTokenCursor(tokens, comments, indexMap, startLoc, endLoc, beforeCount, afterCount) { _classCallCheck(this, PaddedTokenCursor); var _this = _possibleConstructorReturn(this, (PaddedTokenCursor.__proto__ || Object.getPrototypeOf(PaddedTokenCursor)).call(this, tokens, comments, indexMap, startLoc, endLoc)); _this.index = Math.max(0, _this.index - beforeCount); _this.indexEnd = Math.min(tokens.length - 1, _this.indexEnd + afterCount); return _this; } return PaddedTokenCursor; }(ForwardTokenCursor); },{"./forward-token-cursor":342}],346:[function(require,module,exports){ /** * @fileoverview Define the cursor which ignores the first few tokens. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); var _get = function get(object, property, receiver) { if (object === null) object = Function.prototype; var desc = Object.getOwnPropertyDescriptor(object, property); if (desc === undefined) { var parent = Object.getPrototypeOf(object); if (parent === null) { return undefined; } else { return get(parent, property, receiver); } } else if ("value" in desc) { return desc.value; } else { var getter = desc.get; if (getter === undefined) { return undefined; } return getter.call(receiver); } }; function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } function _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return call && (typeof call === "object" || typeof call === "function") ? call : self; } function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function, not " + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; } var DecorativeCursor = require("./decorative-cursor"); //------------------------------------------------------------------------------ // Exports //------------------------------------------------------------------------------ /** * The decorative cursor which ignores the first few tokens. */ module.exports = function (_DecorativeCursor) { _inherits(SkipCursor, _DecorativeCursor); /** * Initializes this cursor. * @param {Cursor} cursor - The cursor to be decorated. * @param {number} count - The count of tokens this cursor skips. */ function SkipCursor(cursor, count) { _classCallCheck(this, SkipCursor); var _this = _possibleConstructorReturn(this, (SkipCursor.__proto__ || Object.getPrototypeOf(SkipCursor)).call(this, cursor)); _this.count = count; return _this; } /** @inheritdoc */ _createClass(SkipCursor, [{ key: "moveNext", value: function moveNext() { while (this.count > 0) { this.count -= 1; if (!_get(SkipCursor.prototype.__proto__ || Object.getPrototypeOf(SkipCursor.prototype), "moveNext", this).call(this)) { return false; } } return _get(SkipCursor.prototype.__proto__ || Object.getPrototypeOf(SkipCursor.prototype), "moveNext", this).call(this); } }]); return SkipCursor; }(DecorativeCursor); },{"./decorative-cursor":339}],347:[function(require,module,exports){ /** * @fileoverview Define utilify functions for token store. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var lodash = require("lodash"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Gets `token.range[0]` from the given token. * * @param {Node|Token|Comment} token - The token to get. * @returns {number} The start location. * @private */ function getStartLocation(token) { return token.range[0]; } //------------------------------------------------------------------------------ // Exports //------------------------------------------------------------------------------ /** * Binary-searches the index of the first token which is after the given location. * If it was not found, this returns `tokens.length`. * * @param {(Token|Comment)[]} tokens - It searches the token in this list. * @param {number} location - The location to search. * @returns {number} The found index or `tokens.length`. */ exports.search = function search(tokens, location) { return lodash.sortedIndexBy(tokens, { range: [location] }, getStartLocation); }; /** * Gets the index of the `startLoc` in `tokens`. * `startLoc` can be the value of `node.range[1]`, so this checks about `startLoc - 1` as well. * * @param {(Token|Comment)[]} tokens - The tokens to find an index. * @param {Object} indexMap - The map from locations to indices. * @param {number} startLoc - The location to get an index. * @returns {number} The index. */ exports.getFirstIndex = function getFirstIndex(tokens, indexMap, startLoc) { if (startLoc in indexMap) { return indexMap[startLoc]; } if (startLoc - 1 in indexMap) { var index = indexMap[startLoc - 1]; var token = index >= 0 && index < tokens.length ? tokens[index] : null; // For the map of "comment's location -> token's index", it points the next token of a comment. // In that case, +1 is unnecessary. if (token && token.range[0] >= startLoc) { return index; } return index + 1; } return 0; }; /** * Gets the index of the `endLoc` in `tokens`. * The information of end locations are recorded at `endLoc - 1` in `indexMap`, so this checks about `endLoc - 1` as well. * * @param {(Token|Comment)[]} tokens - The tokens to find an index. * @param {Object} indexMap - The map from locations to indices. * @param {number} endLoc - The location to get an index. * @returns {number} The index. */ exports.getLastIndex = function getLastIndex(tokens, indexMap, endLoc) { if (endLoc in indexMap) { return indexMap[endLoc] - 1; } if (endLoc - 1 in indexMap) { var index = indexMap[endLoc - 1]; var token = index >= 0 && index < tokens.length ? tokens[index] : null; // For the map of "comment's location -> token's index", it points the next token of a comment. // In that case, -1 is necessary. if (token && token.range[1] > endLoc) { return index - 1; } return index; } return tokens.length - 1; }; },{"lodash":48}],348:[function(require,module,exports){ /** * @fileoverview Helper class to aid in constructing fix commands. * @author Alan Pierce */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } var astUtils = require("../ast-utils"); //------------------------------------------------------------------------------ // Public Interface //------------------------------------------------------------------------------ /** * A helper class to combine fix options into a fix command. Currently, it * exposes some "retain" methods that extend the range of the text being * replaced so that other fixes won't touch that region in the same pass. */ var FixTracker = function () { /** * Create a new FixTracker. * * @param {ruleFixer} fixer A ruleFixer instance. * @param {SourceCode} sourceCode A SourceCode object for the current code. */ function FixTracker(fixer, sourceCode) { _classCallCheck(this, FixTracker); this.fixer = fixer; this.sourceCode = sourceCode; this.retainedRange = null; } /** * Mark the given range as "retained", meaning that other fixes may not * may not modify this region in the same pass. * * @param {int[]} range The range to retain. * @returns {FixTracker} The same RuleFixer, for chained calls. */ _createClass(FixTracker, [{ key: "retainRange", value: function retainRange(range) { this.retainedRange = range; return this; } /** * Given a node, find the function containing it (or the entire program) and * mark it as retained, meaning that other fixes may not modify it in this * pass. This is useful for avoiding conflicts in fixes that modify control * flow. * * @param {ASTNode} node The node to use as a starting point. * @returns {FixTracker} The same RuleFixer, for chained calls. */ }, { key: "retainEnclosingFunction", value: function retainEnclosingFunction(node) { var functionNode = astUtils.getUpperFunction(node); return this.retainRange(functionNode ? functionNode.range : this.sourceCode.ast.range); } /** * Given a node or token, find the token before and afterward, and mark that * range as retained, meaning that other fixes may not modify it in this * pass. This is useful for avoiding conflicts in fixes that make a small * change to the code where the AST should not be changed. * * @param {ASTNode|Token} nodeOrToken The node or token to use as a starting * point. The token to the left and right are use in the range. * @returns {FixTracker} The same RuleFixer, for chained calls. */ }, { key: "retainSurroundingTokens", value: function retainSurroundingTokens(nodeOrToken) { var tokenBefore = this.sourceCode.getTokenBefore(nodeOrToken) || nodeOrToken; var tokenAfter = this.sourceCode.getTokenAfter(nodeOrToken) || nodeOrToken; return this.retainRange([tokenBefore.range[0], tokenAfter.range[1]]); } /** * Create a fix command that replaces the given range with the given text, * accounting for any retained ranges. * * @param {int[]} range The range to remove in the fix. * @param {string} text The text to insert in place of the range. * @returns {Object} The fix command. */ }, { key: "replaceTextRange", value: function replaceTextRange(range, text) { var actualRange = void 0; if (this.retainedRange) { actualRange = [Math.min(this.retainedRange[0], range[0]), Math.max(this.retainedRange[1], range[1])]; } else { actualRange = range; } return this.fixer.replaceTextRange(actualRange, this.sourceCode.text.slice(actualRange[0], range[0]) + text + this.sourceCode.text.slice(range[1], actualRange[1])); } /** * Create a fix command that removes the given node or token, accounting for * any retained ranges. * * @param {ASTNode|Token} nodeOrToken The node or token to remove. * @returns {Object} The fix command. */ }, { key: "remove", value: function remove(nodeOrToken) { return this.replaceTextRange(nodeOrToken.range, ""); } }]); return FixTracker; }(); module.exports = FixTracker; },{"../ast-utils":67}],349:[function(require,module,exports){ /** * @fileoverview A shared list of ES3 keywords. * @author Josh Perez */ "use strict"; module.exports = ["abstract", "boolean", "break", "byte", "case", "catch", "char", "class", "const", "continue", "debugger", "default", "delete", "do", "double", "else", "enum", "export", "extends", "false", "final", "finally", "float", "for", "function", "goto", "if", "implements", "import", "in", "instanceof", "int", "interface", "long", "native", "new", "null", "package", "private", "protected", "public", "return", "short", "static", "super", "switch", "synchronized", "this", "throw", "throws", "transient", "true", "try", "typeof", "var", "void", "volatile", "while", "with"]; },{}],350:[function(require,module,exports){ /** * @fileoverview The event generator for AST nodes. * @author Toru Nagashima */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } var esquery = require("esquery"); var lodash = require("lodash"); //------------------------------------------------------------------------------ // Typedefs //------------------------------------------------------------------------------ /** * An object describing an AST selector * @typedef {Object} ASTSelector * @property {string} rawSelector The string that was parsed into this selector * @property {boolean} isExit `true` if this should be emitted when exiting the node rather than when entering * @property {Object} parsedSelector An object (from esquery) describing the matching behavior of the selector * @property {string[]|null} listenerTypes A list of node types that could possibly cause the selector to match, * or `null` if all node types could cause a match * @property {number} attributeCount The total number of classes, pseudo-classes, and attribute queries in this selector * @property {number} identifierCount The total number of identifier queries in this selector */ //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Gets the possible types of a selector * @param {Object} parsedSelector An object (from esquery) describing the matching behavior of the selector * @returns {string[]|null} The node types that could possibly trigger this selector, or `null` if all node types could trigger it */ function getPossibleTypes(parsedSelector) { switch (parsedSelector.type) { case "identifier": return [parsedSelector.value]; case "matches": { var typesForComponents = parsedSelector.selectors.map(getPossibleTypes); if (typesForComponents.every(function (typesForComponent) { return typesForComponent; })) { return lodash.union.apply(null, typesForComponents); } return null; } case "compound": { var _typesForComponents = parsedSelector.selectors.map(getPossibleTypes).filter(function (typesForComponent) { return typesForComponent; }); // If all of the components could match any type, then the compound could also match any type. if (!_typesForComponents.length) { return null; } /* * If at least one of the components could only match a particular type, the compound could only match * the intersection of those types. */ return lodash.intersection.apply(null, _typesForComponents); } case "child": case "descendant": case "sibling": case "adjacent": return getPossibleTypes(parsedSelector.right); default: return null; } } /** * Counts the number of class, pseudo-class, and attribute queries in this selector * @param {Object} parsedSelector An object (from esquery) describing the selector's matching behavior * @returns {number} The number of class, pseudo-class, and attribute queries in this selector */ function countClassAttributes(parsedSelector) { switch (parsedSelector.type) { case "child": case "descendant": case "sibling": case "adjacent": return countClassAttributes(parsedSelector.left) + countClassAttributes(parsedSelector.right); case "compound": case "not": case "matches": return parsedSelector.selectors.reduce(function (sum, childSelector) { return sum + countClassAttributes(childSelector); }, 0); case "attribute": case "field": case "nth-child": case "nth-last-child": return 1; default: return 0; } } /** * Counts the number of identifier queries in this selector * @param {Object} parsedSelector An object (from esquery) describing the selector's matching behavior * @returns {number} The number of identifier queries */ function countIdentifiers(parsedSelector) { switch (parsedSelector.type) { case "child": case "descendant": case "sibling": case "adjacent": return countIdentifiers(parsedSelector.left) + countIdentifiers(parsedSelector.right); case "compound": case "not": case "matches": return parsedSelector.selectors.reduce(function (sum, childSelector) { return sum + countIdentifiers(childSelector); }, 0); case "identifier": return 1; default: return 0; } } /** * Compares the specificity of two selector objects, with CSS-like rules. * @param {ASTSelector} selectorA An AST selector descriptor * @param {ASTSelector} selectorB Another AST selector descriptor * @returns {number} * a value less than 0 if selectorA is less specific than selectorB * a value greater than 0 if selectorA is more specific than selectorB * a value less than 0 if selectorA and selectorB have the same specificity, and selectorA <= selectorB alphabetically * a value greater than 0 if selectorA and selectorB have the same specificity, and selectorA > selectorB alphabetically */ function compareSpecificity(selectorA, selectorB) { return selectorA.attributeCount - selectorB.attributeCount || selectorA.identifierCount - selectorB.identifierCount || (selectorA.rawSelector <= selectorB.rawSelector ? -1 : 1); } /** * Parses a raw selector string, and throws a useful error if parsing fails. * @param {string} rawSelector A raw AST selector * @returns {Object} An object (from esquery) describing the matching behavior of this selector * @throws {Error} An error if the selector is invalid */ function tryParseSelector(rawSelector) { try { return esquery.parse(rawSelector.replace(/:exit$/, "")); } catch (err) { if (typeof err.offset === "number") { throw new Error("Syntax error in selector \"" + rawSelector + "\" at position " + err.offset + ": " + err.message); } throw err; } } /** * Parses a raw selector string, and returns the parsed selector along with specificity and type information. * @param {string} rawSelector A raw AST selector * @returns {ASTSelector} A selector descriptor */ var parseSelector = lodash.memoize(function (rawSelector) { var parsedSelector = tryParseSelector(rawSelector); return { rawSelector: rawSelector, isExit: rawSelector.endsWith(":exit"), parsedSelector: parsedSelector, listenerTypes: getPossibleTypes(parsedSelector), attributeCount: countClassAttributes(parsedSelector), identifierCount: countIdentifiers(parsedSelector) }; }); //------------------------------------------------------------------------------ // Public Interface //------------------------------------------------------------------------------ /** * The event generator for AST nodes. * This implements below interface. * * ```ts * interface EventGenerator { * emitter: EventEmitter; * enterNode(node: ASTNode): void; * leaveNode(node: ASTNode): void; * } * ``` */ var NodeEventGenerator = function () { /** * @param {EventEmitter} emitter - An event emitter which is the destination of events. This emitter must already * have registered listeners for all of the events that it needs to listen for. * @returns {NodeEventGenerator} new instance */ function NodeEventGenerator(emitter) { var _this = this; _classCallCheck(this, NodeEventGenerator); this.emitter = emitter; this.currentAncestry = []; this.enterSelectorsByNodeType = new Map(); this.exitSelectorsByNodeType = new Map(); this.anyTypeEnterSelectors = []; this.anyTypeExitSelectors = []; var eventNames = typeof emitter.eventNames === "function" // Use the built-in eventNames() function if available (Node 6+) ? emitter.eventNames /* * Otherwise, use the private _events property. * Using a private property isn't ideal here, but this seems to * be the best way to get a list of event names without overriding * addEventListener, which would hurt performance. This property * is widely used and unlikely to be removed in a future version * (see https://github.com/nodejs/node/issues/1817). Also, future * node versions will have eventNames() anyway. */ () : Object.keys(emitter._events); // eslint-disable-line no-underscore-dangle eventNames.forEach(function (rawSelector) { var selector = parseSelector(rawSelector); if (selector.listenerTypes) { selector.listenerTypes.forEach(function (nodeType) { var typeMap = selector.isExit ? _this.exitSelectorsByNodeType : _this.enterSelectorsByNodeType; if (!typeMap.has(nodeType)) { typeMap.set(nodeType, []); } typeMap.get(nodeType).push(selector); }); } else { (selector.isExit ? _this.anyTypeExitSelectors : _this.anyTypeEnterSelectors).push(selector); } }); this.anyTypeEnterSelectors.sort(compareSpecificity); this.anyTypeExitSelectors.sort(compareSpecificity); this.enterSelectorsByNodeType.forEach(function (selectorList) { return selectorList.sort(compareSpecificity); }); this.exitSelectorsByNodeType.forEach(function (selectorList) { return selectorList.sort(compareSpecificity); }); } /** * Checks a selector against a node, and emits it if it matches * @param {ASTNode} node The node to check * @param {ASTSelector} selector An AST selector descriptor * @returns {void} */ _createClass(NodeEventGenerator, [{ key: "applySelector", value: function applySelector(node, selector) { if (esquery.matches(node, selector.parsedSelector, this.currentAncestry)) { this.emitter.emit(selector.rawSelector, node); } } /** * Applies all appropriate selectors to a node, in specificity order * @param {ASTNode} node The node to check * @param {boolean} isExit `false` if the node is currently being entered, `true` if it's currently being exited * @returns {void} */ }, { key: "applySelectors", value: function applySelectors(node, isExit) { var selectorsByNodeType = (isExit ? this.exitSelectorsByNodeType : this.enterSelectorsByNodeType).get(node.type) || []; var anyTypeSelectors = isExit ? this.anyTypeExitSelectors : this.anyTypeEnterSelectors; /* * selectorsByNodeType and anyTypeSelectors were already sorted by specificity in the constructor. * Iterate through each of them, applying selectors in the right order. */ var selectorsByTypeIndex = 0; var anyTypeSelectorsIndex = 0; while (selectorsByTypeIndex < selectorsByNodeType.length || anyTypeSelectorsIndex < anyTypeSelectors.length) { if (selectorsByTypeIndex >= selectorsByNodeType.length || anyTypeSelectorsIndex < anyTypeSelectors.length && compareSpecificity(anyTypeSelectors[anyTypeSelectorsIndex], selectorsByNodeType[selectorsByTypeIndex]) < 0) { this.applySelector(node, anyTypeSelectors[anyTypeSelectorsIndex++]); } else { this.applySelector(node, selectorsByNodeType[selectorsByTypeIndex++]); } } } /** * Emits an event of entering AST node. * @param {ASTNode} node - A node which was entered. * @returns {void} */ }, { key: "enterNode", value: function enterNode(node) { if (node.parent) { this.currentAncestry.unshift(node.parent); } this.applySelectors(node, false); } /** * Emits an event of leaving AST node. * @param {ASTNode} node - A node which was left. * @returns {void} */ }, { key: "leaveNode", value: function leaveNode(node) { this.applySelectors(node, true); this.currentAncestry.shift(); } }]); return NodeEventGenerator; }(); module.exports = NodeEventGenerator; },{"esquery":22,"lodash":48}],351:[function(require,module,exports){ /** * @fileoverview Pattern for detecting any letter (even letters outside of ASCII). * NOTE: This file was generated using this script in JSCS based on the Unicode 7.0.0 standard: https://github.com/jscs-dev/node-jscs/blob/f5ed14427deb7e7aac84f3056a5aab2d9f3e563e/publish/helpers/generate-patterns.js * Do not edit this file by hand-- please use https://github.com/mathiasbynens/regenerate to regenerate the regular expression exported from this file. * @author Kevin Partington * @license MIT License (from JSCS). See below. */ /* * The MIT License (MIT) * * Copyright 2013-2016 Dulin Marat and other contributors * * Permission is hereby granted, free of charge, to any person obtaining * a copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be * included in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */ "use strict"; module.exports = /[A-Za-z\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u048A-\u052F\u0531-\u0556\u0559\u0561-\u0587\u05D0-\u05EA\u05F0-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u08A0-\u08B2\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD\u09CE\u09DC\u09DD\u09DF-\u09E1\u09F0\u09F1\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A59-\u0A5C\u0A5E\u0A72-\u0A74\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C58\u0C59\u0C60\u0C61\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D60\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F4\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16F1-\u16F8\u1700-\u170C\u170E-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1877\u1880-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19C1-\u19C7\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4B\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1CE9-\u1CEC\u1CEE-\u1CF1\u1CF5\u1CF6\u1D00-\u1DBF\u1E00-\u1F15\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u2071\u207F\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2183\u2184\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2E2F\u3005\u3006\u3031-\u3035\u303B\u303C\u3041-\u3096\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FCC\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6E5\uA717-\uA71F\uA722-\uA788\uA78B-\uA78E\uA790-\uA7AD\uA7B0\uA7B1\uA7F7-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uA9E0-\uA9E4\uA9E6-\uA9EF\uA9FA-\uA9FE\uAA00-\uAA28\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA7E-\uAAAF\uAAB1\uAAB5\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB5F\uAB64\uAB65\uABC0-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC]|\uD800[\uDC00-\uDC0B\uDC0D-\uDC26\uDC28-\uDC3A\uDC3C\uDC3D\uDC3F-\uDC4D\uDC50-\uDC5D\uDC80-\uDCFA\uDE80-\uDE9C\uDEA0-\uDED0\uDF00-\uDF1F\uDF30-\uDF40\uDF42-\uDF49\uDF50-\uDF75\uDF80-\uDF9D\uDFA0-\uDFC3\uDFC8-\uDFCF]|\uD801[\uDC00-\uDC9D\uDD00-\uDD27\uDD30-\uDD63\uDE00-\uDF36\uDF40-\uDF55\uDF60-\uDF67]|\uD802[\uDC00-\uDC05\uDC08\uDC0A-\uDC35\uDC37\uDC38\uDC3C\uDC3F-\uDC55\uDC60-\uDC76\uDC80-\uDC9E\uDD00-\uDD15\uDD20-\uDD39\uDD80-\uDDB7\uDDBE\uDDBF\uDE00\uDE10-\uDE13\uDE15-\uDE17\uDE19-\uDE33\uDE60-\uDE7C\uDE80-\uDE9C\uDEC0-\uDEC7\uDEC9-\uDEE4\uDF00-\uDF35\uDF40-\uDF55\uDF60-\uDF72\uDF80-\uDF91]|\uD803[\uDC00-\uDC48]|\uD804[\uDC03-\uDC37\uDC83-\uDCAF\uDCD0-\uDCE8\uDD03-\uDD26\uDD50-\uDD72\uDD76\uDD83-\uDDB2\uDDC1-\uDDC4\uDDDA\uDE00-\uDE11\uDE13-\uDE2B\uDEB0-\uDEDE\uDF05-\uDF0C\uDF0F\uDF10\uDF13-\uDF28\uDF2A-\uDF30\uDF32\uDF33\uDF35-\uDF39\uDF3D\uDF5D-\uDF61]|\uD805[\uDC80-\uDCAF\uDCC4\uDCC5\uDCC7\uDD80-\uDDAE\uDE00-\uDE2F\uDE44\uDE80-\uDEAA]|\uD806[\uDCA0-\uDCDF\uDCFF\uDEC0-\uDEF8]|\uD808[\uDC00-\uDF98]|[\uD80C\uD840-\uD868\uD86A-\uD86C][\uDC00-\uDFFF]|\uD80D[\uDC00-\uDC2E]|\uD81A[\uDC00-\uDE38\uDE40-\uDE5E\uDED0-\uDEED\uDF00-\uDF2F\uDF40-\uDF43\uDF63-\uDF77\uDF7D-\uDF8F]|\uD81B[\uDF00-\uDF44\uDF50\uDF93-\uDF9F]|\uD82C[\uDC00\uDC01]|\uD82F[\uDC00-\uDC6A\uDC70-\uDC7C\uDC80-\uDC88\uDC90-\uDC99]|\uD835[\uDC00-\uDC54\uDC56-\uDC9C\uDC9E\uDC9F\uDCA2\uDCA5\uDCA6\uDCA9-\uDCAC\uDCAE-\uDCB9\uDCBB\uDCBD-\uDCC3\uDCC5-\uDD05\uDD07-\uDD0A\uDD0D-\uDD14\uDD16-\uDD1C\uDD1E-\uDD39\uDD3B-\uDD3E\uDD40-\uDD44\uDD46\uDD4A-\uDD50\uDD52-\uDEA5\uDEA8-\uDEC0\uDEC2-\uDEDA\uDEDC-\uDEFA\uDEFC-\uDF14\uDF16-\uDF34\uDF36-\uDF4E\uDF50-\uDF6E\uDF70-\uDF88\uDF8A-\uDFA8\uDFAA-\uDFC2\uDFC4-\uDFCB]|\uD83A[\uDC00-\uDCC4]|\uD83B[\uDE00-\uDE03\uDE05-\uDE1F\uDE21\uDE22\uDE24\uDE27\uDE29-\uDE32\uDE34-\uDE37\uDE39\uDE3B\uDE42\uDE47\uDE49\uDE4B\uDE4D-\uDE4F\uDE51\uDE52\uDE54\uDE57\uDE59\uDE5B\uDE5D\uDE5F\uDE61\uDE62\uDE64\uDE67-\uDE6A\uDE6C-\uDE72\uDE74-\uDE77\uDE79-\uDE7C\uDE7E\uDE80-\uDE89\uDE8B-\uDE9B\uDEA1-\uDEA3\uDEA5-\uDEA9\uDEAB-\uDEBB]|\uD869[\uDC00-\uDED6\uDF00-\uDFFF]|\uD86D[\uDC00-\uDF34\uDF40-\uDFFF]|\uD86E[\uDC00-\uDC1D]|\uD87E[\uDC00-\uDE1D]/; },{}],352:[function(require,module,exports){ /** * @fileoverview An object that creates fix commands for rules. * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ // none! //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ /** * Creates a fix command that inserts text at the specified index in the source text. * @param {int} index The 0-based index at which to insert the new text. * @param {string} text The text to insert. * @returns {Object} The fix command. * @private */ function insertTextAt(index, text) { return { range: [index, index], text: text }; } //------------------------------------------------------------------------------ // Public Interface //------------------------------------------------------------------------------ /** * Creates code fixing commands for rules. */ var ruleFixer = Object.freeze({ /** * Creates a fix command that inserts text after the given node or token. * The fix is not applied until applyFixes() is called. * @param {ASTNode|Token} nodeOrToken The node or token to insert after. * @param {string} text The text to insert. * @returns {Object} The fix command. */ insertTextAfter: function insertTextAfter(nodeOrToken, text) { return this.insertTextAfterRange(nodeOrToken.range, text); }, /** * Creates a fix command that inserts text after the specified range in the source text. * The fix is not applied until applyFixes() is called. * @param {int[]} range The range to replace, first item is start of range, second * is end of range. * @param {string} text The text to insert. * @returns {Object} The fix command. */ insertTextAfterRange: function insertTextAfterRange(range, text) { return insertTextAt(range[1], text); }, /** * Creates a fix command that inserts text before the given node or token. * The fix is not applied until applyFixes() is called. * @param {ASTNode|Token} nodeOrToken The node or token to insert before. * @param {string} text The text to insert. * @returns {Object} The fix command. */ insertTextBefore: function insertTextBefore(nodeOrToken, text) { return this.insertTextBeforeRange(nodeOrToken.range, text); }, /** * Creates a fix command that inserts text before the specified range in the source text. * The fix is not applied until applyFixes() is called. * @param {int[]} range The range to replace, first item is start of range, second * is end of range. * @param {string} text The text to insert. * @returns {Object} The fix command. */ insertTextBeforeRange: function insertTextBeforeRange(range, text) { return insertTextAt(range[0], text); }, /** * Creates a fix command that replaces text at the node or token. * The fix is not applied until applyFixes() is called. * @param {ASTNode|Token} nodeOrToken The node or token to remove. * @param {string} text The text to insert. * @returns {Object} The fix command. */ replaceText: function replaceText(nodeOrToken, text) { return this.replaceTextRange(nodeOrToken.range, text); }, /** * Creates a fix command that replaces text at the specified range in the source text. * The fix is not applied until applyFixes() is called. * @param {int[]} range The range to replace, first item is start of range, second * is end of range. * @param {string} text The text to insert. * @returns {Object} The fix command. */ replaceTextRange: function replaceTextRange(range, text) { return { range: range, text: text }; }, /** * Creates a fix command that removes the node or token from the source. * The fix is not applied until applyFixes() is called. * @param {ASTNode|Token} nodeOrToken The node or token to remove. * @returns {Object} The fix command. */ remove: function remove(nodeOrToken) { return this.removeRange(nodeOrToken.range); }, /** * Creates a fix command that removes the specified range of text from the source. * The fix is not applied until applyFixes() is called. * @param {int[]} range The range to remove, first item is start of range, second * is end of range. * @returns {Object} The fix command. */ removeRange: function removeRange(range) { return { range: range, text: "" }; } }); module.exports = ruleFixer; },{}],353:[function(require,module,exports){ /** * @fileoverview Abstraction of JavaScript source code. * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } function _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return call && (typeof call === "object" || typeof call === "function") ? call : self; } function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function, not " + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; } var TokenStore = require("../token-store"), Traverser = require("./traverser"), astUtils = require("../ast-utils"), lodash = require("lodash"); //------------------------------------------------------------------------------ // Private //------------------------------------------------------------------------------ /** * Validates that the given AST has the required information. * @param {ASTNode} ast The Program node of the AST to check. * @throws {Error} If the AST doesn't contain the correct information. * @returns {void} * @private */ function validate(ast) { if (!ast.tokens) { throw new Error("AST is missing the tokens array."); } if (!ast.comments) { throw new Error("AST is missing the comments array."); } if (!ast.loc) { throw new Error("AST is missing location information."); } if (!ast.range) { throw new Error("AST is missing range information"); } } /** * Finds a JSDoc comment node in an array of comment nodes. * @param {ASTNode[]} comments The array of comment nodes to search. * @param {int} line Line number to look around * @returns {ASTNode} The node if found, null if not. * @private */ function findJSDocComment(comments, line) { if (comments) { for (var i = comments.length - 1; i >= 0; i--) { if (comments[i].type === "Block" && comments[i].value.charAt(0) === "*") { if (line - comments[i].loc.end.line <= 1) { return comments[i]; } break; } } } return null; } /** * Check to see if its a ES6 export declaration * @param {ASTNode} astNode - any node * @returns {boolean} whether the given node represents a export declaration * @private */ function looksLikeExport(astNode) { return astNode.type === "ExportDefaultDeclaration" || astNode.type === "ExportNamedDeclaration" || astNode.type === "ExportAllDeclaration" || astNode.type === "ExportSpecifier"; } /** * Merges two sorted lists into a larger sorted list in O(n) time * @param {Token[]} tokens The list of tokens * @param {Token[]} comments The list of comments * @returns {Token[]} A sorted list of tokens and comments */ function sortedMerge(tokens, comments) { var result = []; var tokenIndex = 0; var commentIndex = 0; while (tokenIndex < tokens.length || commentIndex < comments.length) { if (commentIndex >= comments.length || tokenIndex < tokens.length && tokens[tokenIndex].range[0] < comments[commentIndex].range[0]) { result.push(tokens[tokenIndex++]); } else { result.push(comments[commentIndex++]); } } return result; } //------------------------------------------------------------------------------ // Public Interface //------------------------------------------------------------------------------ var SourceCode = function (_TokenStore) { _inherits(SourceCode, _TokenStore); /** * Represents parsed source code. * @param {string} text - The source code text. * @param {ASTNode} ast - The Program node of the AST representing the code. This AST should be created from the text that BOM was stripped. * @constructor */ function SourceCode(text, ast) { _classCallCheck(this, SourceCode); validate(ast); /** * The flag to indicate that the source code has Unicode BOM. * @type boolean */ var _this = _possibleConstructorReturn(this, (SourceCode.__proto__ || Object.getPrototypeOf(SourceCode)).call(this, ast.tokens, ast.comments)); _this.hasBOM = text.charCodeAt(0) === 0xFEFF; /** * The original text source code. * BOM was stripped from this text. * @type string */ _this.text = _this.hasBOM ? text.slice(1) : text; /** * The parsed AST for the source code. * @type ASTNode */ _this.ast = ast; // Check the source text for the presence of a shebang since it is parsed as a standard line comment. var shebangMatched = _this.text.match(astUtils.SHEBANG_MATCHER); var hasShebang = shebangMatched && ast.comments.length && ast.comments[0].value === shebangMatched[1]; if (hasShebang) { ast.comments[0].type = "Shebang"; } _this.tokensAndComments = sortedMerge(ast.tokens, ast.comments); /** * The source code split into lines according to ECMA-262 specification. * This is done to avoid each rule needing to do so separately. * @type string[] */ _this.lines = []; _this.lineStartIndices = [0]; var lineEndingPattern = astUtils.createGlobalLinebreakMatcher(); var match = void 0; /* * Previously, this was implemented using a regex that * matched a sequence of non-linebreak characters followed by a * linebreak, then adding the lengths of the matches. However, * this caused a catastrophic backtracking issue when the end * of a file contained a large number of non-newline characters. * To avoid this, the current implementation just matches newlines * and uses match.index to get the correct line start indices. */ while (match = lineEndingPattern.exec(_this.text)) { _this.lines.push(_this.text.slice(_this.lineStartIndices[_this.lineStartIndices.length - 1], match.index)); _this.lineStartIndices.push(match.index + match[0].length); } _this.lines.push(_this.text.slice(_this.lineStartIndices[_this.lineStartIndices.length - 1])); // Cache for comments found using getComments(). _this._commentCache = new WeakMap(); // don't allow modification of this object Object.freeze(_this); Object.freeze(_this.lines); return _this; } /** * Split the source code into multiple lines based on the line delimiters * @param {string} text Source code as a string * @returns {string[]} Array of source code lines * @public */ _createClass(SourceCode, [{ key: "getText", /** * Gets the source code for the given node. * @param {ASTNode=} node The AST node to get the text for. * @param {int=} beforeCount The number of characters before the node to retrieve. * @param {int=} afterCount The number of characters after the node to retrieve. * @returns {string} The text representing the AST node. */ value: function getText(node, beforeCount, afterCount) { if (node) { return this.text.slice(Math.max(node.range[0] - (beforeCount || 0), 0), node.range[1] + (afterCount || 0)); } return this.text; } /** * Gets the entire source text split into an array of lines. * @returns {Array} The source text as an array of lines. */ }, { key: "getLines", value: function getLines() { return this.lines; } /** * Retrieves an array containing all comments in the source code. * @returns {ASTNode[]} An array of comment nodes. */ }, { key: "getAllComments", value: function getAllComments() { return this.ast.comments; } /** * Gets all comments for the given node. * @param {ASTNode} node The AST node to get the comments for. * @returns {Object} The list of comments indexed by their position. * @public */ }, { key: "getComments", value: function getComments(node) { if (this._commentCache.has(node)) { return this._commentCache.get(node); } var comments = { leading: [], trailing: [] }; /* * Return all comments as leading comments of the Program node when * there is no executable code. */ if (node.type === "Program") { if (node.body.length === 0) { comments.leading = node.comments; } } else { /* Return comments as trailing comments of nodes that only contain * comments (to mimic the comment attachment behavior present in Espree). */ if ((node.type === "BlockStatement" || node.type === "ClassBody") && node.body.length === 0 || node.type === "ObjectExpression" && node.properties.length === 0 || node.type === "ArrayExpression" && node.elements.length === 0 || node.type === "SwitchStatement" && node.cases.length === 0) { comments.trailing = this.getTokens(node, { includeComments: true, filter: astUtils.isCommentToken }); } /* * Iterate over tokens before and after node and collect comment tokens. * Do not include comments that exist outside of the parent node * to avoid duplication. */ var currentToken = this.getTokenBefore(node, { includeComments: true }); while (currentToken && astUtils.isCommentToken(currentToken)) { if (node.parent && currentToken.start < node.parent.start) { break; } comments.leading.push(currentToken); currentToken = this.getTokenBefore(currentToken, { includeComments: true }); } comments.leading.reverse(); currentToken = this.getTokenAfter(node, { includeComments: true }); while (currentToken && astUtils.isCommentToken(currentToken)) { if (node.parent && currentToken.end > node.parent.end) { break; } comments.trailing.push(currentToken); currentToken = this.getTokenAfter(currentToken, { includeComments: true }); } } this._commentCache.set(node, comments); return comments; } /** * Retrieves the JSDoc comment for a given node. * @param {ASTNode} node The AST node to get the comment for. * @returns {ASTNode} The Block comment node containing the JSDoc for the * given node or null if not found. * @public */ }, { key: "getJSDocComment", value: function getJSDocComment(node) { var parent = node.parent; var leadingComments = this.getCommentsBefore(node); switch (node.type) { case "ClassDeclaration": case "FunctionDeclaration": if (looksLikeExport(parent)) { return findJSDocComment(this.getCommentsBefore(parent), parent.loc.start.line); } return findJSDocComment(leadingComments, node.loc.start.line); case "ClassExpression": return findJSDocComment(this.getCommentsBefore(parent.parent), parent.parent.loc.start.line); case "ArrowFunctionExpression": case "FunctionExpression": if (parent.type !== "CallExpression" && parent.type !== "NewExpression") { var parentLeadingComments = this.getCommentsBefore(parent); while (!parentLeadingComments.length && !/Function/.test(parent.type) && parent.type !== "MethodDefinition" && parent.type !== "Property") { parent = parent.parent; if (!parent) { break; } parentLeadingComments = this.getCommentsBefore(parent); } return parent && parent.type !== "FunctionDeclaration" && parent.type !== "Program" ? findJSDocComment(parentLeadingComments, parent.loc.start.line) : null; } else if (leadingComments.length) { return findJSDocComment(leadingComments, node.loc.start.line); } // falls through default: return null; } } /** * Gets the deepest node containing a range index. * @param {int} index Range index of the desired node. * @returns {ASTNode} The node if found or null if not found. */ }, { key: "getNodeByRangeIndex", value: function getNodeByRangeIndex(index) { var result = null, resultParent = null; var traverser = new Traverser(); traverser.traverse(this.ast, { enter: function enter(node, parent) { if (node.range[0] <= index && index < node.range[1]) { result = node; resultParent = parent; } else { this.skip(); } }, leave: function leave(node) { if (node === result) { this.break(); } } }); return result ? Object.assign({ parent: resultParent }, result) : null; } /** * Determines if two tokens have at least one whitespace character * between them. This completely disregards comments in making the * determination, so comments count as zero-length substrings. * @param {Token} first The token to check after. * @param {Token} second The token to check before. * @returns {boolean} True if there is only space between tokens, false * if there is anything other than whitespace between tokens. */ }, { key: "isSpaceBetweenTokens", value: function isSpaceBetweenTokens(first, second) { var text = this.text.slice(first.range[1], second.range[0]); return (/\s/.test(text.replace(/\/\*.*?\*\//g, "")) ); } /** * Converts a source text index into a (line, column) pair. * @param {number} index The index of a character in a file * @returns {Object} A {line, column} location object with a 0-indexed column */ }, { key: "getLocFromIndex", value: function getLocFromIndex(index) { if (typeof index !== "number") { throw new TypeError("Expected `index` to be a number."); } if (index < 0 || index > this.text.length) { throw new RangeError("Index out of range (requested index " + index + ", but source text has length " + this.text.length + ")."); } /* * For an argument of this.text.length, return the location one "spot" past the last character * of the file. If the last character is a linebreak, the location will be column 0 of the next * line; otherwise, the location will be in the next column on the same line. * * See getIndexFromLoc for the motivation for this special case. */ if (index === this.text.length) { return { line: this.lines.length, column: this.lines[this.lines.length - 1].length }; } /* * To figure out which line rangeIndex is on, determine the last index at which rangeIndex could * be inserted into lineIndices to keep the list sorted. */ var lineNumber = lodash.sortedLastIndex(this.lineStartIndices, index); return { line: lineNumber, column: index - this.lineStartIndices[lineNumber - 1] }; } /** * Converts a (line, column) pair into a range index. * @param {Object} loc A line/column location * @param {number} loc.line The line number of the location (1-indexed) * @param {number} loc.column The column number of the location (0-indexed) * @returns {number} The range index of the location in the file. */ }, { key: "getIndexFromLoc", value: function getIndexFromLoc(loc) { if ((typeof loc === "undefined" ? "undefined" : _typeof(loc)) !== "object" || typeof loc.line !== "number" || typeof loc.column !== "number") { throw new TypeError("Expected `loc` to be an object with numeric `line` and `column` properties."); } if (loc.line <= 0) { throw new RangeError("Line number out of range (line " + loc.line + " requested). Line numbers should be 1-based."); } if (loc.line > this.lineStartIndices.length) { throw new RangeError("Line number out of range (line " + loc.line + " requested, but only " + this.lineStartIndices.length + " lines present)."); } var lineStartIndex = this.lineStartIndices[loc.line - 1]; var lineEndIndex = loc.line === this.lineStartIndices.length ? this.text.length : this.lineStartIndices[loc.line]; var positionIndex = lineStartIndex + loc.column; /* * By design, getIndexFromLoc({ line: lineNum, column: 0 }) should return the start index of * the given line, provided that the line number is valid element of this.lines. Since the * last element of this.lines is an empty string for files with trailing newlines, add a * special case where getting the index for the first location after the end of the file * will return the length of the file, rather than throwing an error. This allows rules to * use getIndexFromLoc consistently without worrying about edge cases at the end of a file. */ if (loc.line === this.lineStartIndices.length && positionIndex > lineEndIndex || loc.line < this.lineStartIndices.length && positionIndex >= lineEndIndex) { throw new RangeError("Column number out of range (column " + loc.column + " requested, but the length of line " + loc.line + " is " + (lineEndIndex - lineStartIndex) + ")."); } return positionIndex; } }], [{ key: "splitLines", value: function splitLines(text) { return text.split(astUtils.createGlobalLinebreakMatcher()); } }]); return SourceCode; }(TokenStore); module.exports = SourceCode; },{"../ast-utils":67,"../token-store":343,"./traverser":354,"lodash":48}],354:[function(require,module,exports){ /** * @fileoverview Wrapper around estraverse * @author Nicholas C. Zakas */ "use strict"; //------------------------------------------------------------------------------ // Requirements //------------------------------------------------------------------------------ var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); var _get = function get(object, property, receiver) { if (object === null) object = Function.prototype; var desc = Object.getOwnPropertyDescriptor(object, property); if (desc === undefined) { var parent = Object.getPrototypeOf(object); if (parent === null) { return undefined; } else { return get(parent, property, receiver); } } else if ("value" in desc) { return desc.value; } else { var getter = desc.get; if (getter === undefined) { return undefined; } return getter.call(receiver); } }; function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } function _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return call && (typeof call === "object" || typeof call === "function") ? call : self; } function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function, not " + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; } var estraverse = require("estraverse"); //------------------------------------------------------------------------------ // Helpers //------------------------------------------------------------------------------ var KEY_BLACKLIST = new Set(["parent", "leadingComments", "trailingComments"]); /** * Wrapper around an estraverse controller that ensures the correct keys * are visited. * @constructor */ var Traverser = function (_estraverse$Controlle) { _inherits(Traverser, _estraverse$Controlle); function Traverser() { _classCallCheck(this, Traverser); return _possibleConstructorReturn(this, (Traverser.__proto__ || Object.getPrototypeOf(Traverser)).apply(this, arguments)); } _createClass(Traverser, [{ key: "traverse", value: function traverse(node, visitor) { visitor.fallback = Traverser.getKeys; return _get(Traverser.prototype.__proto__ || Object.getPrototypeOf(Traverser.prototype), "traverse", this).call(this, node, visitor); } /** * Calculates the keys to use for traversal. * @param {ASTNode} node The node to read keys from. * @returns {string[]} An array of keys to visit on the node. * @private */ }], [{ key: "getKeys", value: function getKeys(node) { return Object.keys(node).filter(function (key) { return !KEY_BLACKLIST.has(key); }); } }]); return Traverser; }(estraverse.Controller); module.exports = Traverser; },{"estraverse":28}]},{},[78])(78) }); (function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.rules = f()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o * @license MIT */ var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; function compare(a, b) { if (a === b) { return 0; } var x = a.length; var y = b.length; for (var i = 0, len = Math.min(x, y); i < len; ++i) { if (a[i] !== b[i]) { x = a[i]; y = b[i]; break; } } if (x < y) { return -1; } if (y < x) { return 1; } return 0; } function isBuffer(b) { if (global.Buffer && typeof global.Buffer.isBuffer === 'function') { return global.Buffer.isBuffer(b); } return !!(b != null && b._isBuffer); } // based on node assert, original notice: // http://wiki.commonjs.org/wiki/Unit_Testing/1.0 // // THIS IS NOT TESTED NOR LIKELY TO WORK OUTSIDE V8! // // Originally from narwhal.js (http://narwhaljs.org) // Copyright (c) 2009 Thomas Robinson <280north.com> // // Permission is hereby granted, free of charge, to any person obtaining a copy // of this software and associated documentation files (the 'Software'), to // deal in the Software without restriction, including without limitation the // rights to use, copy, modify, merge, publish, distribute, sublicense, and/or // sell copies of the Software, and to permit persons to whom the Software is // furnished to do so, subject to the following conditions: // // The above copyright notice and this permission notice shall be included in // all copies or substantial portions of the Software. // // THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE // AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN // ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION // WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. var util = require('util/'); var hasOwn = Object.prototype.hasOwnProperty; var pSlice = Array.prototype.slice; var functionsHaveNames = function () { return function foo() {}.name === 'foo'; }(); function pToString(obj) { return Object.prototype.toString.call(obj); } function isView(arrbuf) { if (isBuffer(arrbuf)) { return false; } if (typeof global.ArrayBuffer !== 'function') { return false; } if (typeof ArrayBuffer.isView === 'function') { return ArrayBuffer.isView(arrbuf); } if (!arrbuf) { return false; } if (arrbuf instanceof DataView) { return true; } if (arrbuf.buffer && arrbuf.buffer instanceof ArrayBuffer) { return true; } return false; } // 1. The assert module provides functions that throw // AssertionError's when particular conditions are not met. The // assert module must conform to the following interface. var assert = module.exports = ok; // 2. The AssertionError is defined in assert. // new assert.AssertionError({ message: message, // actual: actual, // expected: expected }) var regex = /\s*function\s+([^\(\s]*)\s*/; // based on https://github.com/ljharb/function.prototype.name/blob/adeeeec8bfcc6068b187d7d9fb3d5bb1d3a30899/implementation.js function getName(func) { if (!util.isFunction(func)) { return; } if (functionsHaveNames) { return func.name; } var str = func.toString(); var match = str.match(regex); return match && match[1]; } assert.AssertionError = function AssertionError(options) { this.name = 'AssertionError'; this.actual = options.actual; this.expected = options.expected; this.operator = options.operator; if (options.message) { this.message = options.message; this.generatedMessage = false; } else { this.message = getMessage(this); this.generatedMessage = true; } var stackStartFunction = options.stackStartFunction || fail; if (Error.captureStackTrace) { Error.captureStackTrace(this, stackStartFunction); } else { // non v8 browsers so we can have a stacktrace var err = new Error(); if (err.stack) { var out = err.stack; // try to strip useless frames var fn_name = getName(stackStartFunction); var idx = out.indexOf('\n' + fn_name); if (idx >= 0) { // once we have located the function frame // we need to strip out everything before it (and its line) var next_line = out.indexOf('\n', idx + 1); out = out.substring(next_line + 1); } this.stack = out; } } }; // assert.AssertionError instanceof Error util.inherits(assert.AssertionError, Error); function truncate(s, n) { if (typeof s === 'string') { return s.length < n ? s : s.slice(0, n); } else { return s; } } function inspect(something) { if (functionsHaveNames || !util.isFunction(something)) { return util.inspect(something); } var rawname = getName(something); var name = rawname ? ': ' + rawname : ''; return '[Function' + name + ']'; } function getMessage(self) { return truncate(inspect(self.actual), 128) + ' ' + self.operator + ' ' + truncate(inspect(self.expected), 128); } // At present only the three keys mentioned above are used and // understood by the spec. Implementations or sub modules can pass // other keys to the AssertionError's constructor - they will be // ignored. // 3. All of the following functions must throw an AssertionError // when a corresponding condition is not met, with a message that // may be undefined if not provided. All assertion methods provide // both the actual and expected values to the assertion error for // display purposes. function fail(actual, expected, message, operator, stackStartFunction) { throw new assert.AssertionError({ message: message, actual: actual, expected: expected, operator: operator, stackStartFunction: stackStartFunction }); } // EXTENSION! allows for well behaved errors defined elsewhere. assert.fail = fail; // 4. Pure assertion tests whether a value is truthy, as determined // by !!guard. // assert.ok(guard, message_opt); // This statement is equivalent to assert.equal(true, !!guard, // message_opt);. To test strictly for the value true, use // assert.strictEqual(true, guard, message_opt);. function ok(value, message) { if (!value) fail(value, true, message, '==', assert.ok); } assert.ok = ok; // 5. The equality assertion tests shallow, coercive equality with // ==. // assert.equal(actual, expected, message_opt); assert.equal = function equal(actual, expected, message) { if (actual != expected) fail(actual, expected, message, '==', assert.equal); }; // 6. The non-equality assertion tests for whether two objects are not equal // with != assert.notEqual(actual, expected, message_opt); assert.notEqual = function notEqual(actual, expected, message) { if (actual == expected) { fail(actual, expected, message, '!=', assert.notEqual); } }; // 7. The equivalence assertion tests a deep equality relation. // assert.deepEqual(actual, expected, message_opt); assert.deepEqual = function deepEqual(actual, expected, message) { if (!_deepEqual(actual, expected, false)) { fail(actual, expected, message, 'deepEqual', assert.deepEqual); } }; assert.deepStrictEqual = function deepStrictEqual(actual, expected, message) { if (!_deepEqual(actual, expected, true)) { fail(actual, expected, message, 'deepStrictEqual', assert.deepStrictEqual); } }; function _deepEqual(actual, expected, strict, memos) { // 7.1. All identical values are equivalent, as determined by ===. if (actual === expected) { return true; } else if (isBuffer(actual) && isBuffer(expected)) { return compare(actual, expected) === 0; // 7.2. If the expected value is a Date object, the actual value is // equivalent if it is also a Date object that refers to the same time. } else if (util.isDate(actual) && util.isDate(expected)) { return actual.getTime() === expected.getTime(); // 7.3 If the expected value is a RegExp object, the actual value is // equivalent if it is also a RegExp object with the same source and // properties (`global`, `multiline`, `lastIndex`, `ignoreCase`). } else if (util.isRegExp(actual) && util.isRegExp(expected)) { return actual.source === expected.source && actual.global === expected.global && actual.multiline === expected.multiline && actual.lastIndex === expected.lastIndex && actual.ignoreCase === expected.ignoreCase; // 7.4. Other pairs that do not both pass typeof value == 'object', // equivalence is determined by ==. } else if ((actual === null || (typeof actual === 'undefined' ? 'undefined' : _typeof(actual)) !== 'object') && (expected === null || (typeof expected === 'undefined' ? 'undefined' : _typeof(expected)) !== 'object')) { return strict ? actual === expected : actual == expected; // If both values are instances of typed arrays, wrap their underlying // ArrayBuffers in a Buffer each to increase performance // This optimization requires the arrays to have the same type as checked by // Object.prototype.toString (aka pToString). Never perform binary // comparisons for Float*Arrays, though, since e.g. +0 === -0 but their // bit patterns are not identical. } else if (isView(actual) && isView(expected) && pToString(actual) === pToString(expected) && !(actual instanceof Float32Array || actual instanceof Float64Array)) { return compare(new Uint8Array(actual.buffer), new Uint8Array(expected.buffer)) === 0; // 7.5 For all other Object pairs, including Array objects, equivalence is // determined by having the same number of owned properties (as verified // with Object.prototype.hasOwnProperty.call), the same set of keys // (although not necessarily the same order), equivalent values for every // corresponding key, and an identical 'prototype' property. Note: this // accounts for both named and indexed properties on Arrays. } else if (isBuffer(actual) !== isBuffer(expected)) { return false; } else { memos = memos || { actual: [], expected: [] }; var actualIndex = memos.actual.indexOf(actual); if (actualIndex !== -1) { if (actualIndex === memos.expected.indexOf(expected)) { return true; } } memos.actual.push(actual); memos.expected.push(expected); return objEquiv(actual, expected, strict, memos); } } function isArguments(object) { return Object.prototype.toString.call(object) == '[object Arguments]'; } function objEquiv(a, b, strict, actualVisitedObjects) { if (a === null || a === undefined || b === null || b === undefined) return false; // if one is a primitive, the other must be same if (util.isPrimitive(a) || util.isPrimitive(b)) return a === b; if (strict && Object.getPrototypeOf(a) !== Object.getPrototypeOf(b)) return false; var aIsArgs = isArguments(a); var bIsArgs = isArguments(b); if (aIsArgs && !bIsArgs || !aIsArgs && bIsArgs) return false; if (aIsArgs) { a = pSlice.call(a); b = pSlice.call(b); return _deepEqual(a, b, strict); } var ka = objectKeys(a); var kb = objectKeys(b); var key, i; // having the same number of owned properties (keys incorporates // hasOwnProperty) if (ka.length !== kb.length) return false; //the same set of keys (although not necessarily the same order), ka.sort(); kb.sort(); //~~~cheap key test for (i = ka.length - 1; i >= 0; i--) { if (ka[i] !== kb[i]) return false; } //equivalent values for every corresponding key, and //~~~possibly expensive deep test for (i = ka.length - 1; i >= 0; i--) { key = ka[i]; if (!_deepEqual(a[key], b[key], strict, actualVisitedObjects)) return false; } return true; } // 8. The non-equivalence assertion tests for any deep inequality. // assert.notDeepEqual(actual, expected, message_opt); assert.notDeepEqual = function notDeepEqual(actual, expected, message) { if (_deepEqual(actual, expected, false)) { fail(actual, expected, message, 'notDeepEqual', assert.notDeepEqual); } }; assert.notDeepStrictEqual = notDeepStrictEqual; function notDeepStrictEqual(actual, expected, message) { if (_deepEqual(actual, expected, true)) { fail(actual, expected, message, 'notDeepStrictEqual', notDeepStrictEqual); } } // 9. The strict equality assertion tests strict equality, as determined by ===. // assert.strictEqual(actual, expected, message_opt); assert.strictEqual = function strictEqual(actual, expected, message) { if (actual !== expected) { fail(actual, expected, message, '===', assert.strictEqual); } }; // 10. The strict non-equality assertion tests for strict inequality, as // determined by !==. assert.notStrictEqual(actual, expected, message_opt); assert.notStrictEqual = function notStrictEqual(actual, expected, message) { if (actual === expected) { fail(actual, expected, message, '!==', assert.notStrictEqual); } }; function expectedException(actual, expected) { if (!actual || !expected) { return false; } if (Object.prototype.toString.call(expected) == '[object RegExp]') { return expected.test(actual); } try { if (actual instanceof expected) { return true; } } catch (e) { // Ignore. The instanceof check doesn't work for arrow functions. } if (Error.isPrototypeOf(expected)) { return false; } return expected.call({}, actual) === true; } function _tryBlock(block) { var error; try { block(); } catch (e) { error = e; } return error; } function _throws(shouldThrow, block, expected, message) { var actual; if (typeof block !== 'function') { throw new TypeError('"block" argument must be a function'); } if (typeof expected === 'string') { message = expected; expected = null; } actual = _tryBlock(block); message = (expected && expected.name ? ' (' + expected.name + ').' : '.') + (message ? ' ' + message : '.'); if (shouldThrow && !actual) { fail(actual, expected, 'Missing expected exception' + message); } var userProvidedMessage = typeof message === 'string'; var isUnwantedException = !shouldThrow && util.isError(actual); var isUnexpectedException = !shouldThrow && actual && !expected; if (isUnwantedException && userProvidedMessage && expectedException(actual, expected) || isUnexpectedException) { fail(actual, expected, 'Got unwanted exception' + message); } if (shouldThrow && actual && expected && !expectedException(actual, expected) || !shouldThrow && actual) { throw actual; } } // 11. Expected to throw an error: // assert.throws(block, Error_opt, message_opt); assert.throws = function (block, /*optional*/error, /*optional*/message) { _throws(true, block, error, message); }; // EXTENSION! This is annoying to write outside this module. assert.doesNotThrow = function (block, /*optional*/error, /*optional*/message) { _throws(false, block, error, message); }; assert.ifError = function (err) { if (err) throw err; }; var objectKeys = Object.keys || function (obj) { var keys = []; for (var key in obj) { if (hasOwn.call(obj, key)) keys.push(key); } return keys; }; }).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {}) },{"util/":21}],2:[function(require,module,exports){ 'use strict'; /* * @fileoverview Main Doctrine object * @author Yusuke Suzuki * @author Dan Tao * @author Andrew Eisenberg */ (function () { 'use strict'; var typed, utility, isArray, jsdoc, esutils, hasOwnProperty; esutils = require('esutils'); isArray = require('isarray'); typed = require('./typed'); utility = require('./utility'); function sliceSource(source, index, last) { return source.slice(index, last); } hasOwnProperty = function () { var func = Object.prototype.hasOwnProperty; return function hasOwnProperty(obj, name) { return func.call(obj, name); }; }(); function shallowCopy(obj) { var ret = {}, key; for (key in obj) { if (obj.hasOwnProperty(key)) { ret[key] = obj[key]; } } return ret; } function isASCIIAlphanumeric(ch) { return ch >= 0x61 /* 'a' */ && ch <= 0x7A /* 'z' */ || ch >= 0x41 /* 'A' */ && ch <= 0x5A /* 'Z' */ || ch >= 0x30 /* '0' */ && ch <= 0x39 /* '9' */; } function isParamTitle(title) { return title === 'param' || title === 'argument' || title === 'arg'; } function isReturnTitle(title) { return title === 'return' || title === 'returns'; } function isProperty(title) { return title === 'property' || title === 'prop'; } function isNameParameterRequired(title) { return isParamTitle(title) || isProperty(title) || title === 'alias' || title === 'this' || title === 'mixes' || title === 'requires'; } function isAllowedName(title) { return isNameParameterRequired(title) || title === 'const' || title === 'constant'; } function isAllowedNested(title) { return isProperty(title) || isParamTitle(title); } function isAllowedOptional(title) { return isProperty(title) || isParamTitle(title); } function isTypeParameterRequired(title) { return isParamTitle(title) || isReturnTitle(title) || title === 'define' || title === 'enum' || title === 'implements' || title === 'this' || title === 'type' || title === 'typedef' || isProperty(title); } // Consider deprecation instead using 'isTypeParameterRequired' and 'Rules' declaration to pick when a type is optional/required // This would require changes to 'parseType' function isAllowedType(title) { return isTypeParameterRequired(title) || title === 'throws' || title === 'const' || title === 'constant' || title === 'namespace' || title === 'member' || title === 'var' || title === 'module' || title === 'constructor' || title === 'class' || title === 'extends' || title === 'augments' || title === 'public' || title === 'private' || title === 'protected'; } function trim(str) { return str.replace(/^\s+/, '').replace(/\s+$/, ''); } function unwrapComment(doc) { // JSDoc comment is following form // /** // * ....... // */ // remove /**, */ and * var BEFORE_STAR = 0, STAR = 1, AFTER_STAR = 2, index, len, mode, result, ch; doc = doc.replace(/^\/\*\*?/, '').replace(/\*\/$/, ''); index = 0; len = doc.length; mode = BEFORE_STAR; result = ''; while (index < len) { ch = doc.charCodeAt(index); switch (mode) { case BEFORE_STAR: if (esutils.code.isLineTerminator(ch)) { result += String.fromCharCode(ch); } else if (ch === 0x2A /* '*' */) { mode = STAR; } else if (!esutils.code.isWhiteSpace(ch)) { result += String.fromCharCode(ch); mode = AFTER_STAR; } break; case STAR: if (!esutils.code.isWhiteSpace(ch)) { result += String.fromCharCode(ch); } mode = esutils.code.isLineTerminator(ch) ? BEFORE_STAR : AFTER_STAR; break; case AFTER_STAR: result += String.fromCharCode(ch); if (esutils.code.isLineTerminator(ch)) { mode = BEFORE_STAR; } break; } index += 1; } return result.replace(/\s+$/, ''); } // JSDoc Tag Parser (function (exports) { var Rules, index, lineNumber, length, source, recoverable, sloppy, strict; function advance() { var ch = source.charCodeAt(index); index += 1; if (esutils.code.isLineTerminator(ch) && !(ch === 0x0D /* '\r' */ && source.charCodeAt(index) === 0x0A /* '\n' */)) { lineNumber += 1; } return String.fromCharCode(ch); } function scanTitle() { var title = ''; // waste '@' advance(); while (index < length && isASCIIAlphanumeric(source.charCodeAt(index))) { title += advance(); } return title; } function seekContent() { var ch, waiting, last = index; waiting = false; while (last < length) { ch = source.charCodeAt(last); if (esutils.code.isLineTerminator(ch) && !(ch === 0x0D /* '\r' */ && source.charCodeAt(last + 1) === 0x0A /* '\n' */)) { waiting = true; } else if (waiting) { if (ch === 0x40 /* '@' */) { break; } if (!esutils.code.isWhiteSpace(ch)) { waiting = false; } } last += 1; } return last; } // type expression may have nest brace, such as, // { { ok: string } } // // therefore, scanning type expression with balancing braces. function parseType(title, last) { var ch, brace, type, direct = false; // search '{' while (index < last) { ch = source.charCodeAt(index); if (esutils.code.isWhiteSpace(ch)) { advance(); } else if (ch === 0x7B /* '{' */) { advance(); break; } else { // this is direct pattern direct = true; break; } } if (direct) { return null; } // type expression { is found brace = 1; type = ''; while (index < last) { ch = source.charCodeAt(index); if (esutils.code.isLineTerminator(ch)) { advance(); } else { if (ch === 0x7D /* '}' */) { brace -= 1; if (brace === 0) { advance(); break; } } else if (ch === 0x7B /* '{' */) { brace += 1; } type += advance(); } } if (brace !== 0) { // braces is not balanced return utility.throwError('Braces are not balanced'); } if (isAllowedOptional(title)) { return typed.parseParamType(type); } return typed.parseType(type); } function scanIdentifier(last) { var identifier; if (!esutils.code.isIdentifierStartES5(source.charCodeAt(index))) { return null; } identifier = advance(); while (index < last && esutils.code.isIdentifierPartES5(source.charCodeAt(index))) { identifier += advance(); } return identifier; } function skipWhiteSpace(last) { while (index < last && (esutils.code.isWhiteSpace(source.charCodeAt(index)) || esutils.code.isLineTerminator(source.charCodeAt(index)))) { advance(); } } function parseName(last, allowBrackets, allowNestedParams) { var name = '', useBrackets, insideString; skipWhiteSpace(last); if (index >= last) { return null; } if (allowBrackets && source.charCodeAt(index) === 0x5B /* '[' */) { useBrackets = true; name = advance(); } if (!esutils.code.isIdentifierStartES5(source.charCodeAt(index))) { return null; } name += scanIdentifier(last); if (allowNestedParams) { if (source.charCodeAt(index) === 0x3A /* ':' */ && (name === 'module' || name === 'external' || name === 'event')) { name += advance(); name += scanIdentifier(last); } if (source.charCodeAt(index) === 0x5B /* '[' */ && source.charCodeAt(index + 1) === 0x5D /* ']' */) { name += advance(); name += advance(); } while (source.charCodeAt(index) === 0x2E /* '.' */ || source.charCodeAt(index) === 0x2F /* '/' */ || source.charCodeAt(index) === 0x23 /* '#' */ || source.charCodeAt(index) === 0x2D /* '-' */ || source.charCodeAt(index) === 0x7E /* '~' */) { name += advance(); name += scanIdentifier(last); } } if (useBrackets) { skipWhiteSpace(last); // do we have a default value for this? if (source.charCodeAt(index) === 0x3D /* '=' */) { // consume the '='' symbol name += advance(); skipWhiteSpace(last); var ch; var bracketDepth = 1; // scan in the default value while (index < last) { ch = source.charCodeAt(index); if (esutils.code.isWhiteSpace(ch)) { if (!insideString) { skipWhiteSpace(last); ch = source.charCodeAt(index); } } if (ch === 0x27 /* ''' */) { if (!insideString) { insideString = '\''; } else { if (insideString === '\'') { insideString = ''; } } } if (ch === 0x22 /* '"' */) { if (!insideString) { insideString = '"'; } else { if (insideString === '"') { insideString = ''; } } } if (ch === 0x5B /* '[' */) { bracketDepth++; } else if (ch === 0x5D /* ']' */ && --bracketDepth === 0) { break; } name += advance(); } } skipWhiteSpace(last); if (index >= last || source.charCodeAt(index) !== 0x5D /* ']' */) { // we never found a closing ']' return null; } // collect the last ']' name += advance(); } return name; } function skipToTag() { while (index < length && source.charCodeAt(index) !== 0x40 /* '@' */) { advance(); } if (index >= length) { return false; } utility.assert(source.charCodeAt(index) === 0x40 /* '@' */); return true; } function TagParser(options, title) { this._options = options; this._title = title.toLowerCase(); this._tag = { title: title, description: null }; if (this._options.lineNumbers) { this._tag.lineNumber = lineNumber; } this._last = 0; // space to save special information for title parsers. this._extra = {}; } // addError(err, ...) TagParser.prototype.addError = function addError(errorText) { var args = Array.prototype.slice.call(arguments, 1), msg = errorText.replace(/%(\d)/g, function (whole, index) { utility.assert(index < args.length, 'Message reference must be in range'); return args[index]; }); if (!this._tag.errors) { this._tag.errors = []; } if (strict) { utility.throwError(msg); } this._tag.errors.push(msg); return recoverable; }; TagParser.prototype.parseType = function () { // type required titles if (isTypeParameterRequired(this._title)) { try { this._tag.type = parseType(this._title, this._last); if (!this._tag.type) { if (!isParamTitle(this._title) && !isReturnTitle(this._title)) { if (!this.addError('Missing or invalid tag type')) { return false; } } } } catch (error) { this._tag.type = null; if (!this.addError(error.message)) { return false; } } } else if (isAllowedType(this._title)) { // optional types try { this._tag.type = parseType(this._title, this._last); } catch (e) { //For optional types, lets drop the thrown error when we hit the end of the file } } return true; }; TagParser.prototype._parseNamePath = function (optional) { var name; name = parseName(this._last, sloppy && isAllowedOptional(this._title), true); if (!name) { if (!optional) { if (!this.addError('Missing or invalid tag name')) { return false; } } } this._tag.name = name; return true; }; TagParser.prototype.parseNamePath = function () { return this._parseNamePath(false); }; TagParser.prototype.parseNamePathOptional = function () { return this._parseNamePath(true); }; TagParser.prototype.parseName = function () { var assign, name; // param, property requires name if (isAllowedName(this._title)) { this._tag.name = parseName(this._last, sloppy && isAllowedOptional(this._title), isAllowedNested(this._title)); if (!this._tag.name) { if (!isNameParameterRequired(this._title)) { return true; } // it's possible the name has already been parsed but interpreted as a type // it's also possible this is a sloppy declaration, in which case it will be // fixed at the end if (isParamTitle(this._title) && this._tag.type && this._tag.type.name) { this._extra.name = this._tag.type; this._tag.name = this._tag.type.name; this._tag.type = null; } else { if (!this.addError('Missing or invalid tag name')) { return false; } } } else { name = this._tag.name; if (name.charAt(0) === '[' && name.charAt(name.length - 1) === ']') { // extract the default value if there is one // example: @param {string} [somebody=John Doe] description assign = name.substring(1, name.length - 1).split('='); if (assign[1]) { this._tag['default'] = assign[1]; } this._tag.name = assign[0]; // convert to an optional type if (this._tag.type && this._tag.type.type !== 'OptionalType') { this._tag.type = { type: 'OptionalType', expression: this._tag.type }; } } } } return true; }; TagParser.prototype.parseDescription = function parseDescription() { var description = trim(sliceSource(source, index, this._last)); if (description) { if (/^-\s+/.test(description)) { description = description.substring(2); } this._tag.description = description; } return true; }; TagParser.prototype.parseCaption = function parseDescription() { var description = trim(sliceSource(source, index, this._last)); var captionStartTag = ''; var captionEndTag = ''; var captionStart = description.indexOf(captionStartTag); var captionEnd = description.indexOf(captionEndTag); if (captionStart >= 0 && captionEnd >= 0) { this._tag.caption = trim(description.substring(captionStart + captionStartTag.length, captionEnd)); this._tag.description = trim(description.substring(captionEnd + captionEndTag.length)); } else { this._tag.description = description; } return true; }; TagParser.prototype.parseKind = function parseKind() { var kind, kinds; kinds = { 'class': true, 'constant': true, 'event': true, 'external': true, 'file': true, 'function': true, 'member': true, 'mixin': true, 'module': true, 'namespace': true, 'typedef': true }; kind = trim(sliceSource(source, index, this._last)); this._tag.kind = kind; if (!hasOwnProperty(kinds, kind)) { if (!this.addError('Invalid kind name \'%0\'', kind)) { return false; } } return true; }; TagParser.prototype.parseAccess = function parseAccess() { var access; access = trim(sliceSource(source, index, this._last)); this._tag.access = access; if (access !== 'private' && access !== 'protected' && access !== 'public') { if (!this.addError('Invalid access name \'%0\'', access)) { return false; } } return true; }; TagParser.prototype.parseThis = function parseAccess() { // this name may be a name expression (e.g. {foo.bar}) // or a name path (e.g. foo.bar) var value = trim(sliceSource(source, index, this._last)); if (value && value.charAt(0) === '{') { var gotType = this.parseType(); if (gotType && this._tag.type.type === 'NameExpression') { this._tag.name = this._tag.type.name; return true; } else { return this.addError('Invalid name for this'); } } else { return this.parseNamePath(); } }; TagParser.prototype.parseVariation = function parseVariation() { var variation, text; text = trim(sliceSource(source, index, this._last)); variation = parseFloat(text, 10); this._tag.variation = variation; if (isNaN(variation)) { if (!this.addError('Invalid variation \'%0\'', text)) { return false; } } return true; }; TagParser.prototype.ensureEnd = function () { var shouldBeEmpty = trim(sliceSource(source, index, this._last)); if (shouldBeEmpty) { if (!this.addError('Unknown content \'%0\'', shouldBeEmpty)) { return false; } } return true; }; TagParser.prototype.epilogue = function epilogue() { var description; description = this._tag.description; // un-fix potentially sloppy declaration if (isAllowedOptional(this._title) && !this._tag.type && description && description.charAt(0) === '[') { this._tag.type = this._extra.name; if (!this._tag.name) { this._tag.name = undefined; } if (!sloppy) { if (!this.addError('Missing or invalid tag name')) { return false; } } } return true; }; Rules = { // http://usejsdoc.org/tags-access.html 'access': ['parseAccess'], // http://usejsdoc.org/tags-alias.html 'alias': ['parseNamePath', 'ensureEnd'], // http://usejsdoc.org/tags-augments.html 'augments': ['parseType', 'parseNamePathOptional', 'ensureEnd'], // http://usejsdoc.org/tags-constructor.html 'constructor': ['parseType', 'parseNamePathOptional', 'ensureEnd'], // Synonym: http://usejsdoc.org/tags-constructor.html 'class': ['parseType', 'parseNamePathOptional', 'ensureEnd'], // Synonym: http://usejsdoc.org/tags-extends.html 'extends': ['parseType', 'parseNamePathOptional', 'ensureEnd'], // http://usejsdoc.org/tags-example.html 'example': ['parseCaption'], // http://usejsdoc.org/tags-deprecated.html 'deprecated': ['parseDescription'], // http://usejsdoc.org/tags-global.html 'global': ['ensureEnd'], // http://usejsdoc.org/tags-inner.html 'inner': ['ensureEnd'], // http://usejsdoc.org/tags-instance.html 'instance': ['ensureEnd'], // http://usejsdoc.org/tags-kind.html 'kind': ['parseKind'], // http://usejsdoc.org/tags-mixes.html 'mixes': ['parseNamePath', 'ensureEnd'], // http://usejsdoc.org/tags-mixin.html 'mixin': ['parseNamePathOptional', 'ensureEnd'], // http://usejsdoc.org/tags-member.html 'member': ['parseType', 'parseNamePathOptional', 'ensureEnd'], // http://usejsdoc.org/tags-method.html 'method': ['parseNamePathOptional', 'ensureEnd'], // http://usejsdoc.org/tags-module.html 'module': ['parseType', 'parseNamePathOptional', 'ensureEnd'], // Synonym: http://usejsdoc.org/tags-method.html 'func': ['parseNamePathOptional', 'ensureEnd'], // Synonym: http://usejsdoc.org/tags-method.html 'function': ['parseNamePathOptional', 'ensureEnd'], // Synonym: http://usejsdoc.org/tags-member.html 'var': ['parseType', 'parseNamePathOptional', 'ensureEnd'], // http://usejsdoc.org/tags-name.html 'name': ['parseNamePath', 'ensureEnd'], // http://usejsdoc.org/tags-namespace.html 'namespace': ['parseType', 'parseNamePathOptional', 'ensureEnd'], // http://usejsdoc.org/tags-private.html 'private': ['parseType', 'parseDescription'], // http://usejsdoc.org/tags-protected.html 'protected': ['parseType', 'parseDescription'], // http://usejsdoc.org/tags-public.html 'public': ['parseType', 'parseDescription'], // http://usejsdoc.org/tags-readonly.html 'readonly': ['ensureEnd'], // http://usejsdoc.org/tags-requires.html 'requires': ['parseNamePath', 'ensureEnd'], // http://usejsdoc.org/tags-since.html 'since': ['parseDescription'], // http://usejsdoc.org/tags-static.html 'static': ['ensureEnd'], // http://usejsdoc.org/tags-summary.html 'summary': ['parseDescription'], // http://usejsdoc.org/tags-this.html 'this': ['parseThis', 'ensureEnd'], // http://usejsdoc.org/tags-todo.html 'todo': ['parseDescription'], // http://usejsdoc.org/tags-typedef.html 'typedef': ['parseType', 'parseNamePathOptional'], // http://usejsdoc.org/tags-variation.html 'variation': ['parseVariation'], // http://usejsdoc.org/tags-version.html 'version': ['parseDescription'] }; TagParser.prototype.parse = function parse() { var i, iz, sequences, method; // empty title if (!this._title) { if (!this.addError('Missing or invalid title')) { return null; } } // Seek to content last index. this._last = seekContent(this._title); if (hasOwnProperty(Rules, this._title)) { sequences = Rules[this._title]; } else { // default sequences sequences = ['parseType', 'parseName', 'parseDescription', 'epilogue']; } for (i = 0, iz = sequences.length; i < iz; ++i) { method = sequences[i]; if (!this[method]()) { return null; } } return this._tag; }; function parseTag(options) { var title, parser, tag; // skip to tag if (!skipToTag()) { return null; } // scan title title = scanTitle(); // construct tag parser parser = new TagParser(options, title); tag = parser.parse(); // Seek global index to end of this tag. while (index < parser._last) { advance(); } return tag; } // // Parse JSDoc // function scanJSDocDescription(preserveWhitespace) { var description = '', ch, atAllowed; atAllowed = true; while (index < length) { ch = source.charCodeAt(index); if (atAllowed && ch === 0x40 /* '@' */) { break; } if (esutils.code.isLineTerminator(ch)) { atAllowed = true; } else if (atAllowed && !esutils.code.isWhiteSpace(ch)) { atAllowed = false; } description += advance(); } return preserveWhitespace ? description : trim(description); } function parse(comment, options) { var tags = [], tag, description, interestingTags, i, iz; if (options === undefined) { options = {}; } if (typeof options.unwrap === 'boolean' && options.unwrap) { source = unwrapComment(comment); } else { source = comment; } // array of relevant tags if (options.tags) { if (isArray(options.tags)) { interestingTags = {}; for (i = 0, iz = options.tags.length; i < iz; i++) { if (typeof options.tags[i] === 'string') { interestingTags[options.tags[i]] = true; } else { utility.throwError('Invalid "tags" parameter: ' + options.tags); } } } else { utility.throwError('Invalid "tags" parameter: ' + options.tags); } } length = source.length; index = 0; lineNumber = 0; recoverable = options.recoverable; sloppy = options.sloppy; strict = options.strict; description = scanJSDocDescription(options.preserveWhitespace); while (true) { tag = parseTag(options); if (!tag) { break; } if (!interestingTags || interestingTags.hasOwnProperty(tag.title)) { tags.push(tag); } } return { description: description, tags: tags }; } exports.parse = parse; })(jsdoc = {}); exports.version = utility.VERSION; exports.parse = jsdoc.parse; exports.parseType = typed.parseType; exports.parseParamType = typed.parseParamType; exports.unwrapComment = unwrapComment; exports.Syntax = shallowCopy(typed.Syntax); exports.Error = utility.DoctrineError; exports.type = { Syntax: exports.Syntax, parseType: typed.parseType, parseParamType: typed.parseParamType, stringify: typed.stringify }; })(); /* vim: set sw=4 ts=4 et tw=80 : */ },{"./typed":3,"./utility":4,"esutils":11,"isarray":15}],3:[function(require,module,exports){ 'use strict'; /* * @fileoverview Type expression parser. * @author Yusuke Suzuki * @author Dan Tao * @author Andrew Eisenberg */ // "typed", the Type Expression Parser for doctrine. (function () { 'use strict'; var Syntax, Token, source, length, index, previous, token, value, esutils, utility; esutils = require('esutils'); utility = require('./utility'); Syntax = { NullableLiteral: 'NullableLiteral', AllLiteral: 'AllLiteral', NullLiteral: 'NullLiteral', UndefinedLiteral: 'UndefinedLiteral', VoidLiteral: 'VoidLiteral', UnionType: 'UnionType', ArrayType: 'ArrayType', RecordType: 'RecordType', FieldType: 'FieldType', FunctionType: 'FunctionType', ParameterType: 'ParameterType', RestType: 'RestType', NonNullableType: 'NonNullableType', OptionalType: 'OptionalType', NullableType: 'NullableType', NameExpression: 'NameExpression', TypeApplication: 'TypeApplication', StringLiteralType: 'StringLiteralType', NumericLiteralType: 'NumericLiteralType', BooleanLiteralType: 'BooleanLiteralType' }; Token = { ILLEGAL: 0, // ILLEGAL DOT_LT: 1, // .< REST: 2, // ... LT: 3, // < GT: 4, // > LPAREN: 5, // ( RPAREN: 6, // ) LBRACE: 7, // { RBRACE: 8, // } LBRACK: 9, // [ RBRACK: 10, // ] COMMA: 11, // , COLON: 12, // : STAR: 13, // * PIPE: 14, // | QUESTION: 15, // ? BANG: 16, // ! EQUAL: 17, // = NAME: 18, // name token STRING: 19, // string NUMBER: 20, // number EOF: 21 }; function isTypeName(ch) { return '><(){}[],:*|?!='.indexOf(String.fromCharCode(ch)) === -1 && !esutils.code.isWhiteSpace(ch) && !esutils.code.isLineTerminator(ch); } function Context(previous, index, token, value) { this._previous = previous; this._index = index; this._token = token; this._value = value; } Context.prototype.restore = function () { previous = this._previous; index = this._index; token = this._token; value = this._value; }; Context.save = function () { return new Context(previous, index, token, value); }; function advance() { var ch = source.charAt(index); index += 1; return ch; } function scanHexEscape(prefix) { var i, len, ch, code = 0; len = prefix === 'u' ? 4 : 2; for (i = 0; i < len; ++i) { if (index < length && esutils.code.isHexDigit(source.charCodeAt(index))) { ch = advance(); code = code * 16 + '0123456789abcdef'.indexOf(ch.toLowerCase()); } else { return ''; } } return String.fromCharCode(code); } function scanString() { var str = '', quote, ch, code, unescaped, restore; //TODO review removal octal = false quote = source.charAt(index); ++index; while (index < length) { ch = advance(); if (ch === quote) { quote = ''; break; } else if (ch === '\\') { ch = advance(); if (!esutils.code.isLineTerminator(ch.charCodeAt(0))) { switch (ch) { case 'n': str += '\n'; break; case 'r': str += '\r'; break; case 't': str += '\t'; break; case 'u': case 'x': restore = index; unescaped = scanHexEscape(ch); if (unescaped) { str += unescaped; } else { index = restore; str += ch; } break; case 'b': str += '\b'; break; case 'f': str += '\f'; break; case 'v': str += '\v'; break; default: if (esutils.code.isOctalDigit(ch.charCodeAt(0))) { code = '01234567'.indexOf(ch); // \0 is not octal escape sequence // Deprecating unused code. TODO review removal //if (code !== 0) { // octal = true; //} if (index < length && esutils.code.isOctalDigit(source.charCodeAt(index))) { //TODO Review Removal octal = true; code = code * 8 + '01234567'.indexOf(advance()); // 3 digits are only allowed when string starts // with 0, 1, 2, 3 if ('0123'.indexOf(ch) >= 0 && index < length && esutils.code.isOctalDigit(source.charCodeAt(index))) { code = code * 8 + '01234567'.indexOf(advance()); } } str += String.fromCharCode(code); } else { str += ch; } break; } } else { if (ch === '\r' && source.charCodeAt(index) === 0x0A /* '\n' */) { ++index; } } } else if (esutils.code.isLineTerminator(ch.charCodeAt(0))) { break; } else { str += ch; } } if (quote !== '') { utility.throwError('unexpected quote'); } value = str; return Token.STRING; } function scanNumber() { var number, ch; number = ''; ch = source.charCodeAt(index); if (ch !== 0x2E /* '.' */) { number = advance(); ch = source.charCodeAt(index); if (number === '0') { if (ch === 0x78 /* 'x' */ || ch === 0x58 /* 'X' */) { number += advance(); while (index < length) { ch = source.charCodeAt(index); if (!esutils.code.isHexDigit(ch)) { break; } number += advance(); } if (number.length <= 2) { // only 0x utility.throwError('unexpected token'); } if (index < length) { ch = source.charCodeAt(index); if (esutils.code.isIdentifierStartES5(ch)) { utility.throwError('unexpected token'); } } value = parseInt(number, 16); return Token.NUMBER; } if (esutils.code.isOctalDigit(ch)) { number += advance(); while (index < length) { ch = source.charCodeAt(index); if (!esutils.code.isOctalDigit(ch)) { break; } number += advance(); } if (index < length) { ch = source.charCodeAt(index); if (esutils.code.isIdentifierStartES5(ch) || esutils.code.isDecimalDigit(ch)) { utility.throwError('unexpected token'); } } value = parseInt(number, 8); return Token.NUMBER; } if (esutils.code.isDecimalDigit(ch)) { utility.throwError('unexpected token'); } } while (index < length) { ch = source.charCodeAt(index); if (!esutils.code.isDecimalDigit(ch)) { break; } number += advance(); } } if (ch === 0x2E /* '.' */) { number += advance(); while (index < length) { ch = source.charCodeAt(index); if (!esutils.code.isDecimalDigit(ch)) { break; } number += advance(); } } if (ch === 0x65 /* 'e' */ || ch === 0x45 /* 'E' */) { number += advance(); ch = source.charCodeAt(index); if (ch === 0x2B /* '+' */ || ch === 0x2D /* '-' */) { number += advance(); } ch = source.charCodeAt(index); if (esutils.code.isDecimalDigit(ch)) { number += advance(); while (index < length) { ch = source.charCodeAt(index); if (!esutils.code.isDecimalDigit(ch)) { break; } number += advance(); } } else { utility.throwError('unexpected token'); } } if (index < length) { ch = source.charCodeAt(index); if (esutils.code.isIdentifierStartES5(ch)) { utility.throwError('unexpected token'); } } value = parseFloat(number); return Token.NUMBER; } function scanTypeName() { var ch, ch2; value = advance(); while (index < length && isTypeName(source.charCodeAt(index))) { ch = source.charCodeAt(index); if (ch === 0x2E /* '.' */) { if (index + 1 >= length) { return Token.ILLEGAL; } ch2 = source.charCodeAt(index + 1); if (ch2 === 0x3C /* '<' */) { break; } } value += advance(); } return Token.NAME; } function next() { var ch; previous = index; while (index < length && esutils.code.isWhiteSpace(source.charCodeAt(index))) { advance(); } if (index >= length) { token = Token.EOF; return token; } ch = source.charCodeAt(index); switch (ch) { case 0x27: /* ''' */ case 0x22: /* '"' */ token = scanString(); return token; case 0x3A: /* ':' */ advance(); token = Token.COLON; return token; case 0x2C: /* ',' */ advance(); token = Token.COMMA; return token; case 0x28: /* '(' */ advance(); token = Token.LPAREN; return token; case 0x29: /* ')' */ advance(); token = Token.RPAREN; return token; case 0x5B: /* '[' */ advance(); token = Token.LBRACK; return token; case 0x5D: /* ']' */ advance(); token = Token.RBRACK; return token; case 0x7B: /* '{' */ advance(); token = Token.LBRACE; return token; case 0x7D: /* '}' */ advance(); token = Token.RBRACE; return token; case 0x2E: /* '.' */ if (index + 1 < length) { ch = source.charCodeAt(index + 1); if (ch === 0x3C /* '<' */) { advance(); // '.' advance(); // '<' token = Token.DOT_LT; return token; } if (ch === 0x2E /* '.' */ && index + 2 < length && source.charCodeAt(index + 2) === 0x2E /* '.' */) { advance(); // '.' advance(); // '.' advance(); // '.' token = Token.REST; return token; } if (esutils.code.isDecimalDigit(ch)) { token = scanNumber(); return token; } } token = Token.ILLEGAL; return token; case 0x3C: /* '<' */ advance(); token = Token.LT; return token; case 0x3E: /* '>' */ advance(); token = Token.GT; return token; case 0x2A: /* '*' */ advance(); token = Token.STAR; return token; case 0x7C: /* '|' */ advance(); token = Token.PIPE; return token; case 0x3F: /* '?' */ advance(); token = Token.QUESTION; return token; case 0x21: /* '!' */ advance(); token = Token.BANG; return token; case 0x3D: /* '=' */ advance(); token = Token.EQUAL; return token; case 0x2D: /* '-' */ token = scanNumber(); return token; default: if (esutils.code.isDecimalDigit(ch)) { token = scanNumber(); return token; } // type string permits following case, // // namespace.module.MyClass // // this reduced 1 token TK_NAME utility.assert(isTypeName(ch)); token = scanTypeName(); return token; } } function consume(target, text) { utility.assert(token === target, text || 'consumed token not matched'); next(); } function expect(target, message) { if (token !== target) { utility.throwError(message || 'unexpected token'); } next(); } // UnionType := '(' TypeUnionList ')' // // TypeUnionList := // <> // | NonemptyTypeUnionList // // NonemptyTypeUnionList := // TypeExpression // | TypeExpression '|' NonemptyTypeUnionList function parseUnionType() { var elements; consume(Token.LPAREN, 'UnionType should start with ('); elements = []; if (token !== Token.RPAREN) { while (true) { elements.push(parseTypeExpression()); if (token === Token.RPAREN) { break; } expect(Token.PIPE); } } consume(Token.RPAREN, 'UnionType should end with )'); return { type: Syntax.UnionType, elements: elements }; } // ArrayType := '[' ElementTypeList ']' // // ElementTypeList := // <> // | TypeExpression // | '...' TypeExpression // | TypeExpression ',' ElementTypeList function parseArrayType() { var elements; consume(Token.LBRACK, 'ArrayType should start with ['); elements = []; while (token !== Token.RBRACK) { if (token === Token.REST) { consume(Token.REST); elements.push({ type: Syntax.RestType, expression: parseTypeExpression() }); break; } else { elements.push(parseTypeExpression()); } if (token !== Token.RBRACK) { expect(Token.COMMA); } } expect(Token.RBRACK); return { type: Syntax.ArrayType, elements: elements }; } function parseFieldName() { var v = value; if (token === Token.NAME || token === Token.STRING) { next(); return v; } if (token === Token.NUMBER) { consume(Token.NUMBER); return String(v); } utility.throwError('unexpected token'); } // FieldType := // FieldName // | FieldName ':' TypeExpression // // FieldName := // NameExpression // | StringLiteral // | NumberLiteral // | ReservedIdentifier function parseFieldType() { var key; key = parseFieldName(); if (token === Token.COLON) { consume(Token.COLON); return { type: Syntax.FieldType, key: key, value: parseTypeExpression() }; } return { type: Syntax.FieldType, key: key, value: null }; } // RecordType := '{' FieldTypeList '}' // // FieldTypeList := // <> // | FieldType // | FieldType ',' FieldTypeList function parseRecordType() { var fields; consume(Token.LBRACE, 'RecordType should start with {'); fields = []; if (token === Token.COMMA) { consume(Token.COMMA); } else { while (token !== Token.RBRACE) { fields.push(parseFieldType()); if (token !== Token.RBRACE) { expect(Token.COMMA); } } } expect(Token.RBRACE); return { type: Syntax.RecordType, fields: fields }; } // NameExpression := // Identifier // | TagIdentifier ':' Identifier // // Tag identifier is one of "module", "external" or "event" // Identifier is the same as Token.NAME, including any dots, something like // namespace.module.MyClass function parseNameExpression() { var name = value; expect(Token.NAME); if (token === Token.COLON && (name === 'module' || name === 'external' || name === 'event')) { consume(Token.COLON); name += ':' + value; expect(Token.NAME); } return { type: Syntax.NameExpression, name: name }; } // TypeExpressionList := // TopLevelTypeExpression // | TopLevelTypeExpression ',' TypeExpressionList function parseTypeExpressionList() { var elements = []; elements.push(parseTop()); while (token === Token.COMMA) { consume(Token.COMMA); elements.push(parseTop()); } return elements; } // TypeName := // NameExpression // | NameExpression TypeApplication // // TypeApplication := // '.<' TypeExpressionList '>' // | '<' TypeExpressionList '>' // this is extension of doctrine function parseTypeName() { var expr, applications; expr = parseNameExpression(); if (token === Token.DOT_LT || token === Token.LT) { next(); applications = parseTypeExpressionList(); expect(Token.GT); return { type: Syntax.TypeApplication, expression: expr, applications: applications }; } return expr; } // ResultType := // <> // | ':' void // | ':' TypeExpression // // BNF is above // but, we remove <> pattern, so token is always TypeToken::COLON function parseResultType() { consume(Token.COLON, 'ResultType should start with :'); if (token === Token.NAME && value === 'void') { consume(Token.NAME); return { type: Syntax.VoidLiteral }; } return parseTypeExpression(); } // ParametersType := // RestParameterType // | NonRestParametersType // | NonRestParametersType ',' RestParameterType // // RestParameterType := // '...' // '...' Identifier // // NonRestParametersType := // ParameterType ',' NonRestParametersType // | ParameterType // | OptionalParametersType // // OptionalParametersType := // OptionalParameterType // | OptionalParameterType, OptionalParametersType // // OptionalParameterType := ParameterType= // // ParameterType := TypeExpression | Identifier ':' TypeExpression // // Identifier is "new" or "this" function parseParametersType() { var params = [], optionalSequence = false, expr, rest = false; while (token !== Token.RPAREN) { if (token === Token.REST) { // RestParameterType consume(Token.REST); rest = true; } expr = parseTypeExpression(); if (expr.type === Syntax.NameExpression && token === Token.COLON) { // Identifier ':' TypeExpression consume(Token.COLON); expr = { type: Syntax.ParameterType, name: expr.name, expression: parseTypeExpression() }; } if (token === Token.EQUAL) { consume(Token.EQUAL); expr = { type: Syntax.OptionalType, expression: expr }; optionalSequence = true; } else { if (optionalSequence) { utility.throwError('unexpected token'); } } if (rest) { expr = { type: Syntax.RestType, expression: expr }; } params.push(expr); if (token !== Token.RPAREN) { expect(Token.COMMA); } } return params; } // FunctionType := 'function' FunctionSignatureType // // FunctionSignatureType := // | TypeParameters '(' ')' ResultType // | TypeParameters '(' ParametersType ')' ResultType // | TypeParameters '(' 'this' ':' TypeName ')' ResultType // | TypeParameters '(' 'this' ':' TypeName ',' ParametersType ')' ResultType function parseFunctionType() { var isNew, thisBinding, params, result, fnType; utility.assert(token === Token.NAME && value === 'function', 'FunctionType should start with \'function\''); consume(Token.NAME); // Google Closure Compiler is not implementing TypeParameters. // So we do not. if we don't get '(', we see it as error. expect(Token.LPAREN); isNew = false; params = []; thisBinding = null; if (token !== Token.RPAREN) { // ParametersType or 'this' if (token === Token.NAME && (value === 'this' || value === 'new')) { // 'this' or 'new' // 'new' is Closure Compiler extension isNew = value === 'new'; consume(Token.NAME); expect(Token.COLON); thisBinding = parseTypeName(); if (token === Token.COMMA) { consume(Token.COMMA); params = parseParametersType(); } } else { params = parseParametersType(); } } expect(Token.RPAREN); result = null; if (token === Token.COLON) { result = parseResultType(); } fnType = { type: Syntax.FunctionType, params: params, result: result }; if (thisBinding) { // avoid adding null 'new' and 'this' properties fnType['this'] = thisBinding; if (isNew) { fnType['new'] = true; } } return fnType; } // BasicTypeExpression := // '*' // | 'null' // | 'undefined' // | TypeName // | FunctionType // | UnionType // | RecordType // | ArrayType function parseBasicTypeExpression() { var context; switch (token) { case Token.STAR: consume(Token.STAR); return { type: Syntax.AllLiteral }; case Token.LPAREN: return parseUnionType(); case Token.LBRACK: return parseArrayType(); case Token.LBRACE: return parseRecordType(); case Token.NAME: if (value === 'null') { consume(Token.NAME); return { type: Syntax.NullLiteral }; } if (value === 'undefined') { consume(Token.NAME); return { type: Syntax.UndefinedLiteral }; } if (value === 'true' || value === 'false') { consume(Token.NAME); return { type: Syntax.BooleanLiteralType, value: value === 'true' }; } context = Context.save(); if (value === 'function') { try { return parseFunctionType(); } catch (e) { context.restore(); } } return parseTypeName(); case Token.STRING: next(); return { type: Syntax.StringLiteralType, value: value }; case Token.NUMBER: next(); return { type: Syntax.NumericLiteralType, value: value }; default: utility.throwError('unexpected token'); } } // TypeExpression := // BasicTypeExpression // | '?' BasicTypeExpression // | '!' BasicTypeExpression // | BasicTypeExpression '?' // | BasicTypeExpression '!' // | '?' // | BasicTypeExpression '[]' function parseTypeExpression() { var expr; if (token === Token.QUESTION) { consume(Token.QUESTION); if (token === Token.COMMA || token === Token.EQUAL || token === Token.RBRACE || token === Token.RPAREN || token === Token.PIPE || token === Token.EOF || token === Token.RBRACK || token === Token.GT) { return { type: Syntax.NullableLiteral }; } return { type: Syntax.NullableType, expression: parseBasicTypeExpression(), prefix: true }; } if (token === Token.BANG) { consume(Token.BANG); return { type: Syntax.NonNullableType, expression: parseBasicTypeExpression(), prefix: true }; } expr = parseBasicTypeExpression(); if (token === Token.BANG) { consume(Token.BANG); return { type: Syntax.NonNullableType, expression: expr, prefix: false }; } if (token === Token.QUESTION) { consume(Token.QUESTION); return { type: Syntax.NullableType, expression: expr, prefix: false }; } if (token === Token.LBRACK) { consume(Token.LBRACK); expect(Token.RBRACK, 'expected an array-style type declaration (' + value + '[])'); return { type: Syntax.TypeApplication, expression: { type: Syntax.NameExpression, name: 'Array' }, applications: [expr] }; } return expr; } // TopLevelTypeExpression := // TypeExpression // | TypeUnionList // // This rule is Google Closure Compiler extension, not ES4 // like, // { number | string } // If strict to ES4, we should write it as // { (number|string) } function parseTop() { var expr, elements; expr = parseTypeExpression(); if (token !== Token.PIPE) { return expr; } elements = [expr]; consume(Token.PIPE); while (true) { elements.push(parseTypeExpression()); if (token !== Token.PIPE) { break; } consume(Token.PIPE); } return { type: Syntax.UnionType, elements: elements }; } function parseTopParamType() { var expr; if (token === Token.REST) { consume(Token.REST); return { type: Syntax.RestType, expression: parseTop() }; } expr = parseTop(); if (token === Token.EQUAL) { consume(Token.EQUAL); return { type: Syntax.OptionalType, expression: expr }; } return expr; } function parseType(src, opt) { var expr; source = src; length = source.length; index = 0; previous = 0; next(); expr = parseTop(); if (opt && opt.midstream) { return { expression: expr, index: previous }; } if (token !== Token.EOF) { utility.throwError('not reach to EOF'); } return expr; } function parseParamType(src, opt) { var expr; source = src; length = source.length; index = 0; previous = 0; next(); expr = parseTopParamType(); if (opt && opt.midstream) { return { expression: expr, index: previous }; } if (token !== Token.EOF) { utility.throwError('not reach to EOF'); } return expr; } function stringifyImpl(node, compact, topLevel) { var result, i, iz; switch (node.type) { case Syntax.NullableLiteral: result = '?'; break; case Syntax.AllLiteral: result = '*'; break; case Syntax.NullLiteral: result = 'null'; break; case Syntax.UndefinedLiteral: result = 'undefined'; break; case Syntax.VoidLiteral: result = 'void'; break; case Syntax.UnionType: if (!topLevel) { result = '('; } else { result = ''; } for (i = 0, iz = node.elements.length; i < iz; ++i) { result += stringifyImpl(node.elements[i], compact); if (i + 1 !== iz) { result += '|'; } } if (!topLevel) { result += ')'; } break; case Syntax.ArrayType: result = '['; for (i = 0, iz = node.elements.length; i < iz; ++i) { result += stringifyImpl(node.elements[i], compact); if (i + 1 !== iz) { result += compact ? ',' : ', '; } } result += ']'; break; case Syntax.RecordType: result = '{'; for (i = 0, iz = node.fields.length; i < iz; ++i) { result += stringifyImpl(node.fields[i], compact); if (i + 1 !== iz) { result += compact ? ',' : ', '; } } result += '}'; break; case Syntax.FieldType: if (node.value) { result = node.key + (compact ? ':' : ': ') + stringifyImpl(node.value, compact); } else { result = node.key; } break; case Syntax.FunctionType: result = compact ? 'function(' : 'function ('; if (node['this']) { if (node['new']) { result += compact ? 'new:' : 'new: '; } else { result += compact ? 'this:' : 'this: '; } result += stringifyImpl(node['this'], compact); if (node.params.length !== 0) { result += compact ? ',' : ', '; } } for (i = 0, iz = node.params.length; i < iz; ++i) { result += stringifyImpl(node.params[i], compact); if (i + 1 !== iz) { result += compact ? ',' : ', '; } } result += ')'; if (node.result) { result += (compact ? ':' : ': ') + stringifyImpl(node.result, compact); } break; case Syntax.ParameterType: result = node.name + (compact ? ':' : ': ') + stringifyImpl(node.expression, compact); break; case Syntax.RestType: result = '...'; if (node.expression) { result += stringifyImpl(node.expression, compact); } break; case Syntax.NonNullableType: if (node.prefix) { result = '!' + stringifyImpl(node.expression, compact); } else { result = stringifyImpl(node.expression, compact) + '!'; } break; case Syntax.OptionalType: result = stringifyImpl(node.expression, compact) + '='; break; case Syntax.NullableType: if (node.prefix) { result = '?' + stringifyImpl(node.expression, compact); } else { result = stringifyImpl(node.expression, compact) + '?'; } break; case Syntax.NameExpression: result = node.name; break; case Syntax.TypeApplication: result = stringifyImpl(node.expression, compact) + '.<'; for (i = 0, iz = node.applications.length; i < iz; ++i) { result += stringifyImpl(node.applications[i], compact); if (i + 1 !== iz) { result += compact ? ',' : ', '; } } result += '>'; break; case Syntax.StringLiteralType: result = '"' + node.value + '"'; break; case Syntax.NumericLiteralType: result = String(node.value); break; case Syntax.BooleanLiteralType: result = String(node.value); break; default: utility.throwError('Unknown type ' + node.type); } return result; } function stringify(node, options) { if (options == null) { options = {}; } return stringifyImpl(node, options.compact, options.topLevel); } exports.parseType = parseType; exports.parseParamType = parseParamType; exports.stringify = stringify; exports.Syntax = Syntax; })(); /* vim: set sw=4 ts=4 et tw=80 : */ },{"./utility":4,"esutils":11}],4:[function(require,module,exports){ 'use strict'; /* * @fileoverview Utilities for Doctrine * @author Yusuke Suzuki */ (function () { 'use strict'; var VERSION; VERSION = require('../package.json').version; exports.VERSION = VERSION; function DoctrineError(message) { this.name = 'DoctrineError'; this.message = message; } DoctrineError.prototype = function () { var Middle = function Middle() {}; Middle.prototype = Error.prototype; return new Middle(); }(); DoctrineError.prototype.constructor = DoctrineError; exports.DoctrineError = DoctrineError; function throwError(message) { throw new DoctrineError(message); } exports.throwError = throwError; exports.assert = require('assert'); })(); /* vim: set sw=4 ts=4 et tw=80 : */ },{"../package.json":5,"assert":1}],5:[function(require,module,exports){ module.exports={ "_args": [ [ { "raw": "doctrine@^2.0.0", "scope": null, "escapedName": "doctrine", "name": "doctrine", "rawSpec": "^2.0.0", "spec": ">=2.0.0 <3.0.0", "type": "range" }, "C:\\eslintgithub\\eslint" ] ], "_from": "doctrine@>=2.0.0 <3.0.0", "_id": "doctrine@2.0.0", "_inCache": true, "_location": "/doctrine", "_nodeVersion": "4.4.2", "_npmOperationalInternal": { "host": "packages-12-west.internal.npmjs.com", "tmp": "tmp/doctrine-2.0.0.tgz_1479232728285_0.34204454137943685" }, "_npmUser": { "name": "nzakas", "email": "nicholas@nczconsulting.com" }, "_npmVersion": "2.15.0", "_phantomChildren": {}, "_requested": { "raw": "doctrine@^2.0.0", "scope": null, "escapedName": "doctrine", "name": "doctrine", "rawSpec": "^2.0.0", "spec": ">=2.0.0 <3.0.0", "type": "range" }, "_requiredBy": [ "/" ], "_resolved": "https://registry.npmjs.org/doctrine/-/doctrine-2.0.0.tgz", "_shasum": "c73d8d2909d22291e1a007a395804da8b665fe63", "_shrinkwrap": null, "_spec": "doctrine@^2.0.0", "_where": "C:\\eslintgithub\\eslint", "bugs": { "url": "https://github.com/eslint/doctrine/issues" }, "dependencies": { "esutils": "^2.0.2", "isarray": "^1.0.0" }, "description": "JSDoc parser", "devDependencies": { "coveralls": "^2.11.2", "dateformat": "^1.0.11", "eslint": "^1.10.3", "eslint-release": "^0.10.0", "istanbul": "^0.4.1", "linefix": "^0.1.1", "mocha": "^2.3.3", "npm-license": "^0.3.1", "semver": "^5.0.3", "shelljs": "^0.5.3", "shelljs-nodecli": "^0.1.1", "should": "^5.0.1" }, "directories": { "lib": "./lib" }, "dist": { "shasum": "c73d8d2909d22291e1a007a395804da8b665fe63", "tarball": "https://registry.npmjs.org/doctrine/-/doctrine-2.0.0.tgz" }, "engines": { "node": ">=0.10.0" }, "files": [ "lib", "LICENSE.BSD", "LICENSE.closure-compiler", "LICENSE.esprima", "README.md" ], "gitHead": "46c600f27f54b3ab6b0b8a9ac9f97c807ffa95ef", "homepage": "https://github.com/eslint/doctrine", "license": "Apache-2.0", "main": "lib/doctrine.js", "maintainers": [ { "name": "constellation", "email": "utatane.tea@gmail.com" }, { "name": "eslint", "email": "nicholas+eslint@nczconsulting.com" }, { "name": "nzakas", "email": "nicholas@nczconsulting.com" } ], "name": "doctrine", "optionalDependencies": {}, "readme": "ERROR: No README data found!", "repository": { "type": "git", "url": "git+https://github.com/eslint/doctrine.git" }, "scripts": { "alpharelease": "eslint-prerelease alpha", "betarelease": "eslint-prerelease beta", "ci-release": "eslint-ci-release", "lint": "eslint lib/", "release": "eslint-release", "test": "npm run lint && node Makefile.js test" }, "version": "2.0.0" } },{}],6:[function(require,module,exports){ 'use strict'; var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; /* Copyright (C) 2012-2013 Yusuke Suzuki Copyright (C) 2012 Ariya Hidayat Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ /*jslint vars:false, bitwise:true*/ /*jshint indent:4*/ /*global exports:true*/ (function clone(exports) { 'use strict'; var Syntax, isArray, VisitorOption, VisitorKeys, objectCreate, objectKeys, BREAK, SKIP, REMOVE; function ignoreJSHintError() {} isArray = Array.isArray; if (!isArray) { isArray = function isArray(array) { return Object.prototype.toString.call(array) === '[object Array]'; }; } function deepCopy(obj) { var ret = {}, key, val; for (key in obj) { if (obj.hasOwnProperty(key)) { val = obj[key]; if ((typeof val === 'undefined' ? 'undefined' : _typeof(val)) === 'object' && val !== null) { ret[key] = deepCopy(val); } else { ret[key] = val; } } } return ret; } function shallowCopy(obj) { var ret = {}, key; for (key in obj) { if (obj.hasOwnProperty(key)) { ret[key] = obj[key]; } } return ret; } ignoreJSHintError(shallowCopy); // based on LLVM libc++ upper_bound / lower_bound // MIT License function upperBound(array, func) { var diff, len, i, current; len = array.length; i = 0; while (len) { diff = len >>> 1; current = i + diff; if (func(array[current])) { len = diff; } else { i = current + 1; len -= diff + 1; } } return i; } function lowerBound(array, func) { var diff, len, i, current; len = array.length; i = 0; while (len) { diff = len >>> 1; current = i + diff; if (func(array[current])) { i = current + 1; len -= diff + 1; } else { len = diff; } } return i; } ignoreJSHintError(lowerBound); objectCreate = Object.create || function () { function F() {} return function (o) { F.prototype = o; return new F(); }; }(); objectKeys = Object.keys || function (o) { var keys = [], key; for (key in o) { keys.push(key); } return keys; }; function extend(to, from) { var keys = objectKeys(from), key, i, len; for (i = 0, len = keys.length; i < len; i += 1) { key = keys[i]; to[key] = from[key]; } return to; } Syntax = { AssignmentExpression: 'AssignmentExpression', AssignmentPattern: 'AssignmentPattern', ArrayExpression: 'ArrayExpression', ArrayPattern: 'ArrayPattern', ArrowFunctionExpression: 'ArrowFunctionExpression', AwaitExpression: 'AwaitExpression', // CAUTION: It's deferred to ES7. BlockStatement: 'BlockStatement', BinaryExpression: 'BinaryExpression', BreakStatement: 'BreakStatement', CallExpression: 'CallExpression', CatchClause: 'CatchClause', ClassBody: 'ClassBody', ClassDeclaration: 'ClassDeclaration', ClassExpression: 'ClassExpression', ComprehensionBlock: 'ComprehensionBlock', // CAUTION: It's deferred to ES7. ComprehensionExpression: 'ComprehensionExpression', // CAUTION: It's deferred to ES7. ConditionalExpression: 'ConditionalExpression', ContinueStatement: 'ContinueStatement', DebuggerStatement: 'DebuggerStatement', DirectiveStatement: 'DirectiveStatement', DoWhileStatement: 'DoWhileStatement', EmptyStatement: 'EmptyStatement', ExportAllDeclaration: 'ExportAllDeclaration', ExportDefaultDeclaration: 'ExportDefaultDeclaration', ExportNamedDeclaration: 'ExportNamedDeclaration', ExportSpecifier: 'ExportSpecifier', ExpressionStatement: 'ExpressionStatement', ForStatement: 'ForStatement', ForInStatement: 'ForInStatement', ForOfStatement: 'ForOfStatement', FunctionDeclaration: 'FunctionDeclaration', FunctionExpression: 'FunctionExpression', GeneratorExpression: 'GeneratorExpression', // CAUTION: It's deferred to ES7. Identifier: 'Identifier', IfStatement: 'IfStatement', ImportDeclaration: 'ImportDeclaration', ImportDefaultSpecifier: 'ImportDefaultSpecifier', ImportNamespaceSpecifier: 'ImportNamespaceSpecifier', ImportSpecifier: 'ImportSpecifier', Literal: 'Literal', LabeledStatement: 'LabeledStatement', LogicalExpression: 'LogicalExpression', MemberExpression: 'MemberExpression', MetaProperty: 'MetaProperty', MethodDefinition: 'MethodDefinition', ModuleSpecifier: 'ModuleSpecifier', NewExpression: 'NewExpression', ObjectExpression: 'ObjectExpression', ObjectPattern: 'ObjectPattern', Program: 'Program', Property: 'Property', RestElement: 'RestElement', ReturnStatement: 'ReturnStatement', SequenceExpression: 'SequenceExpression', SpreadElement: 'SpreadElement', Super: 'Super', SwitchStatement: 'SwitchStatement', SwitchCase: 'SwitchCase', TaggedTemplateExpression: 'TaggedTemplateExpression', TemplateElement: 'TemplateElement', TemplateLiteral: 'TemplateLiteral', ThisExpression: 'ThisExpression', ThrowStatement: 'ThrowStatement', TryStatement: 'TryStatement', UnaryExpression: 'UnaryExpression', UpdateExpression: 'UpdateExpression', VariableDeclaration: 'VariableDeclaration', VariableDeclarator: 'VariableDeclarator', WhileStatement: 'WhileStatement', WithStatement: 'WithStatement', YieldExpression: 'YieldExpression' }; VisitorKeys = { AssignmentExpression: ['left', 'right'], AssignmentPattern: ['left', 'right'], ArrayExpression: ['elements'], ArrayPattern: ['elements'], ArrowFunctionExpression: ['params', 'body'], AwaitExpression: ['argument'], // CAUTION: It's deferred to ES7. BlockStatement: ['body'], BinaryExpression: ['left', 'right'], BreakStatement: ['label'], CallExpression: ['callee', 'arguments'], CatchClause: ['param', 'body'], ClassBody: ['body'], ClassDeclaration: ['id', 'superClass', 'body'], ClassExpression: ['id', 'superClass', 'body'], ComprehensionBlock: ['left', 'right'], // CAUTION: It's deferred to ES7. ComprehensionExpression: ['blocks', 'filter', 'body'], // CAUTION: It's deferred to ES7. ConditionalExpression: ['test', 'consequent', 'alternate'], ContinueStatement: ['label'], DebuggerStatement: [], DirectiveStatement: [], DoWhileStatement: ['body', 'test'], EmptyStatement: [], ExportAllDeclaration: ['source'], ExportDefaultDeclaration: ['declaration'], ExportNamedDeclaration: ['declaration', 'specifiers', 'source'], ExportSpecifier: ['exported', 'local'], ExpressionStatement: ['expression'], ForStatement: ['init', 'test', 'update', 'body'], ForInStatement: ['left', 'right', 'body'], ForOfStatement: ['left', 'right', 'body'], FunctionDeclaration: ['id', 'params', 'body'], FunctionExpression: ['id', 'params', 'body'], GeneratorExpression: ['blocks', 'filter', 'body'], // CAUTION: It's deferred to ES7. Identifier: [], IfStatement: ['test', 'consequent', 'alternate'], ImportDeclaration: ['specifiers', 'source'], ImportDefaultSpecifier: ['local'], ImportNamespaceSpecifier: ['local'], ImportSpecifier: ['imported', 'local'], Literal: [], LabeledStatement: ['label', 'body'], LogicalExpression: ['left', 'right'], MemberExpression: ['object', 'property'], MetaProperty: ['meta', 'property'], MethodDefinition: ['key', 'value'], ModuleSpecifier: [], NewExpression: ['callee', 'arguments'], ObjectExpression: ['properties'], ObjectPattern: ['properties'], Program: ['body'], Property: ['key', 'value'], RestElement: ['argument'], ReturnStatement: ['argument'], SequenceExpression: ['expressions'], SpreadElement: ['argument'], Super: [], SwitchStatement: ['discriminant', 'cases'], SwitchCase: ['test', 'consequent'], TaggedTemplateExpression: ['tag', 'quasi'], TemplateElement: [], TemplateLiteral: ['quasis', 'expressions'], ThisExpression: [], ThrowStatement: ['argument'], TryStatement: ['block', 'handler', 'finalizer'], UnaryExpression: ['argument'], UpdateExpression: ['argument'], VariableDeclaration: ['declarations'], VariableDeclarator: ['id', 'init'], WhileStatement: ['test', 'body'], WithStatement: ['object', 'body'], YieldExpression: ['argument'] }; // unique id BREAK = {}; SKIP = {}; REMOVE = {}; VisitorOption = { Break: BREAK, Skip: SKIP, Remove: REMOVE }; function Reference(parent, key) { this.parent = parent; this.key = key; } Reference.prototype.replace = function replace(node) { this.parent[this.key] = node; }; Reference.prototype.remove = function remove() { if (isArray(this.parent)) { this.parent.splice(this.key, 1); return true; } else { this.replace(null); return false; } }; function Element(node, path, wrap, ref) { this.node = node; this.path = path; this.wrap = wrap; this.ref = ref; } function Controller() {} // API: // return property path array from root to current node Controller.prototype.path = function path() { var i, iz, j, jz, result, element; function addToPath(result, path) { if (isArray(path)) { for (j = 0, jz = path.length; j < jz; ++j) { result.push(path[j]); } } else { result.push(path); } } // root node if (!this.__current.path) { return null; } // first node is sentinel, second node is root element result = []; for (i = 2, iz = this.__leavelist.length; i < iz; ++i) { element = this.__leavelist[i]; addToPath(result, element.path); } addToPath(result, this.__current.path); return result; }; // API: // return type of current node Controller.prototype.type = function () { var node = this.current(); return node.type || this.__current.wrap; }; // API: // return array of parent elements Controller.prototype.parents = function parents() { var i, iz, result; // first node is sentinel result = []; for (i = 1, iz = this.__leavelist.length; i < iz; ++i) { result.push(this.__leavelist[i].node); } return result; }; // API: // return current node Controller.prototype.current = function current() { return this.__current.node; }; Controller.prototype.__execute = function __execute(callback, element) { var previous, result; result = undefined; previous = this.__current; this.__current = element; this.__state = null; if (callback) { result = callback.call(this, element.node, this.__leavelist[this.__leavelist.length - 1].node); } this.__current = previous; return result; }; // API: // notify control skip / break Controller.prototype.notify = function notify(flag) { this.__state = flag; }; // API: // skip child nodes of current node Controller.prototype.skip = function () { this.notify(SKIP); }; // API: // break traversals Controller.prototype['break'] = function () { this.notify(BREAK); }; // API: // remove node Controller.prototype.remove = function () { this.notify(REMOVE); }; Controller.prototype.__initialize = function (root, visitor) { this.visitor = visitor; this.root = root; this.__worklist = []; this.__leavelist = []; this.__current = null; this.__state = null; this.__fallback = null; if (visitor.fallback === 'iteration') { this.__fallback = objectKeys; } else if (typeof visitor.fallback === 'function') { this.__fallback = visitor.fallback; } this.__keys = VisitorKeys; if (visitor.keys) { this.__keys = extend(objectCreate(this.__keys), visitor.keys); } }; function isNode(node) { if (node == null) { return false; } return (typeof node === 'undefined' ? 'undefined' : _typeof(node)) === 'object' && typeof node.type === 'string'; } function isProperty(nodeType, key) { return (nodeType === Syntax.ObjectExpression || nodeType === Syntax.ObjectPattern) && 'properties' === key; } Controller.prototype.traverse = function traverse(root, visitor) { var worklist, leavelist, element, node, nodeType, ret, key, current, current2, candidates, candidate, sentinel; this.__initialize(root, visitor); sentinel = {}; // reference worklist = this.__worklist; leavelist = this.__leavelist; // initialize worklist.push(new Element(root, null, null, null)); leavelist.push(new Element(null, null, null, null)); while (worklist.length) { element = worklist.pop(); if (element === sentinel) { element = leavelist.pop(); ret = this.__execute(visitor.leave, element); if (this.__state === BREAK || ret === BREAK) { return; } continue; } if (element.node) { ret = this.__execute(visitor.enter, element); if (this.__state === BREAK || ret === BREAK) { return; } worklist.push(sentinel); leavelist.push(element); if (this.__state === SKIP || ret === SKIP) { continue; } node = element.node; nodeType = node.type || element.wrap; candidates = this.__keys[nodeType]; if (!candidates) { if (this.__fallback) { candidates = this.__fallback(node); } else { throw new Error('Unknown node type ' + nodeType + '.'); } } current = candidates.length; while ((current -= 1) >= 0) { key = candidates[current]; candidate = node[key]; if (!candidate) { continue; } if (isArray(candidate)) { current2 = candidate.length; while ((current2 -= 1) >= 0) { if (!candidate[current2]) { continue; } if (isProperty(nodeType, candidates[current])) { element = new Element(candidate[current2], [key, current2], 'Property', null); } else if (isNode(candidate[current2])) { element = new Element(candidate[current2], [key, current2], null, null); } else { continue; } worklist.push(element); } } else if (isNode(candidate)) { worklist.push(new Element(candidate, key, null, null)); } } } } }; Controller.prototype.replace = function replace(root, visitor) { var worklist, leavelist, node, nodeType, target, element, current, current2, candidates, candidate, sentinel, outer, key; function removeElem(element) { var i, key, nextElem, parent; if (element.ref.remove()) { // When the reference is an element of an array. key = element.ref.key; parent = element.ref.parent; // If removed from array, then decrease following items' keys. i = worklist.length; while (i--) { nextElem = worklist[i]; if (nextElem.ref && nextElem.ref.parent === parent) { if (nextElem.ref.key < key) { break; } --nextElem.ref.key; } } } } this.__initialize(root, visitor); sentinel = {}; // reference worklist = this.__worklist; leavelist = this.__leavelist; // initialize outer = { root: root }; element = new Element(root, null, null, new Reference(outer, 'root')); worklist.push(element); leavelist.push(element); while (worklist.length) { element = worklist.pop(); if (element === sentinel) { element = leavelist.pop(); target = this.__execute(visitor.leave, element); // node may be replaced with null, // so distinguish between undefined and null in this place if (target !== undefined && target !== BREAK && target !== SKIP && target !== REMOVE) { // replace element.ref.replace(target); } if (this.__state === REMOVE || target === REMOVE) { removeElem(element); } if (this.__state === BREAK || target === BREAK) { return outer.root; } continue; } target = this.__execute(visitor.enter, element); // node may be replaced with null, // so distinguish between undefined and null in this place if (target !== undefined && target !== BREAK && target !== SKIP && target !== REMOVE) { // replace element.ref.replace(target); element.node = target; } if (this.__state === REMOVE || target === REMOVE) { removeElem(element); element.node = null; } if (this.__state === BREAK || target === BREAK) { return outer.root; } // node may be null node = element.node; if (!node) { continue; } worklist.push(sentinel); leavelist.push(element); if (this.__state === SKIP || target === SKIP) { continue; } nodeType = node.type || element.wrap; candidates = this.__keys[nodeType]; if (!candidates) { if (this.__fallback) { candidates = this.__fallback(node); } else { throw new Error('Unknown node type ' + nodeType + '.'); } } current = candidates.length; while ((current -= 1) >= 0) { key = candidates[current]; candidate = node[key]; if (!candidate) { continue; } if (isArray(candidate)) { current2 = candidate.length; while ((current2 -= 1) >= 0) { if (!candidate[current2]) { continue; } if (isProperty(nodeType, candidates[current])) { element = new Element(candidate[current2], [key, current2], 'Property', new Reference(candidate, current2)); } else if (isNode(candidate[current2])) { element = new Element(candidate[current2], [key, current2], null, new Reference(candidate, current2)); } else { continue; } worklist.push(element); } } else if (isNode(candidate)) { worklist.push(new Element(candidate, key, null, new Reference(node, key))); } } } return outer.root; }; function traverse(root, visitor) { var controller = new Controller(); return controller.traverse(root, visitor); } function replace(root, visitor) { var controller = new Controller(); return controller.replace(root, visitor); } function extendCommentRange(comment, tokens) { var target; target = upperBound(tokens, function search(token) { return token.range[0] > comment.range[0]; }); comment.extendedRange = [comment.range[0], comment.range[1]]; if (target !== tokens.length) { comment.extendedRange[1] = tokens[target].range[0]; } target -= 1; if (target >= 0) { comment.extendedRange[0] = tokens[target].range[1]; } return comment; } function attachComments(tree, providedComments, tokens) { // At first, we should calculate extended comment ranges. var comments = [], comment, len, i, cursor; if (!tree.range) { throw new Error('attachComments needs range information'); } // tokens array is empty, we attach comments to tree as 'leadingComments' if (!tokens.length) { if (providedComments.length) { for (i = 0, len = providedComments.length; i < len; i += 1) { comment = deepCopy(providedComments[i]); comment.extendedRange = [0, tree.range[0]]; comments.push(comment); } tree.leadingComments = comments; } return tree; } for (i = 0, len = providedComments.length; i < len; i += 1) { comments.push(extendCommentRange(deepCopy(providedComments[i]), tokens)); } // This is based on John Freeman's implementation. cursor = 0; traverse(tree, { enter: function enter(node) { var comment; while (cursor < comments.length) { comment = comments[cursor]; if (comment.extendedRange[1] > node.range[0]) { break; } if (comment.extendedRange[1] === node.range[0]) { if (!node.leadingComments) { node.leadingComments = []; } node.leadingComments.push(comment); comments.splice(cursor, 1); } else { cursor += 1; } } // already out of owned node if (cursor === comments.length) { return VisitorOption.Break; } if (comments[cursor].extendedRange[0] > node.range[1]) { return VisitorOption.Skip; } } }); cursor = 0; traverse(tree, { leave: function leave(node) { var comment; while (cursor < comments.length) { comment = comments[cursor]; if (node.range[1] < comment.extendedRange[0]) { break; } if (node.range[1] === comment.extendedRange[0]) { if (!node.trailingComments) { node.trailingComments = []; } node.trailingComments.push(comment); comments.splice(cursor, 1); } else { cursor += 1; } } // already out of owned node if (cursor === comments.length) { return VisitorOption.Break; } if (comments[cursor].extendedRange[0] > node.range[1]) { return VisitorOption.Skip; } } }); return tree; } exports.version = require('./package.json').version; exports.Syntax = Syntax; exports.traverse = traverse; exports.replace = replace; exports.attachComments = attachComments; exports.VisitorKeys = VisitorKeys; exports.VisitorOption = VisitorOption; exports.Controller = Controller; exports.cloneEnvironment = function () { return clone({}); }; return exports; })(exports); /* vim: set sw=4 ts=4 et tw=80 : */ },{"./package.json":7}],7:[function(require,module,exports){ module.exports={ "_args": [ [ { "raw": "estraverse@^4.2.0", "scope": null, "escapedName": "estraverse", "name": "estraverse", "rawSpec": "^4.2.0", "spec": ">=4.2.0 <5.0.0", "type": "range" }, "C:\\eslintgithub\\eslint" ] ], "_from": "estraverse@>=4.2.0 <5.0.0", "_id": "estraverse@4.2.0", "_inCache": true, "_location": "/estraverse", "_nodeVersion": "0.12.9", "_npmOperationalInternal": { "host": "packages-12-west.internal.npmjs.com", "tmp": "tmp/estraverse-4.2.0.tgz_1457646738925_0.7118953282479197" }, "_npmUser": { "name": "nzakas", "email": "nicholas@nczconsulting.com" }, "_npmVersion": "2.14.9", "_phantomChildren": {}, "_requested": { "raw": "estraverse@^4.2.0", "scope": null, "escapedName": "estraverse", "name": "estraverse", "rawSpec": "^4.2.0", "spec": ">=4.2.0 <5.0.0", "type": "range" }, "_requiredBy": [ "/", "/eslint-scope", "/esquery" ], "_resolved": "https://registry.npmjs.org/estraverse/-/estraverse-4.2.0.tgz", "_shasum": "0dee3fed31fcd469618ce7342099fc1afa0bdb13", "_shrinkwrap": null, "_spec": "estraverse@^4.2.0", "_where": "C:\\eslintgithub\\eslint", "bugs": { "url": "https://github.com/estools/estraverse/issues" }, "dependencies": {}, "description": "ECMAScript JS AST traversal functions", "devDependencies": { "babel-preset-es2015": "^6.3.13", "babel-register": "^6.3.13", "chai": "^2.1.1", "espree": "^1.11.0", "gulp": "^3.8.10", "gulp-bump": "^0.2.2", "gulp-filter": "^2.0.0", "gulp-git": "^1.0.1", "gulp-tag-version": "^1.2.1", "jshint": "^2.5.6", "mocha": "^2.1.0" }, "directories": {}, "dist": { "shasum": "0dee3fed31fcd469618ce7342099fc1afa0bdb13", "tarball": "https://registry.npmjs.org/estraverse/-/estraverse-4.2.0.tgz" }, "engines": { "node": ">=0.10.0" }, "gitHead": "6f6a4e99653908e859c7c10d04d9518bf4844ede", "homepage": "https://github.com/estools/estraverse", "license": "BSD-2-Clause", "main": "estraverse.js", "maintainers": [ { "name": "constellation", "email": "utatane.tea@gmail.com" }, { "name": "michaelficarra", "email": "npm@michael.ficarra.me" }, { "name": "nzakas", "email": "nicholas@nczconsulting.com" } ], "name": "estraverse", "optionalDependencies": {}, "readme": "ERROR: No README data found!", "repository": { "type": "git", "url": "git+ssh://git@github.com/estools/estraverse.git" }, "scripts": { "lint": "jshint estraverse.js", "test": "npm run-script lint && npm run-script unit-test", "unit-test": "mocha --compilers js:babel-register" }, "version": "4.2.0" } },{}],8:[function(require,module,exports){ 'use strict'; /* Copyright (C) 2013 Yusuke Suzuki Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 'AS IS' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ (function () { 'use strict'; function isExpression(node) { if (node == null) { return false; } switch (node.type) { case 'ArrayExpression': case 'AssignmentExpression': case 'BinaryExpression': case 'CallExpression': case 'ConditionalExpression': case 'FunctionExpression': case 'Identifier': case 'Literal': case 'LogicalExpression': case 'MemberExpression': case 'NewExpression': case 'ObjectExpression': case 'SequenceExpression': case 'ThisExpression': case 'UnaryExpression': case 'UpdateExpression': return true; } return false; } function isIterationStatement(node) { if (node == null) { return false; } switch (node.type) { case 'DoWhileStatement': case 'ForInStatement': case 'ForStatement': case 'WhileStatement': return true; } return false; } function isStatement(node) { if (node == null) { return false; } switch (node.type) { case 'BlockStatement': case 'BreakStatement': case 'ContinueStatement': case 'DebuggerStatement': case 'DoWhileStatement': case 'EmptyStatement': case 'ExpressionStatement': case 'ForInStatement': case 'ForStatement': case 'IfStatement': case 'LabeledStatement': case 'ReturnStatement': case 'SwitchStatement': case 'ThrowStatement': case 'TryStatement': case 'VariableDeclaration': case 'WhileStatement': case 'WithStatement': return true; } return false; } function isSourceElement(node) { return isStatement(node) || node != null && node.type === 'FunctionDeclaration'; } function trailingStatement(node) { switch (node.type) { case 'IfStatement': if (node.alternate != null) { return node.alternate; } return node.consequent; case 'LabeledStatement': case 'ForStatement': case 'ForInStatement': case 'WhileStatement': case 'WithStatement': return node.body; } return null; } function isProblematicIfStatement(node) { var current; if (node.type !== 'IfStatement') { return false; } if (node.alternate == null) { return false; } current = node.consequent; do { if (current.type === 'IfStatement') { if (current.alternate == null) { return true; } } current = trailingStatement(current); } while (current); return false; } module.exports = { isExpression: isExpression, isStatement: isStatement, isIterationStatement: isIterationStatement, isSourceElement: isSourceElement, isProblematicIfStatement: isProblematicIfStatement, trailingStatement: trailingStatement }; })(); /* vim: set sw=4 ts=4 et tw=80 : */ },{}],9:[function(require,module,exports){ 'use strict'; /* Copyright (C) 2013-2014 Yusuke Suzuki Copyright (C) 2014 Ivan Nikulin Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ (function () { 'use strict'; var ES6Regex, ES5Regex, NON_ASCII_WHITESPACES, IDENTIFIER_START, IDENTIFIER_PART, ch; // See `tools/generate-identifier-regex.js`. ES5Regex = { // ECMAScript 5.1/Unicode v7.0.0 NonAsciiIdentifierStart: NonAsciiIdentifierStart: /[\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u048A-\u052F\u0531-\u0556\u0559\u0561-\u0587\u05D0-\u05EA\u05F0-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u08A0-\u08B2\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD\u09CE\u09DC\u09DD\u09DF-\u09E1\u09F0\u09F1\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A59-\u0A5C\u0A5E\u0A72-\u0A74\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C58\u0C59\u0C60\u0C61\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D60\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F4\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16EE-\u16F8\u1700-\u170C\u170E-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1877\u1880-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19C1-\u19C7\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4B\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1CE9-\u1CEC\u1CEE-\u1CF1\u1CF5\u1CF6\u1D00-\u1DBF\u1E00-\u1F15\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u2071\u207F\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2160-\u2188\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2E2F\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303C\u3041-\u3096\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FCC\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6EF\uA717-\uA71F\uA722-\uA788\uA78B-\uA78E\uA790-\uA7AD\uA7B0\uA7B1\uA7F7-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uA9E0-\uA9E4\uA9E6-\uA9EF\uA9FA-\uA9FE\uAA00-\uAA28\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA7E-\uAAAF\uAAB1\uAAB5\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB5F\uAB64\uAB65\uABC0-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC]/, // ECMAScript 5.1/Unicode v7.0.0 NonAsciiIdentifierPart: NonAsciiIdentifierPart: /[\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0300-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u0483-\u0487\u048A-\u052F\u0531-\u0556\u0559\u0561-\u0587\u0591-\u05BD\u05BF\u05C1\u05C2\u05C4\u05C5\u05C7\u05D0-\u05EA\u05F0-\u05F2\u0610-\u061A\u0620-\u0669\u066E-\u06D3\u06D5-\u06DC\u06DF-\u06E8\u06EA-\u06FC\u06FF\u0710-\u074A\u074D-\u07B1\u07C0-\u07F5\u07FA\u0800-\u082D\u0840-\u085B\u08A0-\u08B2\u08E4-\u0963\u0966-\u096F\u0971-\u0983\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BC-\u09C4\u09C7\u09C8\u09CB-\u09CE\u09D7\u09DC\u09DD\u09DF-\u09E3\u09E6-\u09F1\u0A01-\u0A03\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A3C\u0A3E-\u0A42\u0A47\u0A48\u0A4B-\u0A4D\u0A51\u0A59-\u0A5C\u0A5E\u0A66-\u0A75\u0A81-\u0A83\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABC-\u0AC5\u0AC7-\u0AC9\u0ACB-\u0ACD\u0AD0\u0AE0-\u0AE3\u0AE6-\u0AEF\u0B01-\u0B03\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3C-\u0B44\u0B47\u0B48\u0B4B-\u0B4D\u0B56\u0B57\u0B5C\u0B5D\u0B5F-\u0B63\u0B66-\u0B6F\u0B71\u0B82\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BBE-\u0BC2\u0BC6-\u0BC8\u0BCA-\u0BCD\u0BD0\u0BD7\u0BE6-\u0BEF\u0C00-\u0C03\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D-\u0C44\u0C46-\u0C48\u0C4A-\u0C4D\u0C55\u0C56\u0C58\u0C59\u0C60-\u0C63\u0C66-\u0C6F\u0C81-\u0C83\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBC-\u0CC4\u0CC6-\u0CC8\u0CCA-\u0CCD\u0CD5\u0CD6\u0CDE\u0CE0-\u0CE3\u0CE6-\u0CEF\u0CF1\u0CF2\u0D01-\u0D03\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D-\u0D44\u0D46-\u0D48\u0D4A-\u0D4E\u0D57\u0D60-\u0D63\u0D66-\u0D6F\u0D7A-\u0D7F\u0D82\u0D83\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0DCA\u0DCF-\u0DD4\u0DD6\u0DD8-\u0DDF\u0DE6-\u0DEF\u0DF2\u0DF3\u0E01-\u0E3A\u0E40-\u0E4E\u0E50-\u0E59\u0E81\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB9\u0EBB-\u0EBD\u0EC0-\u0EC4\u0EC6\u0EC8-\u0ECD\u0ED0-\u0ED9\u0EDC-\u0EDF\u0F00\u0F18\u0F19\u0F20-\u0F29\u0F35\u0F37\u0F39\u0F3E-\u0F47\u0F49-\u0F6C\u0F71-\u0F84\u0F86-\u0F97\u0F99-\u0FBC\u0FC6\u1000-\u1049\u1050-\u109D\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u135D-\u135F\u1380-\u138F\u13A0-\u13F4\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16EE-\u16F8\u1700-\u170C\u170E-\u1714\u1720-\u1734\u1740-\u1753\u1760-\u176C\u176E-\u1770\u1772\u1773\u1780-\u17D3\u17D7\u17DC\u17DD\u17E0-\u17E9\u180B-\u180D\u1810-\u1819\u1820-\u1877\u1880-\u18AA\u18B0-\u18F5\u1900-\u191E\u1920-\u192B\u1930-\u193B\u1946-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u19D0-\u19D9\u1A00-\u1A1B\u1A20-\u1A5E\u1A60-\u1A7C\u1A7F-\u1A89\u1A90-\u1A99\u1AA7\u1AB0-\u1ABD\u1B00-\u1B4B\u1B50-\u1B59\u1B6B-\u1B73\u1B80-\u1BF3\u1C00-\u1C37\u1C40-\u1C49\u1C4D-\u1C7D\u1CD0-\u1CD2\u1CD4-\u1CF6\u1CF8\u1CF9\u1D00-\u1DF5\u1DFC-\u1F15\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u200C\u200D\u203F\u2040\u2054\u2071\u207F\u2090-\u209C\u20D0-\u20DC\u20E1\u20E5-\u20F0\u2102\u2107\u210A-\u2113\u2115\u2119-\u211D\u2124\u2126\u2128\u212A-\u212D\u212F-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2160-\u2188\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D7F-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2DE0-\u2DFF\u2E2F\u3005-\u3007\u3021-\u302F\u3031-\u3035\u3038-\u303C\u3041-\u3096\u3099\u309A\u309D-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FCC\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA62B\uA640-\uA66F\uA674-\uA67D\uA67F-\uA69D\uA69F-\uA6F1\uA717-\uA71F\uA722-\uA788\uA78B-\uA78E\uA790-\uA7AD\uA7B0\uA7B1\uA7F7-\uA827\uA840-\uA873\uA880-\uA8C4\uA8D0-\uA8D9\uA8E0-\uA8F7\uA8FB\uA900-\uA92D\uA930-\uA953\uA960-\uA97C\uA980-\uA9C0\uA9CF-\uA9D9\uA9E0-\uA9FE\uAA00-\uAA36\uAA40-\uAA4D\uAA50-\uAA59\uAA60-\uAA76\uAA7A-\uAAC2\uAADB-\uAADD\uAAE0-\uAAEF\uAAF2-\uAAF6\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB5F\uAB64\uAB65\uABC0-\uABEA\uABEC\uABED\uABF0-\uABF9\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE00-\uFE0F\uFE20-\uFE2D\uFE33\uFE34\uFE4D-\uFE4F\uFE70-\uFE74\uFE76-\uFEFC\uFF10-\uFF19\uFF21-\uFF3A\uFF3F\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC]/ }; ES6Regex = { // ECMAScript 6/Unicode v7.0.0 NonAsciiIdentifierStart: NonAsciiIdentifierStart: /[\xAA\xB5\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0370-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386\u0388-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u048A-\u052F\u0531-\u0556\u0559\u0561-\u0587\u05D0-\u05EA\u05F0-\u05F2\u0620-\u064A\u066E\u066F\u0671-\u06D3\u06D5\u06E5\u06E6\u06EE\u06EF\u06FA-\u06FC\u06FF\u0710\u0712-\u072F\u074D-\u07A5\u07B1\u07CA-\u07EA\u07F4\u07F5\u07FA\u0800-\u0815\u081A\u0824\u0828\u0840-\u0858\u08A0-\u08B2\u0904-\u0939\u093D\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BD\u09CE\u09DC\u09DD\u09DF-\u09E1\u09F0\u09F1\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A59-\u0A5C\u0A5E\u0A72-\u0A74\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABD\u0AD0\u0AE0\u0AE1\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3D\u0B5C\u0B5D\u0B5F-\u0B61\u0B71\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BD0\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D\u0C58\u0C59\u0C60\u0C61\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBD\u0CDE\u0CE0\u0CE1\u0CF1\u0CF2\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D\u0D4E\u0D60\u0D61\u0D7A-\u0D7F\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0E01-\u0E30\u0E32\u0E33\u0E40-\u0E46\u0E81\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB0\u0EB2\u0EB3\u0EBD\u0EC0-\u0EC4\u0EC6\u0EDC-\u0EDF\u0F00\u0F40-\u0F47\u0F49-\u0F6C\u0F88-\u0F8C\u1000-\u102A\u103F\u1050-\u1055\u105A-\u105D\u1061\u1065\u1066\u106E-\u1070\u1075-\u1081\u108E\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u1380-\u138F\u13A0-\u13F4\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16EE-\u16F8\u1700-\u170C\u170E-\u1711\u1720-\u1731\u1740-\u1751\u1760-\u176C\u176E-\u1770\u1780-\u17B3\u17D7\u17DC\u1820-\u1877\u1880-\u18A8\u18AA\u18B0-\u18F5\u1900-\u191E\u1950-\u196D\u1970-\u1974\u1980-\u19AB\u19C1-\u19C7\u1A00-\u1A16\u1A20-\u1A54\u1AA7\u1B05-\u1B33\u1B45-\u1B4B\u1B83-\u1BA0\u1BAE\u1BAF\u1BBA-\u1BE5\u1C00-\u1C23\u1C4D-\u1C4F\u1C5A-\u1C7D\u1CE9-\u1CEC\u1CEE-\u1CF1\u1CF5\u1CF6\u1D00-\u1DBF\u1E00-\u1F15\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u2071\u207F\u2090-\u209C\u2102\u2107\u210A-\u2113\u2115\u2118-\u211D\u2124\u2126\u2128\u212A-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2160-\u2188\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CEE\u2CF2\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D80-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303C\u3041-\u3096\u309B-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FCC\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA61F\uA62A\uA62B\uA640-\uA66E\uA67F-\uA69D\uA6A0-\uA6EF\uA717-\uA71F\uA722-\uA788\uA78B-\uA78E\uA790-\uA7AD\uA7B0\uA7B1\uA7F7-\uA801\uA803-\uA805\uA807-\uA80A\uA80C-\uA822\uA840-\uA873\uA882-\uA8B3\uA8F2-\uA8F7\uA8FB\uA90A-\uA925\uA930-\uA946\uA960-\uA97C\uA984-\uA9B2\uA9CF\uA9E0-\uA9E4\uA9E6-\uA9EF\uA9FA-\uA9FE\uAA00-\uAA28\uAA40-\uAA42\uAA44-\uAA4B\uAA60-\uAA76\uAA7A\uAA7E-\uAAAF\uAAB1\uAAB5\uAAB6\uAAB9-\uAABD\uAAC0\uAAC2\uAADB-\uAADD\uAAE0-\uAAEA\uAAF2-\uAAF4\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB5F\uAB64\uAB65\uABC0-\uABE2\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D\uFB1F-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE70-\uFE74\uFE76-\uFEFC\uFF21-\uFF3A\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC]|\uD800[\uDC00-\uDC0B\uDC0D-\uDC26\uDC28-\uDC3A\uDC3C\uDC3D\uDC3F-\uDC4D\uDC50-\uDC5D\uDC80-\uDCFA\uDD40-\uDD74\uDE80-\uDE9C\uDEA0-\uDED0\uDF00-\uDF1F\uDF30-\uDF4A\uDF50-\uDF75\uDF80-\uDF9D\uDFA0-\uDFC3\uDFC8-\uDFCF\uDFD1-\uDFD5]|\uD801[\uDC00-\uDC9D\uDD00-\uDD27\uDD30-\uDD63\uDE00-\uDF36\uDF40-\uDF55\uDF60-\uDF67]|\uD802[\uDC00-\uDC05\uDC08\uDC0A-\uDC35\uDC37\uDC38\uDC3C\uDC3F-\uDC55\uDC60-\uDC76\uDC80-\uDC9E\uDD00-\uDD15\uDD20-\uDD39\uDD80-\uDDB7\uDDBE\uDDBF\uDE00\uDE10-\uDE13\uDE15-\uDE17\uDE19-\uDE33\uDE60-\uDE7C\uDE80-\uDE9C\uDEC0-\uDEC7\uDEC9-\uDEE4\uDF00-\uDF35\uDF40-\uDF55\uDF60-\uDF72\uDF80-\uDF91]|\uD803[\uDC00-\uDC48]|\uD804[\uDC03-\uDC37\uDC83-\uDCAF\uDCD0-\uDCE8\uDD03-\uDD26\uDD50-\uDD72\uDD76\uDD83-\uDDB2\uDDC1-\uDDC4\uDDDA\uDE00-\uDE11\uDE13-\uDE2B\uDEB0-\uDEDE\uDF05-\uDF0C\uDF0F\uDF10\uDF13-\uDF28\uDF2A-\uDF30\uDF32\uDF33\uDF35-\uDF39\uDF3D\uDF5D-\uDF61]|\uD805[\uDC80-\uDCAF\uDCC4\uDCC5\uDCC7\uDD80-\uDDAE\uDE00-\uDE2F\uDE44\uDE80-\uDEAA]|\uD806[\uDCA0-\uDCDF\uDCFF\uDEC0-\uDEF8]|\uD808[\uDC00-\uDF98]|\uD809[\uDC00-\uDC6E]|[\uD80C\uD840-\uD868\uD86A-\uD86C][\uDC00-\uDFFF]|\uD80D[\uDC00-\uDC2E]|\uD81A[\uDC00-\uDE38\uDE40-\uDE5E\uDED0-\uDEED\uDF00-\uDF2F\uDF40-\uDF43\uDF63-\uDF77\uDF7D-\uDF8F]|\uD81B[\uDF00-\uDF44\uDF50\uDF93-\uDF9F]|\uD82C[\uDC00\uDC01]|\uD82F[\uDC00-\uDC6A\uDC70-\uDC7C\uDC80-\uDC88\uDC90-\uDC99]|\uD835[\uDC00-\uDC54\uDC56-\uDC9C\uDC9E\uDC9F\uDCA2\uDCA5\uDCA6\uDCA9-\uDCAC\uDCAE-\uDCB9\uDCBB\uDCBD-\uDCC3\uDCC5-\uDD05\uDD07-\uDD0A\uDD0D-\uDD14\uDD16-\uDD1C\uDD1E-\uDD39\uDD3B-\uDD3E\uDD40-\uDD44\uDD46\uDD4A-\uDD50\uDD52-\uDEA5\uDEA8-\uDEC0\uDEC2-\uDEDA\uDEDC-\uDEFA\uDEFC-\uDF14\uDF16-\uDF34\uDF36-\uDF4E\uDF50-\uDF6E\uDF70-\uDF88\uDF8A-\uDFA8\uDFAA-\uDFC2\uDFC4-\uDFCB]|\uD83A[\uDC00-\uDCC4]|\uD83B[\uDE00-\uDE03\uDE05-\uDE1F\uDE21\uDE22\uDE24\uDE27\uDE29-\uDE32\uDE34-\uDE37\uDE39\uDE3B\uDE42\uDE47\uDE49\uDE4B\uDE4D-\uDE4F\uDE51\uDE52\uDE54\uDE57\uDE59\uDE5B\uDE5D\uDE5F\uDE61\uDE62\uDE64\uDE67-\uDE6A\uDE6C-\uDE72\uDE74-\uDE77\uDE79-\uDE7C\uDE7E\uDE80-\uDE89\uDE8B-\uDE9B\uDEA1-\uDEA3\uDEA5-\uDEA9\uDEAB-\uDEBB]|\uD869[\uDC00-\uDED6\uDF00-\uDFFF]|\uD86D[\uDC00-\uDF34\uDF40-\uDFFF]|\uD86E[\uDC00-\uDC1D]|\uD87E[\uDC00-\uDE1D]/, // ECMAScript 6/Unicode v7.0.0 NonAsciiIdentifierPart: NonAsciiIdentifierPart: /[\xAA\xB5\xB7\xBA\xC0-\xD6\xD8-\xF6\xF8-\u02C1\u02C6-\u02D1\u02E0-\u02E4\u02EC\u02EE\u0300-\u0374\u0376\u0377\u037A-\u037D\u037F\u0386-\u038A\u038C\u038E-\u03A1\u03A3-\u03F5\u03F7-\u0481\u0483-\u0487\u048A-\u052F\u0531-\u0556\u0559\u0561-\u0587\u0591-\u05BD\u05BF\u05C1\u05C2\u05C4\u05C5\u05C7\u05D0-\u05EA\u05F0-\u05F2\u0610-\u061A\u0620-\u0669\u066E-\u06D3\u06D5-\u06DC\u06DF-\u06E8\u06EA-\u06FC\u06FF\u0710-\u074A\u074D-\u07B1\u07C0-\u07F5\u07FA\u0800-\u082D\u0840-\u085B\u08A0-\u08B2\u08E4-\u0963\u0966-\u096F\u0971-\u0983\u0985-\u098C\u098F\u0990\u0993-\u09A8\u09AA-\u09B0\u09B2\u09B6-\u09B9\u09BC-\u09C4\u09C7\u09C8\u09CB-\u09CE\u09D7\u09DC\u09DD\u09DF-\u09E3\u09E6-\u09F1\u0A01-\u0A03\u0A05-\u0A0A\u0A0F\u0A10\u0A13-\u0A28\u0A2A-\u0A30\u0A32\u0A33\u0A35\u0A36\u0A38\u0A39\u0A3C\u0A3E-\u0A42\u0A47\u0A48\u0A4B-\u0A4D\u0A51\u0A59-\u0A5C\u0A5E\u0A66-\u0A75\u0A81-\u0A83\u0A85-\u0A8D\u0A8F-\u0A91\u0A93-\u0AA8\u0AAA-\u0AB0\u0AB2\u0AB3\u0AB5-\u0AB9\u0ABC-\u0AC5\u0AC7-\u0AC9\u0ACB-\u0ACD\u0AD0\u0AE0-\u0AE3\u0AE6-\u0AEF\u0B01-\u0B03\u0B05-\u0B0C\u0B0F\u0B10\u0B13-\u0B28\u0B2A-\u0B30\u0B32\u0B33\u0B35-\u0B39\u0B3C-\u0B44\u0B47\u0B48\u0B4B-\u0B4D\u0B56\u0B57\u0B5C\u0B5D\u0B5F-\u0B63\u0B66-\u0B6F\u0B71\u0B82\u0B83\u0B85-\u0B8A\u0B8E-\u0B90\u0B92-\u0B95\u0B99\u0B9A\u0B9C\u0B9E\u0B9F\u0BA3\u0BA4\u0BA8-\u0BAA\u0BAE-\u0BB9\u0BBE-\u0BC2\u0BC6-\u0BC8\u0BCA-\u0BCD\u0BD0\u0BD7\u0BE6-\u0BEF\u0C00-\u0C03\u0C05-\u0C0C\u0C0E-\u0C10\u0C12-\u0C28\u0C2A-\u0C39\u0C3D-\u0C44\u0C46-\u0C48\u0C4A-\u0C4D\u0C55\u0C56\u0C58\u0C59\u0C60-\u0C63\u0C66-\u0C6F\u0C81-\u0C83\u0C85-\u0C8C\u0C8E-\u0C90\u0C92-\u0CA8\u0CAA-\u0CB3\u0CB5-\u0CB9\u0CBC-\u0CC4\u0CC6-\u0CC8\u0CCA-\u0CCD\u0CD5\u0CD6\u0CDE\u0CE0-\u0CE3\u0CE6-\u0CEF\u0CF1\u0CF2\u0D01-\u0D03\u0D05-\u0D0C\u0D0E-\u0D10\u0D12-\u0D3A\u0D3D-\u0D44\u0D46-\u0D48\u0D4A-\u0D4E\u0D57\u0D60-\u0D63\u0D66-\u0D6F\u0D7A-\u0D7F\u0D82\u0D83\u0D85-\u0D96\u0D9A-\u0DB1\u0DB3-\u0DBB\u0DBD\u0DC0-\u0DC6\u0DCA\u0DCF-\u0DD4\u0DD6\u0DD8-\u0DDF\u0DE6-\u0DEF\u0DF2\u0DF3\u0E01-\u0E3A\u0E40-\u0E4E\u0E50-\u0E59\u0E81\u0E82\u0E84\u0E87\u0E88\u0E8A\u0E8D\u0E94-\u0E97\u0E99-\u0E9F\u0EA1-\u0EA3\u0EA5\u0EA7\u0EAA\u0EAB\u0EAD-\u0EB9\u0EBB-\u0EBD\u0EC0-\u0EC4\u0EC6\u0EC8-\u0ECD\u0ED0-\u0ED9\u0EDC-\u0EDF\u0F00\u0F18\u0F19\u0F20-\u0F29\u0F35\u0F37\u0F39\u0F3E-\u0F47\u0F49-\u0F6C\u0F71-\u0F84\u0F86-\u0F97\u0F99-\u0FBC\u0FC6\u1000-\u1049\u1050-\u109D\u10A0-\u10C5\u10C7\u10CD\u10D0-\u10FA\u10FC-\u1248\u124A-\u124D\u1250-\u1256\u1258\u125A-\u125D\u1260-\u1288\u128A-\u128D\u1290-\u12B0\u12B2-\u12B5\u12B8-\u12BE\u12C0\u12C2-\u12C5\u12C8-\u12D6\u12D8-\u1310\u1312-\u1315\u1318-\u135A\u135D-\u135F\u1369-\u1371\u1380-\u138F\u13A0-\u13F4\u1401-\u166C\u166F-\u167F\u1681-\u169A\u16A0-\u16EA\u16EE-\u16F8\u1700-\u170C\u170E-\u1714\u1720-\u1734\u1740-\u1753\u1760-\u176C\u176E-\u1770\u1772\u1773\u1780-\u17D3\u17D7\u17DC\u17DD\u17E0-\u17E9\u180B-\u180D\u1810-\u1819\u1820-\u1877\u1880-\u18AA\u18B0-\u18F5\u1900-\u191E\u1920-\u192B\u1930-\u193B\u1946-\u196D\u1970-\u1974\u1980-\u19AB\u19B0-\u19C9\u19D0-\u19DA\u1A00-\u1A1B\u1A20-\u1A5E\u1A60-\u1A7C\u1A7F-\u1A89\u1A90-\u1A99\u1AA7\u1AB0-\u1ABD\u1B00-\u1B4B\u1B50-\u1B59\u1B6B-\u1B73\u1B80-\u1BF3\u1C00-\u1C37\u1C40-\u1C49\u1C4D-\u1C7D\u1CD0-\u1CD2\u1CD4-\u1CF6\u1CF8\u1CF9\u1D00-\u1DF5\u1DFC-\u1F15\u1F18-\u1F1D\u1F20-\u1F45\u1F48-\u1F4D\u1F50-\u1F57\u1F59\u1F5B\u1F5D\u1F5F-\u1F7D\u1F80-\u1FB4\u1FB6-\u1FBC\u1FBE\u1FC2-\u1FC4\u1FC6-\u1FCC\u1FD0-\u1FD3\u1FD6-\u1FDB\u1FE0-\u1FEC\u1FF2-\u1FF4\u1FF6-\u1FFC\u200C\u200D\u203F\u2040\u2054\u2071\u207F\u2090-\u209C\u20D0-\u20DC\u20E1\u20E5-\u20F0\u2102\u2107\u210A-\u2113\u2115\u2118-\u211D\u2124\u2126\u2128\u212A-\u2139\u213C-\u213F\u2145-\u2149\u214E\u2160-\u2188\u2C00-\u2C2E\u2C30-\u2C5E\u2C60-\u2CE4\u2CEB-\u2CF3\u2D00-\u2D25\u2D27\u2D2D\u2D30-\u2D67\u2D6F\u2D7F-\u2D96\u2DA0-\u2DA6\u2DA8-\u2DAE\u2DB0-\u2DB6\u2DB8-\u2DBE\u2DC0-\u2DC6\u2DC8-\u2DCE\u2DD0-\u2DD6\u2DD8-\u2DDE\u2DE0-\u2DFF\u3005-\u3007\u3021-\u302F\u3031-\u3035\u3038-\u303C\u3041-\u3096\u3099-\u309F\u30A1-\u30FA\u30FC-\u30FF\u3105-\u312D\u3131-\u318E\u31A0-\u31BA\u31F0-\u31FF\u3400-\u4DB5\u4E00-\u9FCC\uA000-\uA48C\uA4D0-\uA4FD\uA500-\uA60C\uA610-\uA62B\uA640-\uA66F\uA674-\uA67D\uA67F-\uA69D\uA69F-\uA6F1\uA717-\uA71F\uA722-\uA788\uA78B-\uA78E\uA790-\uA7AD\uA7B0\uA7B1\uA7F7-\uA827\uA840-\uA873\uA880-\uA8C4\uA8D0-\uA8D9\uA8E0-\uA8F7\uA8FB\uA900-\uA92D\uA930-\uA953\uA960-\uA97C\uA980-\uA9C0\uA9CF-\uA9D9\uA9E0-\uA9FE\uAA00-\uAA36\uAA40-\uAA4D\uAA50-\uAA59\uAA60-\uAA76\uAA7A-\uAAC2\uAADB-\uAADD\uAAE0-\uAAEF\uAAF2-\uAAF6\uAB01-\uAB06\uAB09-\uAB0E\uAB11-\uAB16\uAB20-\uAB26\uAB28-\uAB2E\uAB30-\uAB5A\uAB5C-\uAB5F\uAB64\uAB65\uABC0-\uABEA\uABEC\uABED\uABF0-\uABF9\uAC00-\uD7A3\uD7B0-\uD7C6\uD7CB-\uD7FB\uF900-\uFA6D\uFA70-\uFAD9\uFB00-\uFB06\uFB13-\uFB17\uFB1D-\uFB28\uFB2A-\uFB36\uFB38-\uFB3C\uFB3E\uFB40\uFB41\uFB43\uFB44\uFB46-\uFBB1\uFBD3-\uFD3D\uFD50-\uFD8F\uFD92-\uFDC7\uFDF0-\uFDFB\uFE00-\uFE0F\uFE20-\uFE2D\uFE33\uFE34\uFE4D-\uFE4F\uFE70-\uFE74\uFE76-\uFEFC\uFF10-\uFF19\uFF21-\uFF3A\uFF3F\uFF41-\uFF5A\uFF66-\uFFBE\uFFC2-\uFFC7\uFFCA-\uFFCF\uFFD2-\uFFD7\uFFDA-\uFFDC]|\uD800[\uDC00-\uDC0B\uDC0D-\uDC26\uDC28-\uDC3A\uDC3C\uDC3D\uDC3F-\uDC4D\uDC50-\uDC5D\uDC80-\uDCFA\uDD40-\uDD74\uDDFD\uDE80-\uDE9C\uDEA0-\uDED0\uDEE0\uDF00-\uDF1F\uDF30-\uDF4A\uDF50-\uDF7A\uDF80-\uDF9D\uDFA0-\uDFC3\uDFC8-\uDFCF\uDFD1-\uDFD5]|\uD801[\uDC00-\uDC9D\uDCA0-\uDCA9\uDD00-\uDD27\uDD30-\uDD63\uDE00-\uDF36\uDF40-\uDF55\uDF60-\uDF67]|\uD802[\uDC00-\uDC05\uDC08\uDC0A-\uDC35\uDC37\uDC38\uDC3C\uDC3F-\uDC55\uDC60-\uDC76\uDC80-\uDC9E\uDD00-\uDD15\uDD20-\uDD39\uDD80-\uDDB7\uDDBE\uDDBF\uDE00-\uDE03\uDE05\uDE06\uDE0C-\uDE13\uDE15-\uDE17\uDE19-\uDE33\uDE38-\uDE3A\uDE3F\uDE60-\uDE7C\uDE80-\uDE9C\uDEC0-\uDEC7\uDEC9-\uDEE6\uDF00-\uDF35\uDF40-\uDF55\uDF60-\uDF72\uDF80-\uDF91]|\uD803[\uDC00-\uDC48]|\uD804[\uDC00-\uDC46\uDC66-\uDC6F\uDC7F-\uDCBA\uDCD0-\uDCE8\uDCF0-\uDCF9\uDD00-\uDD34\uDD36-\uDD3F\uDD50-\uDD73\uDD76\uDD80-\uDDC4\uDDD0-\uDDDA\uDE00-\uDE11\uDE13-\uDE37\uDEB0-\uDEEA\uDEF0-\uDEF9\uDF01-\uDF03\uDF05-\uDF0C\uDF0F\uDF10\uDF13-\uDF28\uDF2A-\uDF30\uDF32\uDF33\uDF35-\uDF39\uDF3C-\uDF44\uDF47\uDF48\uDF4B-\uDF4D\uDF57\uDF5D-\uDF63\uDF66-\uDF6C\uDF70-\uDF74]|\uD805[\uDC80-\uDCC5\uDCC7\uDCD0-\uDCD9\uDD80-\uDDB5\uDDB8-\uDDC0\uDE00-\uDE40\uDE44\uDE50-\uDE59\uDE80-\uDEB7\uDEC0-\uDEC9]|\uD806[\uDCA0-\uDCE9\uDCFF\uDEC0-\uDEF8]|\uD808[\uDC00-\uDF98]|\uD809[\uDC00-\uDC6E]|[\uD80C\uD840-\uD868\uD86A-\uD86C][\uDC00-\uDFFF]|\uD80D[\uDC00-\uDC2E]|\uD81A[\uDC00-\uDE38\uDE40-\uDE5E\uDE60-\uDE69\uDED0-\uDEED\uDEF0-\uDEF4\uDF00-\uDF36\uDF40-\uDF43\uDF50-\uDF59\uDF63-\uDF77\uDF7D-\uDF8F]|\uD81B[\uDF00-\uDF44\uDF50-\uDF7E\uDF8F-\uDF9F]|\uD82C[\uDC00\uDC01]|\uD82F[\uDC00-\uDC6A\uDC70-\uDC7C\uDC80-\uDC88\uDC90-\uDC99\uDC9D\uDC9E]|\uD834[\uDD65-\uDD69\uDD6D-\uDD72\uDD7B-\uDD82\uDD85-\uDD8B\uDDAA-\uDDAD\uDE42-\uDE44]|\uD835[\uDC00-\uDC54\uDC56-\uDC9C\uDC9E\uDC9F\uDCA2\uDCA5\uDCA6\uDCA9-\uDCAC\uDCAE-\uDCB9\uDCBB\uDCBD-\uDCC3\uDCC5-\uDD05\uDD07-\uDD0A\uDD0D-\uDD14\uDD16-\uDD1C\uDD1E-\uDD39\uDD3B-\uDD3E\uDD40-\uDD44\uDD46\uDD4A-\uDD50\uDD52-\uDEA5\uDEA8-\uDEC0\uDEC2-\uDEDA\uDEDC-\uDEFA\uDEFC-\uDF14\uDF16-\uDF34\uDF36-\uDF4E\uDF50-\uDF6E\uDF70-\uDF88\uDF8A-\uDFA8\uDFAA-\uDFC2\uDFC4-\uDFCB\uDFCE-\uDFFF]|\uD83A[\uDC00-\uDCC4\uDCD0-\uDCD6]|\uD83B[\uDE00-\uDE03\uDE05-\uDE1F\uDE21\uDE22\uDE24\uDE27\uDE29-\uDE32\uDE34-\uDE37\uDE39\uDE3B\uDE42\uDE47\uDE49\uDE4B\uDE4D-\uDE4F\uDE51\uDE52\uDE54\uDE57\uDE59\uDE5B\uDE5D\uDE5F\uDE61\uDE62\uDE64\uDE67-\uDE6A\uDE6C-\uDE72\uDE74-\uDE77\uDE79-\uDE7C\uDE7E\uDE80-\uDE89\uDE8B-\uDE9B\uDEA1-\uDEA3\uDEA5-\uDEA9\uDEAB-\uDEBB]|\uD869[\uDC00-\uDED6\uDF00-\uDFFF]|\uD86D[\uDC00-\uDF34\uDF40-\uDFFF]|\uD86E[\uDC00-\uDC1D]|\uD87E[\uDC00-\uDE1D]|\uDB40[\uDD00-\uDDEF]/ }; function isDecimalDigit(ch) { return 0x30 <= ch && ch <= 0x39; // 0..9 } function isHexDigit(ch) { return 0x30 <= ch && ch <= 0x39 || // 0..9 0x61 <= ch && ch <= 0x66 || // a..f 0x41 <= ch && ch <= 0x46; // A..F } function isOctalDigit(ch) { return ch >= 0x30 && ch <= 0x37; // 0..7 } // 7.2 White Space NON_ASCII_WHITESPACES = [0x1680, 0x180E, 0x2000, 0x2001, 0x2002, 0x2003, 0x2004, 0x2005, 0x2006, 0x2007, 0x2008, 0x2009, 0x200A, 0x202F, 0x205F, 0x3000, 0xFEFF]; function isWhiteSpace(ch) { return ch === 0x20 || ch === 0x09 || ch === 0x0B || ch === 0x0C || ch === 0xA0 || ch >= 0x1680 && NON_ASCII_WHITESPACES.indexOf(ch) >= 0; } // 7.3 Line Terminators function isLineTerminator(ch) { return ch === 0x0A || ch === 0x0D || ch === 0x2028 || ch === 0x2029; } // 7.6 Identifier Names and Identifiers function fromCodePoint(cp) { if (cp <= 0xFFFF) { return String.fromCharCode(cp); } var cu1 = String.fromCharCode(Math.floor((cp - 0x10000) / 0x400) + 0xD800); var cu2 = String.fromCharCode((cp - 0x10000) % 0x400 + 0xDC00); return cu1 + cu2; } IDENTIFIER_START = new Array(0x80); for (ch = 0; ch < 0x80; ++ch) { IDENTIFIER_START[ch] = ch >= 0x61 && ch <= 0x7A || // a..z ch >= 0x41 && ch <= 0x5A || // A..Z ch === 0x24 || ch === 0x5F; // $ (dollar) and _ (underscore) } IDENTIFIER_PART = new Array(0x80); for (ch = 0; ch < 0x80; ++ch) { IDENTIFIER_PART[ch] = ch >= 0x61 && ch <= 0x7A || // a..z ch >= 0x41 && ch <= 0x5A || // A..Z ch >= 0x30 && ch <= 0x39 || // 0..9 ch === 0x24 || ch === 0x5F; // $ (dollar) and _ (underscore) } function isIdentifierStartES5(ch) { return ch < 0x80 ? IDENTIFIER_START[ch] : ES5Regex.NonAsciiIdentifierStart.test(fromCodePoint(ch)); } function isIdentifierPartES5(ch) { return ch < 0x80 ? IDENTIFIER_PART[ch] : ES5Regex.NonAsciiIdentifierPart.test(fromCodePoint(ch)); } function isIdentifierStartES6(ch) { return ch < 0x80 ? IDENTIFIER_START[ch] : ES6Regex.NonAsciiIdentifierStart.test(fromCodePoint(ch)); } function isIdentifierPartES6(ch) { return ch < 0x80 ? IDENTIFIER_PART[ch] : ES6Regex.NonAsciiIdentifierPart.test(fromCodePoint(ch)); } module.exports = { isDecimalDigit: isDecimalDigit, isHexDigit: isHexDigit, isOctalDigit: isOctalDigit, isWhiteSpace: isWhiteSpace, isLineTerminator: isLineTerminator, isIdentifierStartES5: isIdentifierStartES5, isIdentifierPartES5: isIdentifierPartES5, isIdentifierStartES6: isIdentifierStartES6, isIdentifierPartES6: isIdentifierPartES6 }; })(); /* vim: set sw=4 ts=4 et tw=80 : */ },{}],10:[function(require,module,exports){ 'use strict'; /* Copyright (C) 2013 Yusuke Suzuki Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ (function () { 'use strict'; var code = require('./code'); function isStrictModeReservedWordES6(id) { switch (id) { case 'implements': case 'interface': case 'package': case 'private': case 'protected': case 'public': case 'static': case 'let': return true; default: return false; } } function isKeywordES5(id, strict) { // yield should not be treated as keyword under non-strict mode. if (!strict && id === 'yield') { return false; } return isKeywordES6(id, strict); } function isKeywordES6(id, strict) { if (strict && isStrictModeReservedWordES6(id)) { return true; } switch (id.length) { case 2: return id === 'if' || id === 'in' || id === 'do'; case 3: return id === 'var' || id === 'for' || id === 'new' || id === 'try'; case 4: return id === 'this' || id === 'else' || id === 'case' || id === 'void' || id === 'with' || id === 'enum'; case 5: return id === 'while' || id === 'break' || id === 'catch' || id === 'throw' || id === 'const' || id === 'yield' || id === 'class' || id === 'super'; case 6: return id === 'return' || id === 'typeof' || id === 'delete' || id === 'switch' || id === 'export' || id === 'import'; case 7: return id === 'default' || id === 'finally' || id === 'extends'; case 8: return id === 'function' || id === 'continue' || id === 'debugger'; case 10: return id === 'instanceof'; default: return false; } } function isReservedWordES5(id, strict) { return id === 'null' || id === 'true' || id === 'false' || isKeywordES5(id, strict); } function isReservedWordES6(id, strict) { return id === 'null' || id === 'true' || id === 'false' || isKeywordES6(id, strict); } function isRestrictedWord(id) { return id === 'eval' || id === 'arguments'; } function isIdentifierNameES5(id) { var i, iz, ch; if (id.length === 0) { return false; } ch = id.charCodeAt(0); if (!code.isIdentifierStartES5(ch)) { return false; } for (i = 1, iz = id.length; i < iz; ++i) { ch = id.charCodeAt(i); if (!code.isIdentifierPartES5(ch)) { return false; } } return true; } function decodeUtf16(lead, trail) { return (lead - 0xD800) * 0x400 + (trail - 0xDC00) + 0x10000; } function isIdentifierNameES6(id) { var i, iz, ch, lowCh, check; if (id.length === 0) { return false; } check = code.isIdentifierStartES6; for (i = 0, iz = id.length; i < iz; ++i) { ch = id.charCodeAt(i); if (0xD800 <= ch && ch <= 0xDBFF) { ++i; if (i >= iz) { return false; } lowCh = id.charCodeAt(i); if (!(0xDC00 <= lowCh && lowCh <= 0xDFFF)) { return false; } ch = decodeUtf16(ch, lowCh); } if (!check(ch)) { return false; } check = code.isIdentifierPartES6; } return true; } function isIdentifierES5(id, strict) { return isIdentifierNameES5(id) && !isReservedWordES5(id, strict); } function isIdentifierES6(id, strict) { return isIdentifierNameES6(id) && !isReservedWordES6(id, strict); } module.exports = { isKeywordES5: isKeywordES5, isKeywordES6: isKeywordES6, isReservedWordES5: isReservedWordES5, isReservedWordES6: isReservedWordES6, isRestrictedWord: isRestrictedWord, isIdentifierNameES5: isIdentifierNameES5, isIdentifierNameES6: isIdentifierNameES6, isIdentifierES5: isIdentifierES5, isIdentifierES6: isIdentifierES6 }; })(); /* vim: set sw=4 ts=4 et tw=80 : */ },{"./code":9}],11:[function(require,module,exports){ 'use strict'; /* Copyright (C) 2013 Yusuke Suzuki Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ (function () { 'use strict'; exports.ast = require('./ast'); exports.code = require('./code'); exports.keyword = require('./keyword'); })(); /* vim: set sw=4 ts=4 et tw=80 : */ },{"./ast":8,"./code":9,"./keyword":10}],12:[function(require,module,exports){ module.exports={ "builtin": { "Array": false, "ArrayBuffer": false, "Boolean": false, "constructor": false, "DataView": false, "Date": false, "decodeURI": false, "decodeURIComponent": false, "encodeURI": false, "encodeURIComponent": false, "Error": false, "escape": false, "eval": false, "EvalError": false, "Float32Array": false, "Float64Array": false, "Function": false, "hasOwnProperty": false, "Infinity": false, "Int16Array": false, "Int32Array": false, "Int8Array": false, "isFinite": false, "isNaN": false, "isPrototypeOf": false, "JSON": false, "Map": false, "Math": false, "NaN": false, "Number": false, "Object": false, "parseFloat": false, "parseInt": false, "Promise": false, "propertyIsEnumerable": false, "Proxy": false, "RangeError": false, "ReferenceError": false, "Reflect": false, "RegExp": false, "Set": false, "String": false, "Symbol": false, "SyntaxError": false, "System": false, "toLocaleString": false, "toString": false, "TypeError": false, "Uint16Array": false, "Uint32Array": false, "Uint8Array": false, "Uint8ClampedArray": false, "undefined": false, "unescape": false, "URIError": false, "valueOf": false, "WeakMap": false, "WeakSet": false }, "es5": { "Array": false, "Boolean": false, "constructor": false, "Date": false, "decodeURI": false, "decodeURIComponent": false, "encodeURI": false, "encodeURIComponent": false, "Error": false, "escape": false, "eval": false, "EvalError": false, "Function": false, "hasOwnProperty": false, "Infinity": false, "isFinite": false, "isNaN": false, "isPrototypeOf": false, "JSON": false, "Math": false, "NaN": false, "Number": false, "Object": false, "parseFloat": false, "parseInt": false, "propertyIsEnumerable": false, "RangeError": false, "ReferenceError": false, "RegExp": false, "String": false, "SyntaxError": false, "toLocaleString": false, "toString": false, "TypeError": false, "undefined": false, "unescape": false, "URIError": false, "valueOf": false }, "es6": { "Array": false, "ArrayBuffer": false, "Boolean": false, "constructor": false, "DataView": false, "Date": false, "decodeURI": false, "decodeURIComponent": false, "encodeURI": false, "encodeURIComponent": false, "Error": false, "escape": false, "eval": false, "EvalError": false, "Float32Array": false, "Float64Array": false, "Function": false, "hasOwnProperty": false, "Infinity": false, "Int16Array": false, "Int32Array": false, "Int8Array": false, "isFinite": false, "isNaN": false, "isPrototypeOf": false, "JSON": false, "Map": false, "Math": false, "NaN": false, "Number": false, "Object": false, "parseFloat": false, "parseInt": false, "Promise": false, "propertyIsEnumerable": false, "Proxy": false, "RangeError": false, "ReferenceError": false, "Reflect": false, "RegExp": false, "Set": false, "String": false, "Symbol": false, "SyntaxError": false, "System": false, "toLocaleString": false, "toString": false, "TypeError": false, "Uint16Array": false, "Uint32Array": false, "Uint8Array": false, "Uint8ClampedArray": false, "undefined": false, "unescape": false, "URIError": false, "valueOf": false, "WeakMap": false, "WeakSet": false }, "browser": { "addEventListener": false, "alert": false, "AnalyserNode": false, "Animation": false, "AnimationEffectReadOnly": false, "AnimationEffectTiming": false, "AnimationEffectTimingReadOnly": false, "AnimationEvent": false, "AnimationPlaybackEvent": false, "AnimationTimeline": false, "applicationCache": false, "ApplicationCache": false, "ApplicationCacheErrorEvent": false, "atob": false, "Attr": false, "Audio": false, "AudioBuffer": false, "AudioBufferSourceNode": false, "AudioContext": false, "AudioDestinationNode": false, "AudioListener": false, "AudioNode": false, "AudioParam": false, "AudioProcessingEvent": false, "AutocompleteErrorEvent": false, "BarProp": false, "BatteryManager": false, "BeforeUnloadEvent": false, "BiquadFilterNode": false, "Blob": false, "blur": false, "btoa": false, "Cache": false, "caches": false, "CacheStorage": false, "cancelAnimationFrame": false, "cancelIdleCallback": false, "CanvasGradient": false, "CanvasPattern": false, "CanvasRenderingContext2D": false, "CDATASection": false, "ChannelMergerNode": false, "ChannelSplitterNode": false, "CharacterData": false, "clearInterval": false, "clearTimeout": false, "clientInformation": false, "ClientRect": false, "ClientRectList": false, "ClipboardEvent": false, "close": false, "closed": false, "CloseEvent": false, "Comment": false, "CompositionEvent": false, "confirm": false, "console": false, "ConvolverNode": false, "createImageBitmap": false, "Credential": false, "CredentialsContainer": false, "crypto": false, "Crypto": false, "CryptoKey": false, "CSS": false, "CSSAnimation": false, "CSSFontFaceRule": false, "CSSImportRule": false, "CSSKeyframeRule": false, "CSSKeyframesRule": false, "CSSMediaRule": false, "CSSPageRule": false, "CSSRule": false, "CSSRuleList": false, "CSSStyleDeclaration": false, "CSSStyleRule": false, "CSSStyleSheet": false, "CSSSupportsRule": false, "CSSTransition": false, "CSSUnknownRule": false, "CSSViewportRule": false, "customElements": false, "CustomEvent": false, "DataTransfer": false, "DataTransferItem": false, "DataTransferItemList": false, "Debug": false, "defaultStatus": false, "defaultstatus": false, "DelayNode": false, "DeviceMotionEvent": false, "DeviceOrientationEvent": false, "devicePixelRatio": false, "dispatchEvent": false, "document": false, "Document": false, "DocumentFragment": false, "DocumentTimeline": false, "DocumentType": false, "DOMError": false, "DOMException": false, "DOMImplementation": false, "DOMParser": false, "DOMSettableTokenList": false, "DOMStringList": false, "DOMStringMap": false, "DOMTokenList": false, "DragEvent": false, "DynamicsCompressorNode": false, "Element": false, "ElementTimeControl": false, "ErrorEvent": false, "event": false, "Event": false, "EventSource": false, "EventTarget": false, "external": false, "FederatedCredential": false, "fetch": false, "File": false, "FileError": false, "FileList": false, "FileReader": false, "find": false, "focus": false, "FocusEvent": false, "FontFace": false, "FormData": false, "frameElement": false, "frames": false, "GainNode": false, "Gamepad": false, "GamepadButton": false, "GamepadEvent": false, "getComputedStyle": false, "getSelection": false, "HashChangeEvent": false, "Headers": false, "history": false, "History": false, "HTMLAllCollection": false, "HTMLAnchorElement": false, "HTMLAppletElement": false, "HTMLAreaElement": false, "HTMLAudioElement": false, "HTMLBaseElement": false, "HTMLBlockquoteElement": false, "HTMLBodyElement": false, "HTMLBRElement": false, "HTMLButtonElement": false, "HTMLCanvasElement": false, "HTMLCollection": false, "HTMLContentElement": false, "HTMLDataListElement": false, "HTMLDetailsElement": false, "HTMLDialogElement": false, "HTMLDirectoryElement": false, "HTMLDivElement": false, "HTMLDListElement": false, "HTMLDocument": false, "HTMLElement": false, "HTMLEmbedElement": false, "HTMLFieldSetElement": false, "HTMLFontElement": false, "HTMLFormControlsCollection": false, "HTMLFormElement": false, "HTMLFrameElement": false, "HTMLFrameSetElement": false, "HTMLHeadElement": false, "HTMLHeadingElement": false, "HTMLHRElement": false, "HTMLHtmlElement": false, "HTMLIFrameElement": false, "HTMLImageElement": false, "HTMLInputElement": false, "HTMLIsIndexElement": false, "HTMLKeygenElement": false, "HTMLLabelElement": false, "HTMLLayerElement": false, "HTMLLegendElement": false, "HTMLLIElement": false, "HTMLLinkElement": false, "HTMLMapElement": false, "HTMLMarqueeElement": false, "HTMLMediaElement": false, "HTMLMenuElement": false, "HTMLMetaElement": false, "HTMLMeterElement": false, "HTMLModElement": false, "HTMLObjectElement": false, "HTMLOListElement": false, "HTMLOptGroupElement": false, "HTMLOptionElement": false, "HTMLOptionsCollection": false, "HTMLOutputElement": false, "HTMLParagraphElement": false, "HTMLParamElement": false, "HTMLPictureElement": false, "HTMLPreElement": false, "HTMLProgressElement": false, "HTMLQuoteElement": false, "HTMLScriptElement": false, "HTMLSelectElement": false, "HTMLShadowElement": false, "HTMLSourceElement": false, "HTMLSpanElement": false, "HTMLStyleElement": false, "HTMLTableCaptionElement": false, "HTMLTableCellElement": false, "HTMLTableColElement": false, "HTMLTableElement": false, "HTMLTableRowElement": false, "HTMLTableSectionElement": false, "HTMLTemplateElement": false, "HTMLTextAreaElement": false, "HTMLTitleElement": false, "HTMLTrackElement": false, "HTMLUListElement": false, "HTMLUnknownElement": false, "HTMLVideoElement": false, "IDBCursor": false, "IDBCursorWithValue": false, "IDBDatabase": false, "IDBEnvironment": false, "IDBFactory": false, "IDBIndex": false, "IDBKeyRange": false, "IDBObjectStore": false, "IDBOpenDBRequest": false, "IDBRequest": false, "IDBTransaction": false, "IDBVersionChangeEvent": false, "Image": false, "ImageBitmap": false, "ImageData": false, "indexedDB": false, "innerHeight": false, "innerWidth": false, "InputEvent": false, "InputMethodContext": false, "IntersectionObserver": false, "IntersectionObserverEntry": false, "Intl": false, "KeyboardEvent": false, "KeyframeEffect": false, "KeyframeEffectReadOnly": false, "length": false, "localStorage": false, "location": false, "Location": false, "locationbar": false, "matchMedia": false, "MediaElementAudioSourceNode": false, "MediaEncryptedEvent": false, "MediaError": false, "MediaKeyError": false, "MediaKeyEvent": false, "MediaKeyMessageEvent": false, "MediaKeys": false, "MediaKeySession": false, "MediaKeyStatusMap": false, "MediaKeySystemAccess": false, "MediaList": false, "MediaQueryList": false, "MediaQueryListEvent": false, "MediaSource": false, "MediaRecorder": false, "MediaStream": false, "MediaStreamAudioDestinationNode": false, "MediaStreamAudioSourceNode": false, "MediaStreamEvent": false, "MediaStreamTrack": false, "menubar": false, "MessageChannel": false, "MessageEvent": false, "MessagePort": false, "MIDIAccess": false, "MIDIConnectionEvent": false, "MIDIInput": false, "MIDIInputMap": false, "MIDIMessageEvent": false, "MIDIOutput": false, "MIDIOutputMap": false, "MIDIPort": false, "MimeType": false, "MimeTypeArray": false, "MouseEvent": false, "moveBy": false, "moveTo": false, "MutationEvent": false, "MutationObserver": false, "MutationRecord": false, "name": false, "NamedNodeMap": false, "navigator": false, "Navigator": false, "Node": false, "NodeFilter": false, "NodeIterator": false, "NodeList": false, "Notification": false, "OfflineAudioCompletionEvent": false, "OfflineAudioContext": false, "offscreenBuffering": false, "onbeforeunload": true, "onblur": true, "onerror": true, "onfocus": true, "onload": true, "onresize": true, "onunload": true, "open": false, "openDatabase": false, "opener": false, "opera": false, "Option": false, "OscillatorNode": false, "outerHeight": false, "outerWidth": false, "PageTransitionEvent": false, "pageXOffset": false, "pageYOffset": false, "parent": false, "PasswordCredential": false, "Path2D": false, "performance": false, "Performance": false, "PerformanceEntry": false, "PerformanceMark": false, "PerformanceMeasure": false, "PerformanceNavigation": false, "PerformanceResourceTiming": false, "PerformanceTiming": false, "PeriodicWave": false, "Permissions": false, "PermissionStatus": false, "personalbar": false, "Plugin": false, "PluginArray": false, "PopStateEvent": false, "postMessage": false, "print": false, "ProcessingInstruction": false, "ProgressEvent": false, "PromiseRejectionEvent": false, "prompt": false, "PushManager": false, "PushSubscription": false, "RadioNodeList": false, "Range": false, "ReadableByteStream": false, "ReadableStream": false, "removeEventListener": false, "Request": false, "requestAnimationFrame": false, "requestIdleCallback": false, "resizeBy": false, "resizeTo": false, "Response": false, "RTCIceCandidate": false, "RTCSessionDescription": false, "RTCPeerConnection": false, "screen": false, "Screen": false, "screenLeft": false, "ScreenOrientation": false, "screenTop": false, "screenX": false, "screenY": false, "ScriptProcessorNode": false, "scroll": false, "scrollbars": false, "scrollBy": false, "scrollTo": false, "scrollX": false, "scrollY": false, "SecurityPolicyViolationEvent": false, "Selection": false, "self": false, "ServiceWorker": false, "ServiceWorkerContainer": false, "ServiceWorkerRegistration": false, "sessionStorage": false, "setInterval": false, "setTimeout": false, "ShadowRoot": false, "SharedKeyframeList": false, "SharedWorker": false, "showModalDialog": false, "SiteBoundCredential": false, "speechSynthesis": false, "SpeechSynthesisEvent": false, "SpeechSynthesisUtterance": false, "status": false, "statusbar": false, "stop": false, "Storage": false, "StorageEvent": false, "styleMedia": false, "StyleSheet": false, "StyleSheetList": false, "SubtleCrypto": false, "SVGAElement": false, "SVGAltGlyphDefElement": false, "SVGAltGlyphElement": false, "SVGAltGlyphItemElement": false, "SVGAngle": false, "SVGAnimateColorElement": false, "SVGAnimatedAngle": false, "SVGAnimatedBoolean": false, "SVGAnimatedEnumeration": false, "SVGAnimatedInteger": false, "SVGAnimatedLength": false, "SVGAnimatedLengthList": false, "SVGAnimatedNumber": false, "SVGAnimatedNumberList": false, "SVGAnimatedPathData": false, "SVGAnimatedPoints": false, "SVGAnimatedPreserveAspectRatio": false, "SVGAnimatedRect": false, "SVGAnimatedString": false, "SVGAnimatedTransformList": false, "SVGAnimateElement": false, "SVGAnimateMotionElement": false, "SVGAnimateTransformElement": false, "SVGAnimationElement": false, "SVGCircleElement": false, "SVGClipPathElement": false, "SVGColor": false, "SVGColorProfileElement": false, "SVGColorProfileRule": false, "SVGComponentTransferFunctionElement": false, "SVGCSSRule": false, "SVGCursorElement": false, "SVGDefsElement": false, "SVGDescElement": false, "SVGDiscardElement": false, "SVGDocument": false, "SVGElement": false, "SVGElementInstance": false, "SVGElementInstanceList": false, "SVGEllipseElement": false, "SVGEvent": false, "SVGExternalResourcesRequired": false, "SVGFEBlendElement": false, "SVGFEColorMatrixElement": false, "SVGFEComponentTransferElement": false, "SVGFECompositeElement": false, "SVGFEConvolveMatrixElement": false, "SVGFEDiffuseLightingElement": false, "SVGFEDisplacementMapElement": false, "SVGFEDistantLightElement": false, "SVGFEDropShadowElement": false, "SVGFEFloodElement": false, "SVGFEFuncAElement": false, "SVGFEFuncBElement": false, "SVGFEFuncGElement": false, "SVGFEFuncRElement": false, "SVGFEGaussianBlurElement": false, "SVGFEImageElement": false, "SVGFEMergeElement": false, "SVGFEMergeNodeElement": false, "SVGFEMorphologyElement": false, "SVGFEOffsetElement": false, "SVGFEPointLightElement": false, "SVGFESpecularLightingElement": false, "SVGFESpotLightElement": false, "SVGFETileElement": false, "SVGFETurbulenceElement": false, "SVGFilterElement": false, "SVGFilterPrimitiveStandardAttributes": false, "SVGFitToViewBox": false, "SVGFontElement": false, "SVGFontFaceElement": false, "SVGFontFaceFormatElement": false, "SVGFontFaceNameElement": false, "SVGFontFaceSrcElement": false, "SVGFontFaceUriElement": false, "SVGForeignObjectElement": false, "SVGGElement": false, "SVGGeometryElement": false, "SVGGlyphElement": false, "SVGGlyphRefElement": false, "SVGGradientElement": false, "SVGGraphicsElement": false, "SVGHKernElement": false, "SVGICCColor": false, "SVGImageElement": false, "SVGLangSpace": false, "SVGLength": false, "SVGLengthList": false, "SVGLinearGradientElement": false, "SVGLineElement": false, "SVGLocatable": false, "SVGMarkerElement": false, "SVGMaskElement": false, "SVGMatrix": false, "SVGMetadataElement": false, "SVGMissingGlyphElement": false, "SVGMPathElement": false, "SVGNumber": false, "SVGNumberList": false, "SVGPaint": false, "SVGPathElement": false, "SVGPathSeg": false, "SVGPathSegArcAbs": false, "SVGPathSegArcRel": false, "SVGPathSegClosePath": false, "SVGPathSegCurvetoCubicAbs": false, "SVGPathSegCurvetoCubicRel": false, "SVGPathSegCurvetoCubicSmoothAbs": false, "SVGPathSegCurvetoCubicSmoothRel": false, "SVGPathSegCurvetoQuadraticAbs": false, "SVGPathSegCurvetoQuadraticRel": false, "SVGPathSegCurvetoQuadraticSmoothAbs": false, "SVGPathSegCurvetoQuadraticSmoothRel": false, "SVGPathSegLinetoAbs": false, "SVGPathSegLinetoHorizontalAbs": false, "SVGPathSegLinetoHorizontalRel": false, "SVGPathSegLinetoRel": false, "SVGPathSegLinetoVerticalAbs": false, "SVGPathSegLinetoVerticalRel": false, "SVGPathSegList": false, "SVGPathSegMovetoAbs": false, "SVGPathSegMovetoRel": false, "SVGPatternElement": false, "SVGPoint": false, "SVGPointList": false, "SVGPolygonElement": false, "SVGPolylineElement": false, "SVGPreserveAspectRatio": false, "SVGRadialGradientElement": false, "SVGRect": false, "SVGRectElement": false, "SVGRenderingIntent": false, "SVGScriptElement": false, "SVGSetElement": false, "SVGStopElement": false, "SVGStringList": false, "SVGStylable": false, "SVGStyleElement": false, "SVGSVGElement": false, "SVGSwitchElement": false, "SVGSymbolElement": false, "SVGTests": false, "SVGTextContentElement": false, "SVGTextElement": false, "SVGTextPathElement": false, "SVGTextPositioningElement": false, "SVGTitleElement": false, "SVGTransform": false, "SVGTransformable": false, "SVGTransformList": false, "SVGTRefElement": false, "SVGTSpanElement": false, "SVGUnitTypes": false, "SVGURIReference": false, "SVGUseElement": false, "SVGViewElement": false, "SVGViewSpec": false, "SVGVKernElement": false, "SVGZoomAndPan": false, "SVGZoomEvent": false, "Text": false, "TextDecoder": false, "TextEncoder": false, "TextEvent": false, "TextMetrics": false, "TextTrack": false, "TextTrackCue": false, "TextTrackCueList": false, "TextTrackList": false, "TimeEvent": false, "TimeRanges": false, "toolbar": false, "top": false, "Touch": false, "TouchEvent": false, "TouchList": false, "TrackEvent": false, "TransitionEvent": false, "TreeWalker": false, "UIEvent": false, "URL": false, "URLSearchParams": false, "ValidityState": false, "VTTCue": false, "WaveShaperNode": false, "WebGLActiveInfo": false, "WebGLBuffer": false, "WebGLContextEvent": false, "WebGLFramebuffer": false, "WebGLProgram": false, "WebGLRenderbuffer": false, "WebGLRenderingContext": false, "WebGLShader": false, "WebGLShaderPrecisionFormat": false, "WebGLTexture": false, "WebGLUniformLocation": false, "WebSocket": false, "WheelEvent": false, "window": false, "Window": false, "Worker": false, "XDomainRequest": false, "XMLDocument": false, "XMLHttpRequest": false, "XMLHttpRequestEventTarget": false, "XMLHttpRequestProgressEvent": false, "XMLHttpRequestUpload": false, "XMLSerializer": false, "XPathEvaluator": false, "XPathException": false, "XPathExpression": false, "XPathNamespace": false, "XPathNSResolver": false, "XPathResult": false, "XSLTProcessor": false }, "worker": { "applicationCache": false, "atob": false, "Blob": false, "BroadcastChannel": false, "btoa": false, "Cache": false, "caches": false, "clearInterval": false, "clearTimeout": false, "close": true, "console": false, "fetch": false, "FileReaderSync": false, "FormData": false, "Headers": false, "IDBCursor": false, "IDBCursorWithValue": false, "IDBDatabase": false, "IDBFactory": false, "IDBIndex": false, "IDBKeyRange": false, "IDBObjectStore": false, "IDBOpenDBRequest": false, "IDBRequest": false, "IDBTransaction": false, "IDBVersionChangeEvent": false, "ImageData": false, "importScripts": true, "indexedDB": false, "location": false, "MessageChannel": false, "MessagePort": false, "name": false, "navigator": false, "Notification": false, "onclose": true, "onconnect": true, "onerror": true, "onlanguagechange": true, "onmessage": true, "onoffline": true, "ononline": true, "onrejectionhandled": true, "onunhandledrejection": true, "performance": false, "Performance": false, "PerformanceEntry": false, "PerformanceMark": false, "PerformanceMeasure": false, "PerformanceNavigation": false, "PerformanceResourceTiming": false, "PerformanceTiming": false, "postMessage": true, "Promise": false, "Request": false, "Response": false, "self": true, "ServiceWorkerRegistration": false, "setInterval": false, "setTimeout": false, "TextDecoder": false, "TextEncoder": false, "URL": false, "URLSearchParams": false, "WebSocket": false, "Worker": false, "XMLHttpRequest": false }, "node": { "__dirname": false, "__filename": false, "arguments": false, "Buffer": false, "clearImmediate": false, "clearInterval": false, "clearTimeout": false, "console": false, "exports": true, "GLOBAL": false, "global": false, "Intl": false, "module": false, "process": false, "require": false, "root": false, "setImmediate": false, "setInterval": false, "setTimeout": false }, "commonjs": { "exports": true, "module": false, "require": false, "global": false }, "amd": { "define": false, "require": false }, "mocha": { "after": false, "afterEach": false, "before": false, "beforeEach": false, "context": false, "describe": false, "it": false, "mocha": false, "run": false, "setup": false, "specify": false, "suite": false, "suiteSetup": false, "suiteTeardown": false, "teardown": false, "test": false, "xcontext": false, "xdescribe": false, "xit": false, "xspecify": false }, "jasmine": { "afterAll": false, "afterEach": false, "beforeAll": false, "beforeEach": false, "describe": false, "expect": false, "fail": false, "fdescribe": false, "fit": false, "it": false, "jasmine": false, "pending": false, "runs": false, "spyOn": false, "spyOnProperty": false, "waits": false, "waitsFor": false, "xdescribe": false, "xit": false }, "jest": { "afterAll": false, "afterEach": false, "beforeAll": false, "beforeEach": false, "check": false, "describe": false, "expect": false, "gen": false, "it": false, "fdescribe": false, "fit": false, "jest": false, "pit": false, "require": false, "test": false, "xdescribe": false, "xit": false, "xtest": false }, "qunit": { "asyncTest": false, "deepEqual": false, "equal": false, "expect": false, "module": false, "notDeepEqual": false, "notEqual": false, "notOk": false, "notPropEqual": false, "notStrictEqual": false, "ok": false, "propEqual": false, "QUnit": false, "raises": false, "start": false, "stop": false, "strictEqual": false, "test": false, "throws": false }, "phantomjs": { "console": true, "exports": true, "phantom": true, "require": true, "WebPage": true }, "couch": { "emit": false, "exports": false, "getRow": false, "log": false, "module": false, "provides": false, "require": false, "respond": false, "send": false, "start": false, "sum": false }, "rhino": { "defineClass": false, "deserialize": false, "gc": false, "help": false, "importClass": false, "importPackage": false, "java": false, "load": false, "loadClass": false, "Packages": false, "print": false, "quit": false, "readFile": false, "readUrl": false, "runCommand": false, "seal": false, "serialize": false, "spawn": false, "sync": false, "toint32": false, "version": false }, "nashorn": { "__DIR__": false, "__FILE__": false, "__LINE__": false, "com": false, "edu": false, "exit": false, "Java": false, "java": false, "javafx": false, "JavaImporter": false, "javax": false, "JSAdapter": false, "load": false, "loadWithNewGlobal": false, "org": false, "Packages": false, "print": false, "quit": false }, "wsh": { "ActiveXObject": true, "Enumerator": true, "GetObject": true, "ScriptEngine": true, "ScriptEngineBuildVersion": true, "ScriptEngineMajorVersion": true, "ScriptEngineMinorVersion": true, "VBArray": true, "WScript": true, "WSH": true, "XDomainRequest": true }, "jquery": { "$": false, "jQuery": false }, "yui": { "Y": false, "YUI": false, "YUI_config": false }, "shelljs": { "cat": false, "cd": false, "chmod": false, "config": false, "cp": false, "dirs": false, "echo": false, "env": false, "error": false, "exec": false, "exit": false, "find": false, "grep": false, "ls": false, "ln": false, "mkdir": false, "mv": false, "popd": false, "pushd": false, "pwd": false, "rm": false, "sed": false, "set": false, "target": false, "tempdir": false, "test": false, "touch": false, "which": false }, "prototypejs": { "$": false, "$$": false, "$A": false, "$break": false, "$continue": false, "$F": false, "$H": false, "$R": false, "$w": false, "Abstract": false, "Ajax": false, "Autocompleter": false, "Builder": false, "Class": false, "Control": false, "Draggable": false, "Draggables": false, "Droppables": false, "Effect": false, "Element": false, "Enumerable": false, "Event": false, "Field": false, "Form": false, "Hash": false, "Insertion": false, "ObjectRange": false, "PeriodicalExecuter": false, "Position": false, "Prototype": false, "Scriptaculous": false, "Selector": false, "Sortable": false, "SortableObserver": false, "Sound": false, "Template": false, "Toggle": false, "Try": false }, "meteor": { "$": false, "_": false, "Accounts": false, "AccountsClient": false, "AccountsServer": false, "AccountsCommon": false, "App": false, "Assets": false, "Blaze": false, "check": false, "Cordova": false, "DDP": false, "DDPServer": false, "DDPRateLimiter": false, "Deps": false, "EJSON": false, "Email": false, "HTTP": false, "Log": false, "Match": false, "Meteor": false, "Mongo": false, "MongoInternals": false, "Npm": false, "Package": false, "Plugin": false, "process": false, "Random": false, "ReactiveDict": false, "ReactiveVar": false, "Router": false, "ServiceConfiguration": false, "Session": false, "share": false, "Spacebars": false, "Template": false, "Tinytest": false, "Tracker": false, "UI": false, "Utils": false, "WebApp": false, "WebAppInternals": false }, "mongo": { "_isWindows": false, "_rand": false, "BulkWriteResult": false, "cat": false, "cd": false, "connect": false, "db": false, "getHostName": false, "getMemInfo": false, "hostname": false, "ISODate": false, "listFiles": false, "load": false, "ls": false, "md5sumFile": false, "mkdir": false, "Mongo": false, "NumberInt": false, "NumberLong": false, "ObjectId": false, "PlanCache": false, "print": false, "printjson": false, "pwd": false, "quit": false, "removeFile": false, "rs": false, "sh": false, "UUID": false, "version": false, "WriteResult": false }, "applescript": { "$": false, "Application": false, "Automation": false, "console": false, "delay": false, "Library": false, "ObjC": false, "ObjectSpecifier": false, "Path": false, "Progress": false, "Ref": false }, "serviceworker": { "caches": false, "Cache": false, "CacheStorage": false, "Client": false, "clients": false, "Clients": false, "ExtendableEvent": false, "ExtendableMessageEvent": false, "FetchEvent": false, "importScripts": false, "registration": false, "self": false, "ServiceWorker": false, "ServiceWorkerContainer": false, "ServiceWorkerGlobalScope": false, "ServiceWorkerMessageEvent": false, "ServiceWorkerRegistration": false, "skipWaiting": false, "WindowClient": false }, "atomtest": { "advanceClock": false, "fakeClearInterval": false, "fakeClearTimeout": false, "fakeSetInterval": false, "fakeSetTimeout": false, "resetTimeouts": false, "waitsForPromise": false }, "embertest": { "andThen": false, "click": false, "currentPath": false, "currentRouteName": false, "currentURL": false, "fillIn": false, "find": false, "findWithAssert": false, "keyEvent": false, "pauseTest": false, "resumeTest": false, "triggerEvent": false, "visit": false }, "protractor": { "$": false, "$$": false, "browser": false, "By": false, "by": false, "DartObject": false, "element": false, "protractor": false }, "shared-node-browser": { "clearInterval": false, "clearTimeout": false, "console": false, "setInterval": false, "setTimeout": false }, "webextensions": { "browser": false, "chrome": false, "opr": false }, "greasemonkey": { "GM_addStyle": false, "GM_deleteValue": false, "GM_getResourceText": false, "GM_getResourceURL": false, "GM_getValue": false, "GM_info": false, "GM_listValues": false, "GM_log": false, "GM_openInTab": false, "GM_registerMenuCommand": false, "GM_setClipboard": false, "GM_setValue": false, "GM_xmlhttpRequest": false, "unsafeWindow": false } } },{}],13:[function(require,module,exports){ 'use strict'; module.exports = require('./globals.json'); },{"./globals.json":12}],14:[function(require,module,exports){ (function (process){ 'use strict'; var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i];descriptor.enumerable = descriptor.enumerable || false;descriptor.configurable = true;if ("value" in descriptor) descriptor.writable = true;Object.defineProperty(target, descriptor.key, descriptor); } }return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps);if (staticProps) defineProperties(Constructor, staticProps);return Constructor; }; }(); function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } module.exports = function () { return new IgnoreBase(); }; // A simple implementation of make-array function make_array(subject) { return Array.isArray(subject) ? subject : [subject]; } var REGEX_BLANK_LINE = /^\s+$/; var REGEX_LEADING_EXCAPED_EXCLAMATION = /^\\\!/; var REGEX_LEADING_EXCAPED_HASH = /^\\#/; var SLASH = '/'; var IgnoreBase = function () { function IgnoreBase() { _classCallCheck(this, IgnoreBase); this._rules = []; this._initCache(); } _createClass(IgnoreBase, [{ key: '_initCache', value: function _initCache() { this._cache = {}; } // @param {Array.|string|Ignore} pattern }, { key: 'add', value: function add(pattern) { this._added = false; if (typeof pattern === 'string') { pattern = pattern.split(/\r?\n/g); } make_array(pattern).forEach(this._addPattern, this); // Some rules have just added to the ignore, // making the behavior changed. if (this._added) { this._initCache(); } return this; } // legacy }, { key: 'addPattern', value: function addPattern(pattern) { return this.add(pattern); } }, { key: '_addPattern', value: function _addPattern(pattern) { if (pattern instanceof IgnoreBase) { this._rules = this._rules.concat(pattern._rules); this._added = true; return; } if (this._checkPattern(pattern)) { var rule = this._createRule(pattern); this._added = true; this._rules.push(rule); } } }, { key: '_checkPattern', value: function _checkPattern(pattern) { // > A blank line matches no files, so it can serve as a separator for readability. return pattern && typeof pattern === 'string' && !REGEX_BLANK_LINE.test(pattern // > A line starting with # serves as a comment. ) && pattern.indexOf('#') !== 0; } }, { key: 'filter', value: function filter(paths) { var _this = this; return make_array(paths).filter(function (path) { return _this._filter(path); }); } }, { key: 'createFilter', value: function createFilter() { var _this2 = this; return function (path) { return _this2._filter(path); }; } }, { key: 'ignores', value: function ignores(path) { return !this._filter(path); } }, { key: '_createRule', value: function _createRule(pattern) { var origin = pattern; var negative = false; // > An optional prefix "!" which negates the pattern; if (pattern.indexOf('!') === 0) { negative = true; pattern = pattern.substr(1); } pattern = pattern // > Put a backslash ("\") in front of the first "!" for patterns that begin with a literal "!", for example, `"\!important!.txt"`. .replace(REGEX_LEADING_EXCAPED_EXCLAMATION, '!' // > Put a backslash ("\") in front of the first hash for patterns that begin with a hash. ).replace(REGEX_LEADING_EXCAPED_HASH, '#'); var regex = make_regex(pattern, negative); return { origin: origin, pattern: pattern, negative: negative, regex: regex }; } // @returns `Boolean` true if the `path` is NOT ignored }, { key: '_filter', value: function _filter(path, slices) { if (!path) { return false; } if (path in this._cache) { return this._cache[path]; } if (!slices) { // path/to/a.js // ['path', 'to', 'a.js'] slices = path.split(SLASH); // '/b/a.js' -> ['', 'b', 'a.js'] -> [''] if (slices.length && !slices[0]) { slices = slices.slice(1); slices[0] = SLASH + slices[0]; } } slices.pop(); return this._cache[path] = slices.length // > It is not possible to re-include a file if a parent directory of that file is excluded. // If the path contains a parent directory, check the parent first ? this._filter(slices.join(SLASH) + SLASH, slices) && this._test(path // Or only test the path ) : this._test(path); } // @returns {Boolean} true if a file is NOT ignored }, { key: '_test', value: function _test(path) { // Explicitly define variable type by setting matched to `0` var matched = 0; this._rules.forEach(function (rule) { // if matched = true, then we only test negative rules // if matched = false, then we test non-negative rules if (!(matched ^ rule.negative)) { matched = rule.negative ^ rule.regex.test(path); } }); return !matched; } }]); return IgnoreBase; }(); // > If the pattern ends with a slash, // > it is removed for the purpose of the following description, // > but it would only find a match with a directory. // > In other words, foo/ will match a directory foo and paths underneath it, // > but will not match a regular file or a symbolic link foo // > (this is consistent with the way how pathspec works in general in Git). // '`foo/`' will not match regular file '`foo`' or symbolic link '`foo`' // -> ignore-rules will not deal with it, because it costs extra `fs.stat` call // you could use option `mark: true` with `glob` // '`foo/`' should not continue with the '`..`' var DEFAULT_REPLACER_PREFIX = [ // > Trailing spaces are ignored unless they are quoted with backslash ("\") [ // (a\ ) -> (a ) // (a ) -> (a) // (a \ ) -> (a ) /\\?\s+$/, function (match) { return match.indexOf('\\') === 0 ? ' ' : ''; }], // replace (\ ) with ' ' [/\\\s/g, function () { return ' '; }], // Escape metacharacters // which is written down by users but means special for regular expressions. // > There are 12 characters with special meanings: // > - the backslash \, // > - the caret ^, // > - the dollar sign $, // > - the period or dot ., // > - the vertical bar or pipe symbol |, // > - the question mark ?, // > - the asterisk or star *, // > - the plus sign +, // > - the opening parenthesis (, // > - the closing parenthesis ), // > - and the opening square bracket [, // > - the opening curly brace {, // > These special characters are often called "metacharacters". [/[\\\^$.|?*+()\[{]/g, function (match) { return '\\' + match; }], // leading slash [ // > A leading slash matches the beginning of the pathname. // > For example, "/*.c" matches "cat-file.c" but not "mozilla-sha1/sha1.c". // A leading slash matches the beginning of the pathname /^\//, function () { return '^'; }], // replace special metacharacter slash after the leading slash [/\//g, function () { return '\\/'; }], [ // > A leading "**" followed by a slash means match in all directories. // > For example, "**/foo" matches file or directory "foo" anywhere, // > the same as pattern "foo". // > "**/foo/bar" matches file or directory "bar" anywhere that is directly under directory "foo". // Notice that the '*'s have been replaced as '\\*' /^\^*\\\*\\\*\\\//, // '**/foo' <-> 'foo' function () { return '^(?:.*\\/)?'; }]]; var DEFAULT_REPLACER_SUFFIX = [ // starting [ // there will be no leading '/' (which has been replaced by section "leading slash") // If starts with '**', adding a '^' to the regular expression also works /^(?=[^\^])/, function () { return !/\/(?!$)/.test(this // > If the pattern does not contain a slash /, Git treats it as a shell glob pattern // Actually, if there is only a trailing slash, git also treats it as a shell glob pattern ) ? '(?:^|\\/)' // > Otherwise, Git treats the pattern as a shell glob suitable for consumption by fnmatch(3) : '^'; }], // two globstars [ // Use lookahead assertions so that we could match more than one `'/**'` /\\\/\\\*\\\*(?=\\\/|$)/g, // Zero, one or several directories // should not use '*', or it will be replaced by the next replacer // Check if it is not the last `'/**'` function (match, index, str) { return index + 6 < str.length // case: /**/ // > A slash followed by two consecutive asterisks then a slash matches zero or more directories. // > For example, "a/**/b" matches "a/b", "a/x/b", "a/x/y/b" and so on. // '/**/' ? '(?:\\/[^\\/]+)*' // case: /** // > A trailing `"/**"` matches everything inside. // #21: everything inside but it should not include the current folder : '\\/.+'; }], // intermediate wildcards [ // Never replace escaped '*' // ignore rule '\*' will match the path '*' // 'abc.*/' -> go // 'abc.*' -> skip this rule /(^|[^\\]+)\\\*(?=.+)/g, // '*.js' matches '.js' // '*.js' doesn't match 'abc' function (match, p1) { return p1 + '[^\\/]*'; }], // trailing wildcard [/(\^|\\\/)?\\\*$/, function (match, p1) { return (p1 // '\^': // '/*' does not match '' // '/*' does not match everything // '\\\/': // 'abc/*' does not match 'abc/' ? p1 + '[^/]+' // 'a*' matches 'a' // 'a*' matches 'aa' : '[^/]*') + '(?=$|\\/$)'; }], [ // unescape /\\\\\\/g, function () { return '\\'; }]]; var POSITIVE_REPLACERS = [].concat(DEFAULT_REPLACER_PREFIX, [ // 'f' // matches // - /f(end) // - /f/ // - (start)f(end) // - (start)f/ // doesn't match // - oof // - foo // pseudo: // -> (^|/)f(/|$) // ending [ // 'js' will not match 'js.' // 'ab' will not match 'abc' /(?:[^*\/])$/, // 'js*' will not match 'a.js' // 'js/' will not match 'a.js' // 'js' will match 'a.js' and 'a.js/' function (match) { return match + '(?=$|\\/)'; }]], DEFAULT_REPLACER_SUFFIX); var NEGATIVE_REPLACERS = [].concat(DEFAULT_REPLACER_PREFIX, [ // #24 // The MISSING rule of [gitignore docs](https://git-scm.com/docs/gitignore) // A negative pattern without a trailing wildcard should not // re-include the things inside that directory. // eg: // ['node_modules/*', '!node_modules'] // should ignore `node_modules/a.js` [/(?:[^*\/])$/, function (match) { return match + '(?=$|\\/$)'; }]], DEFAULT_REPLACER_SUFFIX); // A simple cache, because an ignore rule only has only one certain meaning var cache = {}; // @param {pattern} function make_regex(pattern, negative) { var r = cache[pattern]; if (r) { return r; } var replacers = negative ? NEGATIVE_REPLACERS : POSITIVE_REPLACERS; var source = replacers.reduce(function (prev, current) { return prev.replace(current[0], current[1].bind(pattern)); }, pattern); return cache[pattern] = new RegExp(source, 'i'); } // Windows // -------------------------------------------------------------- /* istanbul ignore if */ if (process.env.IGNORE_TEST_WIN32 || process.platform === 'win32') { var filter = IgnoreBase.prototype._filter; var make_posix = function make_posix(str) { return (/^\\\\\?\\/.test(str) || /[^\x00-\x80]+/.test(str) ? str : str.replace(/\\/g, '/') ); }; IgnoreBase.prototype._filter = function (path, slices) { path = make_posix(path); return filter.call(this, path, slices); }; } }).call(this,require('_process')) },{"_process":18}],15:[function(require,module,exports){ 'use strict'; var toString = {}.toString; module.exports = Array.isArray || function (arr) { return toString.call(arr) == '[object Array]'; }; },{}],16:[function(require,module,exports){ (function (global){ 'use strict';var _typeof=typeof Symbol==="function"&&typeof Symbol.iterator==="symbol"?function(obj){return typeof obj;}:function(obj){return obj&&typeof Symbol==="function"&&obj.constructor===Symbol&&obj!==Symbol.prototype?"symbol":typeof obj;};/** * @license * Lodash * Copyright JS Foundation and other contributors * Released under MIT license * Based on Underscore.js 1.8.3 * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors */;(function(){/** Used as a safe reference for `undefined` in pre-ES5 environments. */var undefined;/** Used as the semantic version number. */var VERSION='4.17.4';/** Used as the size to enable large array optimizations. */var LARGE_ARRAY_SIZE=200;/** Error message constants. */var CORE_ERROR_TEXT='Unsupported core-js use. Try https://npms.io/search?q=ponyfill.',FUNC_ERROR_TEXT='Expected a function';/** Used to stand-in for `undefined` hash values. */var HASH_UNDEFINED='__lodash_hash_undefined__';/** Used as the maximum memoize cache size. */var MAX_MEMOIZE_SIZE=500;/** Used as the internal argument placeholder. */var PLACEHOLDER='__lodash_placeholder__';/** Used to compose bitmasks for cloning. */var CLONE_DEEP_FLAG=1,CLONE_FLAT_FLAG=2,CLONE_SYMBOLS_FLAG=4;/** Used to compose bitmasks for value comparisons. */var COMPARE_PARTIAL_FLAG=1,COMPARE_UNORDERED_FLAG=2;/** Used to compose bitmasks for function metadata. */var WRAP_BIND_FLAG=1,WRAP_BIND_KEY_FLAG=2,WRAP_CURRY_BOUND_FLAG=4,WRAP_CURRY_FLAG=8,WRAP_CURRY_RIGHT_FLAG=16,WRAP_PARTIAL_FLAG=32,WRAP_PARTIAL_RIGHT_FLAG=64,WRAP_ARY_FLAG=128,WRAP_REARG_FLAG=256,WRAP_FLIP_FLAG=512;/** Used as default options for `_.truncate`. */var DEFAULT_TRUNC_LENGTH=30,DEFAULT_TRUNC_OMISSION='...';/** Used to detect hot functions by number of calls within a span of milliseconds. */var HOT_COUNT=800,HOT_SPAN=16;/** Used to indicate the type of lazy iteratees. */var LAZY_FILTER_FLAG=1,LAZY_MAP_FLAG=2,LAZY_WHILE_FLAG=3;/** Used as references for various `Number` constants. */var INFINITY=1/0,MAX_SAFE_INTEGER=9007199254740991,MAX_INTEGER=1.7976931348623157e+308,NAN=0/0;/** Used as references for the maximum length and index of an array. */var MAX_ARRAY_LENGTH=4294967295,MAX_ARRAY_INDEX=MAX_ARRAY_LENGTH-1,HALF_MAX_ARRAY_LENGTH=MAX_ARRAY_LENGTH>>>1;/** Used to associate wrap methods with their bit flags. */var wrapFlags=[['ary',WRAP_ARY_FLAG],['bind',WRAP_BIND_FLAG],['bindKey',WRAP_BIND_KEY_FLAG],['curry',WRAP_CURRY_FLAG],['curryRight',WRAP_CURRY_RIGHT_FLAG],['flip',WRAP_FLIP_FLAG],['partial',WRAP_PARTIAL_FLAG],['partialRight',WRAP_PARTIAL_RIGHT_FLAG],['rearg',WRAP_REARG_FLAG]];/** `Object#toString` result references. */var argsTag='[object Arguments]',arrayTag='[object Array]',asyncTag='[object AsyncFunction]',boolTag='[object Boolean]',dateTag='[object Date]',domExcTag='[object DOMException]',errorTag='[object Error]',funcTag='[object Function]',genTag='[object GeneratorFunction]',mapTag='[object Map]',numberTag='[object Number]',nullTag='[object Null]',objectTag='[object Object]',promiseTag='[object Promise]',proxyTag='[object Proxy]',regexpTag='[object RegExp]',setTag='[object Set]',stringTag='[object String]',symbolTag='[object Symbol]',undefinedTag='[object Undefined]',weakMapTag='[object WeakMap]',weakSetTag='[object WeakSet]';var arrayBufferTag='[object ArrayBuffer]',dataViewTag='[object DataView]',float32Tag='[object Float32Array]',float64Tag='[object Float64Array]',int8Tag='[object Int8Array]',int16Tag='[object Int16Array]',int32Tag='[object Int32Array]',uint8Tag='[object Uint8Array]',uint8ClampedTag='[object Uint8ClampedArray]',uint16Tag='[object Uint16Array]',uint32Tag='[object Uint32Array]';/** Used to match empty string literals in compiled template source. */var reEmptyStringLeading=/\b__p \+= '';/g,reEmptyStringMiddle=/\b(__p \+=) '' \+/g,reEmptyStringTrailing=/(__e\(.*?\)|\b__t\)) \+\n'';/g;/** Used to match HTML entities and HTML characters. */var reEscapedHtml=/&(?:amp|lt|gt|quot|#39);/g,reUnescapedHtml=/[&<>"']/g,reHasEscapedHtml=RegExp(reEscapedHtml.source),reHasUnescapedHtml=RegExp(reUnescapedHtml.source);/** Used to match template delimiters. */var reEscape=/<%-([\s\S]+?)%>/g,reEvaluate=/<%([\s\S]+?)%>/g,reInterpolate=/<%=([\s\S]+?)%>/g;/** Used to match property names within property paths. */var reIsDeepProp=/\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/,reIsPlainProp=/^\w*$/,reLeadingDot=/^\./,rePropName=/[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g;/** * Used to match `RegExp` * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns). */var reRegExpChar=/[\\^$.*+?()[\]{}|]/g,reHasRegExpChar=RegExp(reRegExpChar.source);/** Used to match leading and trailing whitespace. */var reTrim=/^\s+|\s+$/g,reTrimStart=/^\s+/,reTrimEnd=/\s+$/;/** Used to match wrap detail comments. */var reWrapComment=/\{(?:\n\/\* \[wrapped with .+\] \*\/)?\n?/,reWrapDetails=/\{\n\/\* \[wrapped with (.+)\] \*/,reSplitDetails=/,? & /;/** Used to match words composed of alphanumeric characters. */var reAsciiWord=/[^\x00-\x2f\x3a-\x40\x5b-\x60\x7b-\x7f]+/g;/** Used to match backslashes in property paths. */var reEscapeChar=/\\(\\)?/g;/** * Used to match * [ES template delimiters](http://ecma-international.org/ecma-262/7.0/#sec-template-literal-lexical-components). */var reEsTemplate=/\$\{([^\\}]*(?:\\.[^\\}]*)*)\}/g;/** Used to match `RegExp` flags from their coerced string values. */var reFlags=/\w*$/;/** Used to detect bad signed hexadecimal string values. */var reIsBadHex=/^[-+]0x[0-9a-f]+$/i;/** Used to detect binary string values. */var reIsBinary=/^0b[01]+$/i;/** Used to detect host constructors (Safari). */var reIsHostCtor=/^\[object .+?Constructor\]$/;/** Used to detect octal string values. */var reIsOctal=/^0o[0-7]+$/i;/** Used to detect unsigned integer values. */var reIsUint=/^(?:0|[1-9]\d*)$/;/** Used to match Latin Unicode letters (excluding mathematical operators). */var reLatin=/[\xc0-\xd6\xd8-\xf6\xf8-\xff\u0100-\u017f]/g;/** Used to ensure capturing order of template delimiters. */var reNoMatch=/($^)/;/** Used to match unescaped characters in compiled string literals. */var reUnescapedString=/['\n\r\u2028\u2029\\]/g;/** Used to compose unicode character classes. */var rsAstralRange='\\ud800-\\udfff',rsComboMarksRange='\\u0300-\\u036f',reComboHalfMarksRange='\\ufe20-\\ufe2f',rsComboSymbolsRange='\\u20d0-\\u20ff',rsComboRange=rsComboMarksRange+reComboHalfMarksRange+rsComboSymbolsRange,rsDingbatRange='\\u2700-\\u27bf',rsLowerRange='a-z\\xdf-\\xf6\\xf8-\\xff',rsMathOpRange='\\xac\\xb1\\xd7\\xf7',rsNonCharRange='\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\xbf',rsPunctuationRange='\\u2000-\\u206f',rsSpaceRange=' \\t\\x0b\\f\\xa0\\ufeff\\n\\r\\u2028\\u2029\\u1680\\u180e\\u2000\\u2001\\u2002\\u2003\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200a\\u202f\\u205f\\u3000',rsUpperRange='A-Z\\xc0-\\xd6\\xd8-\\xde',rsVarRange='\\ufe0e\\ufe0f',rsBreakRange=rsMathOpRange+rsNonCharRange+rsPunctuationRange+rsSpaceRange;/** Used to compose unicode capture groups. */var rsApos='[\'\u2019]',rsAstral='['+rsAstralRange+']',rsBreak='['+rsBreakRange+']',rsCombo='['+rsComboRange+']',rsDigits='\\d+',rsDingbat='['+rsDingbatRange+']',rsLower='['+rsLowerRange+']',rsMisc='[^'+rsAstralRange+rsBreakRange+rsDigits+rsDingbatRange+rsLowerRange+rsUpperRange+']',rsFitz='\\ud83c[\\udffb-\\udfff]',rsModifier='(?:'+rsCombo+'|'+rsFitz+')',rsNonAstral='[^'+rsAstralRange+']',rsRegional='(?:\\ud83c[\\udde6-\\uddff]){2}',rsSurrPair='[\\ud800-\\udbff][\\udc00-\\udfff]',rsUpper='['+rsUpperRange+']',rsZWJ='\\u200d';/** Used to compose unicode regexes. */var rsMiscLower='(?:'+rsLower+'|'+rsMisc+')',rsMiscUpper='(?:'+rsUpper+'|'+rsMisc+')',rsOptContrLower='(?:'+rsApos+'(?:d|ll|m|re|s|t|ve))?',rsOptContrUpper='(?:'+rsApos+'(?:D|LL|M|RE|S|T|VE))?',reOptMod=rsModifier+'?',rsOptVar='['+rsVarRange+']?',rsOptJoin='(?:'+rsZWJ+'(?:'+[rsNonAstral,rsRegional,rsSurrPair].join('|')+')'+rsOptVar+reOptMod+')*',rsOrdLower='\\d*(?:(?:1st|2nd|3rd|(?![123])\\dth)\\b)',rsOrdUpper='\\d*(?:(?:1ST|2ND|3RD|(?![123])\\dTH)\\b)',rsSeq=rsOptVar+reOptMod+rsOptJoin,rsEmoji='(?:'+[rsDingbat,rsRegional,rsSurrPair].join('|')+')'+rsSeq,rsSymbol='(?:'+[rsNonAstral+rsCombo+'?',rsCombo,rsRegional,rsSurrPair,rsAstral].join('|')+')';/** Used to match apostrophes. */var reApos=RegExp(rsApos,'g');/** * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols). */var reComboMark=RegExp(rsCombo,'g');/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */var reUnicode=RegExp(rsFitz+'(?='+rsFitz+')|'+rsSymbol+rsSeq,'g');/** Used to match complex or compound words. */var reUnicodeWord=RegExp([rsUpper+'?'+rsLower+'+'+rsOptContrLower+'(?='+[rsBreak,rsUpper,'$'].join('|')+')',rsMiscUpper+'+'+rsOptContrUpper+'(?='+[rsBreak,rsUpper+rsMiscLower,'$'].join('|')+')',rsUpper+'?'+rsMiscLower+'+'+rsOptContrLower,rsUpper+'+'+rsOptContrUpper,rsOrdUpper,rsOrdLower,rsDigits,rsEmoji].join('|'),'g');/** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */var reHasUnicode=RegExp('['+rsZWJ+rsAstralRange+rsComboRange+rsVarRange+']');/** Used to detect strings that need a more robust regexp to match words. */var reHasUnicodeWord=/[a-z][A-Z]|[A-Z]{2,}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;/** Used to assign default `context` object properties. */var contextProps=['Array','Buffer','DataView','Date','Error','Float32Array','Float64Array','Function','Int8Array','Int16Array','Int32Array','Map','Math','Object','Promise','RegExp','Set','String','Symbol','TypeError','Uint8Array','Uint8ClampedArray','Uint16Array','Uint32Array','WeakMap','_','clearTimeout','isFinite','parseInt','setTimeout'];/** Used to make template sourceURLs easier to identify. */var templateCounter=-1;/** Used to identify `toStringTag` values of typed arrays. */var typedArrayTags={};typedArrayTags[float32Tag]=typedArrayTags[float64Tag]=typedArrayTags[int8Tag]=typedArrayTags[int16Tag]=typedArrayTags[int32Tag]=typedArrayTags[uint8Tag]=typedArrayTags[uint8ClampedTag]=typedArrayTags[uint16Tag]=typedArrayTags[uint32Tag]=true;typedArrayTags[argsTag]=typedArrayTags[arrayTag]=typedArrayTags[arrayBufferTag]=typedArrayTags[boolTag]=typedArrayTags[dataViewTag]=typedArrayTags[dateTag]=typedArrayTags[errorTag]=typedArrayTags[funcTag]=typedArrayTags[mapTag]=typedArrayTags[numberTag]=typedArrayTags[objectTag]=typedArrayTags[regexpTag]=typedArrayTags[setTag]=typedArrayTags[stringTag]=typedArrayTags[weakMapTag]=false;/** Used to identify `toStringTag` values supported by `_.clone`. */var cloneableTags={};cloneableTags[argsTag]=cloneableTags[arrayTag]=cloneableTags[arrayBufferTag]=cloneableTags[dataViewTag]=cloneableTags[boolTag]=cloneableTags[dateTag]=cloneableTags[float32Tag]=cloneableTags[float64Tag]=cloneableTags[int8Tag]=cloneableTags[int16Tag]=cloneableTags[int32Tag]=cloneableTags[mapTag]=cloneableTags[numberTag]=cloneableTags[objectTag]=cloneableTags[regexpTag]=cloneableTags[setTag]=cloneableTags[stringTag]=cloneableTags[symbolTag]=cloneableTags[uint8Tag]=cloneableTags[uint8ClampedTag]=cloneableTags[uint16Tag]=cloneableTags[uint32Tag]=true;cloneableTags[errorTag]=cloneableTags[funcTag]=cloneableTags[weakMapTag]=false;/** Used to map Latin Unicode letters to basic Latin letters. */var deburredLetters={// Latin-1 Supplement block. '\xc0':'A','\xc1':'A','\xc2':'A','\xc3':'A','\xc4':'A','\xc5':'A','\xe0':'a','\xe1':'a','\xe2':'a','\xe3':'a','\xe4':'a','\xe5':'a','\xc7':'C','\xe7':'c','\xd0':'D','\xf0':'d','\xc8':'E','\xc9':'E','\xca':'E','\xcb':'E','\xe8':'e','\xe9':'e','\xea':'e','\xeb':'e','\xcc':'I','\xcd':'I','\xce':'I','\xcf':'I','\xec':'i','\xed':'i','\xee':'i','\xef':'i','\xd1':'N','\xf1':'n','\xd2':'O','\xd3':'O','\xd4':'O','\xd5':'O','\xd6':'O','\xd8':'O','\xf2':'o','\xf3':'o','\xf4':'o','\xf5':'o','\xf6':'o','\xf8':'o','\xd9':'U','\xda':'U','\xdb':'U','\xdc':'U','\xf9':'u','\xfa':'u','\xfb':'u','\xfc':'u','\xdd':'Y','\xfd':'y','\xff':'y','\xc6':'Ae','\xe6':'ae','\xde':'Th','\xfe':'th','\xdf':'ss',// Latin Extended-A block. '\u0100':'A','\u0102':'A','\u0104':'A','\u0101':'a','\u0103':'a','\u0105':'a','\u0106':'C','\u0108':'C','\u010A':'C','\u010C':'C','\u0107':'c','\u0109':'c','\u010B':'c','\u010D':'c','\u010E':'D','\u0110':'D','\u010F':'d','\u0111':'d','\u0112':'E','\u0114':'E','\u0116':'E','\u0118':'E','\u011A':'E','\u0113':'e','\u0115':'e','\u0117':'e','\u0119':'e','\u011B':'e','\u011C':'G','\u011E':'G','\u0120':'G','\u0122':'G','\u011D':'g','\u011F':'g','\u0121':'g','\u0123':'g','\u0124':'H','\u0126':'H','\u0125':'h','\u0127':'h','\u0128':'I','\u012A':'I','\u012C':'I','\u012E':'I','\u0130':'I','\u0129':'i','\u012B':'i','\u012D':'i','\u012F':'i','\u0131':'i','\u0134':'J','\u0135':'j','\u0136':'K','\u0137':'k','\u0138':'k','\u0139':'L','\u013B':'L','\u013D':'L','\u013F':'L','\u0141':'L','\u013A':'l','\u013C':'l','\u013E':'l','\u0140':'l','\u0142':'l','\u0143':'N','\u0145':'N','\u0147':'N','\u014A':'N','\u0144':'n','\u0146':'n','\u0148':'n','\u014B':'n','\u014C':'O','\u014E':'O','\u0150':'O','\u014D':'o','\u014F':'o','\u0151':'o','\u0154':'R','\u0156':'R','\u0158':'R','\u0155':'r','\u0157':'r','\u0159':'r','\u015A':'S','\u015C':'S','\u015E':'S','\u0160':'S','\u015B':'s','\u015D':'s','\u015F':'s','\u0161':'s','\u0162':'T','\u0164':'T','\u0166':'T','\u0163':'t','\u0165':'t','\u0167':'t','\u0168':'U','\u016A':'U','\u016C':'U','\u016E':'U','\u0170':'U','\u0172':'U','\u0169':'u','\u016B':'u','\u016D':'u','\u016F':'u','\u0171':'u','\u0173':'u','\u0174':'W','\u0175':'w','\u0176':'Y','\u0177':'y','\u0178':'Y','\u0179':'Z','\u017B':'Z','\u017D':'Z','\u017A':'z','\u017C':'z','\u017E':'z','\u0132':'IJ','\u0133':'ij','\u0152':'Oe','\u0153':'oe','\u0149':"'n",'\u017F':'s'};/** Used to map characters to HTML entities. */var htmlEscapes={'&':'&','<':'<','>':'>','"':'"',"'":'''};/** Used to map HTML entities to characters. */var htmlUnescapes={'&':'&','<':'<','>':'>','"':'"',''':"'"};/** Used to escape characters for inclusion in compiled string literals. */var stringEscapes={'\\':'\\',"'":"'",'\n':'n','\r':'r','\u2028':'u2028','\u2029':'u2029'};/** Built-in method references without a dependency on `root`. */var freeParseFloat=parseFloat,freeParseInt=parseInt;/** Detect free variable `global` from Node.js. */var freeGlobal=(typeof global==='undefined'?'undefined':_typeof(global))=='object'&&global&&global.Object===Object&&global;/** Detect free variable `self`. */var freeSelf=(typeof self==='undefined'?'undefined':_typeof(self))=='object'&&self&&self.Object===Object&&self;/** Used as a reference to the global object. */var root=freeGlobal||freeSelf||Function('return this')();/** Detect free variable `exports`. */var freeExports=(typeof exports==='undefined'?'undefined':_typeof(exports))=='object'&&exports&&!exports.nodeType&&exports;/** Detect free variable `module`. */var freeModule=freeExports&&(typeof module==='undefined'?'undefined':_typeof(module))=='object'&&module&&!module.nodeType&&module;/** Detect the popular CommonJS extension `module.exports`. */var moduleExports=freeModule&&freeModule.exports===freeExports;/** Detect free variable `process` from Node.js. */var freeProcess=moduleExports&&freeGlobal.process;/** Used to access faster Node.js helpers. */var nodeUtil=function(){try{return freeProcess&&freeProcess.binding&&freeProcess.binding('util');}catch(e){}}();/* Node.js helper references. */var nodeIsArrayBuffer=nodeUtil&&nodeUtil.isArrayBuffer,nodeIsDate=nodeUtil&&nodeUtil.isDate,nodeIsMap=nodeUtil&&nodeUtil.isMap,nodeIsRegExp=nodeUtil&&nodeUtil.isRegExp,nodeIsSet=nodeUtil&&nodeUtil.isSet,nodeIsTypedArray=nodeUtil&&nodeUtil.isTypedArray;/*--------------------------------------------------------------------------*//** * Adds the key-value `pair` to `map`. * * @private * @param {Object} map The map to modify. * @param {Array} pair The key-value pair to add. * @returns {Object} Returns `map`. */function addMapEntry(map,pair){// Don't return `map.set` because it's not chainable in IE 11. map.set(pair[0],pair[1]);return map;}/** * Adds `value` to `set`. * * @private * @param {Object} set The set to modify. * @param {*} value The value to add. * @returns {Object} Returns `set`. */function addSetEntry(set,value){// Don't return `set.add` because it's not chainable in IE 11. set.add(value);return set;}/** * A faster alternative to `Function#apply`, this function invokes `func` * with the `this` binding of `thisArg` and the arguments of `args`. * * @private * @param {Function} func The function to invoke. * @param {*} thisArg The `this` binding of `func`. * @param {Array} args The arguments to invoke `func` with. * @returns {*} Returns the result of `func`. */function apply(func,thisArg,args){switch(args.length){case 0:return func.call(thisArg);case 1:return func.call(thisArg,args[0]);case 2:return func.call(thisArg,args[0],args[1]);case 3:return func.call(thisArg,args[0],args[1],args[2]);}return func.apply(thisArg,args);}/** * A specialized version of `baseAggregator` for arrays. * * @private * @param {Array} [array] The array to iterate over. * @param {Function} setter The function to set `accumulator` values. * @param {Function} iteratee The iteratee to transform keys. * @param {Object} accumulator The initial aggregated object. * @returns {Function} Returns `accumulator`. */function arrayAggregator(array,setter,iteratee,accumulator){var index=-1,length=array==null?0:array.length;while(++index-1;}/** * This function is like `arrayIncludes` except that it accepts a comparator. * * @private * @param {Array} [array] The array to inspect. * @param {*} target The value to search for. * @param {Function} comparator The comparator invoked per element. * @returns {boolean} Returns `true` if `target` is found, else `false`. */function arrayIncludesWith(array,value,comparator){var index=-1,length=array==null?0:array.length;while(++index-1){}return index;}/** * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol * that is not found in the character symbols. * * @private * @param {Array} strSymbols The string symbols to inspect. * @param {Array} chrSymbols The character symbols to find. * @returns {number} Returns the index of the last unmatched string symbol. */function charsEndIndex(strSymbols,chrSymbols){var index=strSymbols.length;while(index--&&baseIndexOf(chrSymbols,strSymbols[index],0)>-1){}return index;}/** * Gets the number of `placeholder` occurrences in `array`. * * @private * @param {Array} array The array to inspect. * @param {*} placeholder The placeholder to search for. * @returns {number} Returns the placeholder count. */function countHolders(array,placeholder){var length=array.length,result=0;while(length--){if(array[length]===placeholder){++result;}}return result;}/** * Used by `_.deburr` to convert Latin-1 Supplement and Latin Extended-A * letters to basic Latin letters. * * @private * @param {string} letter The matched letter to deburr. * @returns {string} Returns the deburred letter. */var deburrLetter=basePropertyOf(deburredLetters);/** * Used by `_.escape` to convert characters to HTML entities. * * @private * @param {string} chr The matched character to escape. * @returns {string} Returns the escaped character. */var escapeHtmlChar=basePropertyOf(htmlEscapes);/** * Used by `_.template` to escape characters for inclusion in compiled string literals. * * @private * @param {string} chr The matched character to escape. * @returns {string} Returns the escaped character. */function escapeStringChar(chr){return'\\'+stringEscapes[chr];}/** * Gets the value at `key` of `object`. * * @private * @param {Object} [object] The object to query. * @param {string} key The key of the property to get. * @returns {*} Returns the property value. */function getValue(object,key){return object==null?undefined:object[key];}/** * Checks if `string` contains Unicode symbols. * * @private * @param {string} string The string to inspect. * @returns {boolean} Returns `true` if a symbol is found, else `false`. */function hasUnicode(string){return reHasUnicode.test(string);}/** * Checks if `string` contains a word composed of Unicode symbols. * * @private * @param {string} string The string to inspect. * @returns {boolean} Returns `true` if a word is found, else `false`. */function hasUnicodeWord(string){return reHasUnicodeWord.test(string);}/** * Converts `iterator` to an array. * * @private * @param {Object} iterator The iterator to convert. * @returns {Array} Returns the converted array. */function iteratorToArray(iterator){var data,result=[];while(!(data=iterator.next()).done){result.push(data.value);}return result;}/** * Converts `map` to its key-value pairs. * * @private * @param {Object} map The map to convert. * @returns {Array} Returns the key-value pairs. */function mapToArray(map){var index=-1,result=Array(map.size);map.forEach(function(value,key){result[++index]=[key,value];});return result;}/** * Creates a unary function that invokes `func` with its argument transformed. * * @private * @param {Function} func The function to wrap. * @param {Function} transform The argument transform. * @returns {Function} Returns the new function. */function overArg(func,transform){return function(arg){return func(transform(arg));};}/** * Replaces all `placeholder` elements in `array` with an internal placeholder * and returns an array of their indexes. * * @private * @param {Array} array The array to modify. * @param {*} placeholder The placeholder to replace. * @returns {Array} Returns the new array of placeholder indexes. */function replaceHolders(array,placeholder){var index=-1,length=array.length,resIndex=0,result=[];while(++index true * _.isFunction(_.bar); * // => false * * lodash.isFunction(lodash.foo); * // => false * lodash.isFunction(lodash.bar); * // => true * * // Create a suped-up `defer` in Node.js. * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer; */var runInContext=function runInContext(context){context=context==null?root:_.defaults(root.Object(),context,_.pick(root,contextProps));/** Built-in constructor references. */var Array=context.Array,Date=context.Date,Error=context.Error,Function=context.Function,Math=context.Math,Object=context.Object,RegExp=context.RegExp,String=context.String,TypeError=context.TypeError;/** Used for built-in method references. */var arrayProto=Array.prototype,funcProto=Function.prototype,objectProto=Object.prototype;/** Used to detect overreaching core-js shims. */var coreJsData=context['__core-js_shared__'];/** Used to resolve the decompiled source of functions. */var funcToString=funcProto.toString;/** Used to check objects for own properties. */var hasOwnProperty=objectProto.hasOwnProperty;/** Used to generate unique IDs. */var idCounter=0;/** Used to detect methods masquerading as native. */var maskSrcKey=function(){var uid=/[^.]+$/.exec(coreJsData&&coreJsData.keys&&coreJsData.keys.IE_PROTO||'');return uid?'Symbol(src)_1.'+uid:'';}();/** * Used to resolve the * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring) * of values. */var nativeObjectToString=objectProto.toString;/** Used to infer the `Object` constructor. */var objectCtorString=funcToString.call(Object);/** Used to restore the original `_` reference in `_.noConflict`. */var oldDash=root._;/** Used to detect if a method is native. */var reIsNative=RegExp('^'+funcToString.call(hasOwnProperty).replace(reRegExpChar,'\\$&').replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g,'$1.*?')+'$');/** Built-in value references. */var Buffer=moduleExports?context.Buffer:undefined,_Symbol=context.Symbol,Uint8Array=context.Uint8Array,allocUnsafe=Buffer?Buffer.allocUnsafe:undefined,getPrototype=overArg(Object.getPrototypeOf,Object),objectCreate=Object.create,propertyIsEnumerable=objectProto.propertyIsEnumerable,splice=arrayProto.splice,spreadableSymbol=_Symbol?_Symbol.isConcatSpreadable:undefined,symIterator=_Symbol?_Symbol.iterator:undefined,symToStringTag=_Symbol?_Symbol.toStringTag:undefined;var defineProperty=function(){try{var func=getNative(Object,'defineProperty');func({},'',{});return func;}catch(e){}}();/** Mocked built-ins. */var ctxClearTimeout=context.clearTimeout!==root.clearTimeout&&context.clearTimeout,ctxNow=Date&&Date.now!==root.Date.now&&Date.now,ctxSetTimeout=context.setTimeout!==root.setTimeout&&context.setTimeout;/* Built-in method references for those with the same name as other `lodash` methods. */var nativeCeil=Math.ceil,nativeFloor=Math.floor,nativeGetSymbols=Object.getOwnPropertySymbols,nativeIsBuffer=Buffer?Buffer.isBuffer:undefined,nativeIsFinite=context.isFinite,nativeJoin=arrayProto.join,nativeKeys=overArg(Object.keys,Object),nativeMax=Math.max,nativeMin=Math.min,nativeNow=Date.now,nativeParseInt=context.parseInt,nativeRandom=Math.random,nativeReverse=arrayProto.reverse;/* Built-in method references that are verified to be native. */var DataView=getNative(context,'DataView'),Map=getNative(context,'Map'),Promise=getNative(context,'Promise'),Set=getNative(context,'Set'),WeakMap=getNative(context,'WeakMap'),nativeCreate=getNative(Object,'create');/** Used to store function metadata. */var metaMap=WeakMap&&new WeakMap();/** Used to lookup unminified function names. */var realNames={};/** Used to detect maps, sets, and weakmaps. */var dataViewCtorString=toSource(DataView),mapCtorString=toSource(Map),promiseCtorString=toSource(Promise),setCtorString=toSource(Set),weakMapCtorString=toSource(WeakMap);/** Used to convert symbols to primitives and strings. */var symbolProto=_Symbol?_Symbol.prototype:undefined,symbolValueOf=symbolProto?symbolProto.valueOf:undefined,symbolToString=symbolProto?symbolProto.toString:undefined;/*------------------------------------------------------------------------*//** * Creates a `lodash` object which wraps `value` to enable implicit method * chain sequences. Methods that operate on and return arrays, collections, * and functions can be chained together. Methods that retrieve a single value * or may return a primitive value will automatically end the chain sequence * and return the unwrapped value. Otherwise, the value must be unwrapped * with `_#value`. * * Explicit chain sequences, which must be unwrapped with `_#value`, may be * enabled using `_.chain`. * * The execution of chained methods is lazy, that is, it's deferred until * `_#value` is implicitly or explicitly called. * * Lazy evaluation allows several methods to support shortcut fusion. * Shortcut fusion is an optimization to merge iteratee calls; this avoids * the creation of intermediate arrays and can greatly reduce the number of * iteratee executions. Sections of a chain sequence qualify for shortcut * fusion if the section is applied to an array and iteratees accept only * one argument. The heuristic for whether a section qualifies for shortcut * fusion is subject to change. * * Chaining is supported in custom builds as long as the `_#value` method is * directly or indirectly included in the build. * * In addition to lodash methods, wrappers have `Array` and `String` methods. * * The wrapper `Array` methods are: * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift` * * The wrapper `String` methods are: * `replace` and `split` * * The wrapper methods that support shortcut fusion are: * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`, * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`, * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray` * * The chainable wrapper methods are: * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`, * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`, * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`, * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`, * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`, * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`, * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`, * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`, * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`, * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`, * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`, * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`, * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`, * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`, * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`, * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`, * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`, * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`, * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`, * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`, * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`, * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`, * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`, * `zipObject`, `zipObjectDeep`, and `zipWith` * * The wrapper methods that are **not** chainable by default are: * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`, * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `conformsTo`, `deburr`, * `defaultTo`, `divide`, `each`, `eachRight`, `endsWith`, `eq`, `escape`, * `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, `findLast`, * `findLastIndex`, `findLastKey`, `first`, `floor`, `forEach`, `forEachRight`, * `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `get`, `gt`, `gte`, `has`, * `hasIn`, `head`, `identity`, `includes`, `indexOf`, `inRange`, `invoke`, * `isArguments`, `isArray`, `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`, * `isBoolean`, `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`, * `isEqualWith`, `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`, * `isMap`, `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`, * `isNumber`, `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`, * `isSafeInteger`, `isSet`, `isString`, `isUndefined`, `isTypedArray`, * `isWeakMap`, `isWeakSet`, `join`, `kebabCase`, `last`, `lastIndexOf`, * `lowerCase`, `lowerFirst`, `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`, * `min`, `minBy`, `multiply`, `noConflict`, `noop`, `now`, `nth`, `pad`, * `padEnd`, `padStart`, `parseInt`, `pop`, `random`, `reduce`, `reduceRight`, * `repeat`, `result`, `round`, `runInContext`, `sample`, `shift`, `size`, * `snakeCase`, `some`, `sortedIndex`, `sortedIndexBy`, `sortedLastIndex`, * `sortedLastIndexBy`, `startCase`, `startsWith`, `stubArray`, `stubFalse`, * `stubObject`, `stubString`, `stubTrue`, `subtract`, `sum`, `sumBy`, * `template`, `times`, `toFinite`, `toInteger`, `toJSON`, `toLength`, * `toLower`, `toNumber`, `toSafeInteger`, `toString`, `toUpper`, `trim`, * `trimEnd`, `trimStart`, `truncate`, `unescape`, `uniqueId`, `upperCase`, * `upperFirst`, `value`, and `words` * * @name _ * @constructor * @category Seq * @param {*} value The value to wrap in a `lodash` instance. * @returns {Object} Returns the new `lodash` wrapper instance. * @example * * function square(n) { * return n * n; * } * * var wrapped = _([1, 2, 3]); * * // Returns an unwrapped value. * wrapped.reduce(_.add); * // => 6 * * // Returns a wrapped value. * var squares = wrapped.map(square); * * _.isArray(squares); * // => false * * _.isArray(squares.value()); * // => true */function lodash(value){if(isObjectLike(value)&&!isArray(value)&&!(value instanceof LazyWrapper)){if(value instanceof LodashWrapper){return value;}if(hasOwnProperty.call(value,'__wrapped__')){return wrapperClone(value);}}return new LodashWrapper(value);}/** * The base implementation of `_.create` without support for assigning * properties to the created object. * * @private * @param {Object} proto The object to inherit from. * @returns {Object} Returns the new object. */var baseCreate=function(){function object(){}return function(proto){if(!isObject(proto)){return{};}if(objectCreate){return objectCreate(proto);}object.prototype=proto;var result=new object();object.prototype=undefined;return result;};}();/** * The function whose prototype chain sequence wrappers inherit from. * * @private */function baseLodash(){}// No operation performed. /** * The base constructor for creating `lodash` wrapper objects. * * @private * @param {*} value The value to wrap. * @param {boolean} [chainAll] Enable explicit method chain sequences. */function LodashWrapper(value,chainAll){this.__wrapped__=value;this.__actions__=[];this.__chain__=!!chainAll;this.__index__=0;this.__values__=undefined;}/** * By default, the template delimiters used by lodash are like those in * embedded Ruby (ERB) as well as ES2015 template strings. Change the * following template settings to use alternative delimiters. * * @static * @memberOf _ * @type {Object} */lodash.templateSettings={/** * Used to detect `data` property values to be HTML-escaped. * * @memberOf _.templateSettings * @type {RegExp} */'escape':reEscape,/** * Used to detect code to be evaluated. * * @memberOf _.templateSettings * @type {RegExp} */'evaluate':reEvaluate,/** * Used to detect `data` property values to inject. * * @memberOf _.templateSettings * @type {RegExp} */'interpolate':reInterpolate,/** * Used to reference the data object in the template text. * * @memberOf _.templateSettings * @type {string} */'variable':'',/** * Used to import variables into the compiled template. * * @memberOf _.templateSettings * @type {Object} */'imports':{/** * A reference to the `lodash` function. * * @memberOf _.templateSettings.imports * @type {Function} */'_':lodash}};// Ensure wrappers are instances of `baseLodash`. lodash.prototype=baseLodash.prototype;lodash.prototype.constructor=lodash;LodashWrapper.prototype=baseCreate(baseLodash.prototype);LodashWrapper.prototype.constructor=LodashWrapper;/*------------------------------------------------------------------------*//** * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation. * * @private * @constructor * @param {*} value The value to wrap. */function LazyWrapper(value){this.__wrapped__=value;this.__actions__=[];this.__dir__=1;this.__filtered__=false;this.__iteratees__=[];this.__takeCount__=MAX_ARRAY_LENGTH;this.__views__=[];}/** * Creates a clone of the lazy wrapper object. * * @private * @name clone * @memberOf LazyWrapper * @returns {Object} Returns the cloned `LazyWrapper` object. */function lazyClone(){var result=new LazyWrapper(this.__wrapped__);result.__actions__=copyArray(this.__actions__);result.__dir__=this.__dir__;result.__filtered__=this.__filtered__;result.__iteratees__=copyArray(this.__iteratees__);result.__takeCount__=this.__takeCount__;result.__views__=copyArray(this.__views__);return result;}/** * Reverses the direction of lazy iteration. * * @private * @name reverse * @memberOf LazyWrapper * @returns {Object} Returns the new reversed `LazyWrapper` object. */function lazyReverse(){if(this.__filtered__){var result=new LazyWrapper(this);result.__dir__=-1;result.__filtered__=true;}else{result=this.clone();result.__dir__*=-1;}return result;}/** * Extracts the unwrapped value from its lazy wrapper. * * @private * @name value * @memberOf LazyWrapper * @returns {*} Returns the unwrapped value. */function lazyValue(){var array=this.__wrapped__.value(),dir=this.__dir__,isArr=isArray(array),isRight=dir<0,arrLength=isArr?array.length:0,view=getView(0,arrLength,this.__views__),start=view.start,end=view.end,length=end-start,index=isRight?end:start-1,iteratees=this.__iteratees__,iterLength=iteratees.length,resIndex=0,takeCount=nativeMin(length,this.__takeCount__);if(!isArr||!isRight&&arrLength==length&&takeCount==length){return baseWrapperValue(array,this.__actions__);}var result=[];outer:while(length--&&resIndex-1;}/** * Sets the list cache `key` to `value`. * * @private * @name set * @memberOf ListCache * @param {string} key The key of the value to set. * @param {*} value The value to set. * @returns {Object} Returns the list cache instance. */function listCacheSet(key,value){var data=this.__data__,index=assocIndexOf(data,key);if(index<0){++this.size;data.push([key,value]);}else{data[index][1]=value;}return this;}// Add methods to `ListCache`. ListCache.prototype.clear=listCacheClear;ListCache.prototype['delete']=listCacheDelete;ListCache.prototype.get=listCacheGet;ListCache.prototype.has=listCacheHas;ListCache.prototype.set=listCacheSet;/*------------------------------------------------------------------------*//** * Creates a map cache object to store key-value pairs. * * @private * @constructor * @param {Array} [entries] The key-value pairs to cache. */function MapCache(entries){var index=-1,length=entries==null?0:entries.length;this.clear();while(++index=lower?number:lower;}}return number;}/** * The base implementation of `_.clone` and `_.cloneDeep` which tracks * traversed objects. * * @private * @param {*} value The value to clone. * @param {boolean} bitmask The bitmask flags. * 1 - Deep clone * 2 - Flatten inherited properties * 4 - Clone symbols * @param {Function} [customizer] The function to customize cloning. * @param {string} [key] The key of `value`. * @param {Object} [object] The parent object of `value`. * @param {Object} [stack] Tracks traversed objects and their clone counterparts. * @returns {*} Returns the cloned value. */function baseClone(value,bitmask,customizer,key,object,stack){var result,isDeep=bitmask&CLONE_DEEP_FLAG,isFlat=bitmask&CLONE_FLAT_FLAG,isFull=bitmask&CLONE_SYMBOLS_FLAG;if(customizer){result=object?customizer(value,key,object,stack):customizer(value);}if(result!==undefined){return result;}if(!isObject(value)){return value;}var isArr=isArray(value);if(isArr){result=initCloneArray(value);if(!isDeep){return copyArray(value,result);}}else{var tag=getTag(value),isFunc=tag==funcTag||tag==genTag;if(isBuffer(value)){return cloneBuffer(value,isDeep);}if(tag==objectTag||tag==argsTag||isFunc&&!object){result=isFlat||isFunc?{}:initCloneObject(value);if(!isDeep){return isFlat?copySymbolsIn(value,baseAssignIn(result,value)):copySymbols(value,baseAssign(result,value));}}else{if(!cloneableTags[tag]){return object?value:{};}result=initCloneByTag(value,tag,baseClone,isDeep);}}// Check for circular references and return its corresponding clone. stack||(stack=new Stack());var stacked=stack.get(value);if(stacked){return stacked;}stack.set(value,result);var keysFunc=isFull?isFlat?getAllKeysIn:getAllKeys:isFlat?keysIn:keys;var props=isArr?undefined:keysFunc(value);arrayEach(props||value,function(subValue,key){if(props){key=subValue;subValue=value[key];}// Recursively populate clone (susceptible to call stack limits). assignValue(result,key,baseClone(subValue,bitmask,customizer,key,value,stack));});return result;}/** * The base implementation of `_.conforms` which doesn't clone `source`. * * @private * @param {Object} source The object of property predicates to conform to. * @returns {Function} Returns the new spec function. */function baseConforms(source){var props=keys(source);return function(object){return baseConformsTo(object,source,props);};}/** * The base implementation of `_.conformsTo` which accepts `props` to check. * * @private * @param {Object} object The object to inspect. * @param {Object} source The object of property predicates to conform to. * @returns {boolean} Returns `true` if `object` conforms, else `false`. */function baseConformsTo(object,source,props){var length=props.length;if(object==null){return!length;}object=Object(object);while(length--){var key=props[length],predicate=source[key],value=object[key];if(value===undefined&&!(key in object)||!predicate(value)){return false;}}return true;}/** * The base implementation of `_.delay` and `_.defer` which accepts `args` * to provide to `func`. * * @private * @param {Function} func The function to delay. * @param {number} wait The number of milliseconds to delay invocation. * @param {Array} args The arguments to provide to `func`. * @returns {number|Object} Returns the timer id or timeout object. */function baseDelay(func,wait,args){if(typeof func!='function'){throw new TypeError(FUNC_ERROR_TEXT);}return setTimeout(function(){func.apply(undefined,args);},wait);}/** * The base implementation of methods like `_.difference` without support * for excluding multiple arrays or iteratee shorthands. * * @private * @param {Array} array The array to inspect. * @param {Array} values The values to exclude. * @param {Function} [iteratee] The iteratee invoked per element. * @param {Function} [comparator] The comparator invoked per element. * @returns {Array} Returns the new array of filtered values. */function baseDifference(array,values,iteratee,comparator){var index=-1,includes=arrayIncludes,isCommon=true,length=array.length,result=[],valuesLength=values.length;if(!length){return result;}if(iteratee){values=arrayMap(values,baseUnary(iteratee));}if(comparator){includes=arrayIncludesWith;isCommon=false;}else if(values.length>=LARGE_ARRAY_SIZE){includes=cacheHas;isCommon=false;values=new SetCache(values);}outer:while(++indexlength?0:length+start;}end=end===undefined||end>length?length:toInteger(end);if(end<0){end+=length;}end=start>end?0:toLength(end);while(start0&&predicate(value)){if(depth>1){// Recursively flatten arrays (susceptible to call stack limits). baseFlatten(value,depth-1,predicate,isStrict,result);}else{arrayPush(result,value);}}else if(!isStrict){result[result.length]=value;}}return result;}/** * The base implementation of `baseForOwn` which iterates over `object` * properties returned by `keysFunc` and invokes `iteratee` for each property. * Iteratee functions may exit iteration early by explicitly returning `false`. * * @private * @param {Object} object The object to iterate over. * @param {Function} iteratee The function invoked per iteration. * @param {Function} keysFunc The function to get the keys of `object`. * @returns {Object} Returns `object`. */var baseFor=createBaseFor();/** * This function is like `baseFor` except that it iterates over properties * in the opposite order. * * @private * @param {Object} object The object to iterate over. * @param {Function} iteratee The function invoked per iteration. * @param {Function} keysFunc The function to get the keys of `object`. * @returns {Object} Returns `object`. */var baseForRight=createBaseFor(true);/** * The base implementation of `_.forOwn` without support for iteratee shorthands. * * @private * @param {Object} object The object to iterate over. * @param {Function} iteratee The function invoked per iteration. * @returns {Object} Returns `object`. */function baseForOwn(object,iteratee){return object&&baseFor(object,iteratee,keys);}/** * The base implementation of `_.forOwnRight` without support for iteratee shorthands. * * @private * @param {Object} object The object to iterate over. * @param {Function} iteratee The function invoked per iteration. * @returns {Object} Returns `object`. */function baseForOwnRight(object,iteratee){return object&&baseForRight(object,iteratee,keys);}/** * The base implementation of `_.functions` which creates an array of * `object` function property names filtered from `props`. * * @private * @param {Object} object The object to inspect. * @param {Array} props The property names to filter. * @returns {Array} Returns the function names. */function baseFunctions(object,props){return arrayFilter(props,function(key){return isFunction(object[key]);});}/** * The base implementation of `_.get` without support for default values. * * @private * @param {Object} object The object to query. * @param {Array|string} path The path of the property to get. * @returns {*} Returns the resolved value. */function baseGet(object,path){path=castPath(path,object);var index=0,length=path.length;while(object!=null&&indexother;}/** * The base implementation of `_.has` without support for deep paths. * * @private * @param {Object} [object] The object to query. * @param {Array|string} key The key to check. * @returns {boolean} Returns `true` if `key` exists, else `false`. */function baseHas(object,key){return object!=null&&hasOwnProperty.call(object,key);}/** * The base implementation of `_.hasIn` without support for deep paths. * * @private * @param {Object} [object] The object to query. * @param {Array|string} key The key to check. * @returns {boolean} Returns `true` if `key` exists, else `false`. */function baseHasIn(object,key){return object!=null&&key in Object(object);}/** * The base implementation of `_.inRange` which doesn't coerce arguments. * * @private * @param {number} number The number to check. * @param {number} start The start of the range. * @param {number} end The end of the range. * @returns {boolean} Returns `true` if `number` is in the range, else `false`. */function baseInRange(number,start,end){return number>=nativeMin(start,end)&&number=120&&array.length>=120)?new SetCache(othIndex&&array):undefined;}array=arrays[0];var index=-1,seen=caches[0];outer:while(++index-1){if(seen!==array){splice.call(seen,fromIndex,1);}splice.call(array,fromIndex,1);}}return array;}/** * The base implementation of `_.pullAt` without support for individual * indexes or capturing the removed elements. * * @private * @param {Array} array The array to modify. * @param {number[]} indexes The indexes of elements to remove. * @returns {Array} Returns `array`. */function basePullAt(array,indexes){var length=array?indexes.length:0,lastIndex=length-1;while(length--){var index=indexes[length];if(length==lastIndex||index!==previous){var previous=index;if(isIndex(index)){splice.call(array,index,1);}else{baseUnset(array,index);}}}return array;}/** * The base implementation of `_.random` without support for returning * floating-point numbers. * * @private * @param {number} lower The lower bound. * @param {number} upper The upper bound. * @returns {number} Returns the random number. */function baseRandom(lower,upper){return lower+nativeFloor(nativeRandom()*(upper-lower+1));}/** * The base implementation of `_.range` and `_.rangeRight` which doesn't * coerce arguments. * * @private * @param {number} start The start of the range. * @param {number} end The end of the range. * @param {number} step The value to increment or decrement by. * @param {boolean} [fromRight] Specify iterating from right to left. * @returns {Array} Returns the range of numbers. */function baseRange(start,end,step,fromRight){var index=-1,length=nativeMax(nativeCeil((end-start)/(step||1)),0),result=Array(length);while(length--){result[fromRight?length:++index]=start;start+=step;}return result;}/** * The base implementation of `_.repeat` which doesn't coerce arguments. * * @private * @param {string} string The string to repeat. * @param {number} n The number of times to repeat the string. * @returns {string} Returns the repeated string. */function baseRepeat(string,n){var result='';if(!string||n<1||n>MAX_SAFE_INTEGER){return result;}// Leverage the exponentiation by squaring algorithm for a faster repeat. // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details. do{if(n%2){result+=string;}n=nativeFloor(n/2);if(n){string+=string;}}while(n);return result;}/** * The base implementation of `_.rest` which doesn't validate or coerce arguments. * * @private * @param {Function} func The function to apply a rest parameter to. * @param {number} [start=func.length-1] The start position of the rest parameter. * @returns {Function} Returns the new function. */function baseRest(func,start){return setToString(overRest(func,start,identity),func+'');}/** * The base implementation of `_.sample`. * * @private * @param {Array|Object} collection The collection to sample. * @returns {*} Returns the random element. */function baseSample(collection){return arraySample(values(collection));}/** * The base implementation of `_.sampleSize` without param guards. * * @private * @param {Array|Object} collection The collection to sample. * @param {number} n The number of elements to sample. * @returns {Array} Returns the random elements. */function baseSampleSize(collection,n){var array=values(collection);return shuffleSelf(array,baseClamp(n,0,array.length));}/** * The base implementation of `_.set`. * * @private * @param {Object} object The object to modify. * @param {Array|string} path The path of the property to set. * @param {*} value The value to set. * @param {Function} [customizer] The function to customize path creation. * @returns {Object} Returns `object`. */function baseSet(object,path,value,customizer){if(!isObject(object)){return object;}path=castPath(path,object);var index=-1,length=path.length,lastIndex=length-1,nested=object;while(nested!=null&&++indexlength?0:length+start;}end=end>length?length:end;if(end<0){end+=length;}length=start>end?0:end-start>>>0;start>>>=0;var result=Array(length);while(++index>>1,computed=array[mid];if(computed!==null&&!isSymbol(computed)&&(retHighest?computed<=value:computed=LARGE_ARRAY_SIZE){var set=iteratee?null:createSet(array);if(set){return setToArray(set);}isCommon=false;includes=cacheHas;seen=new SetCache();}else{seen=iteratee?[]:result;}outer:while(++index=length?array:baseSlice(array,start,end);}/** * A simple wrapper around the global [`clearTimeout`](https://mdn.io/clearTimeout). * * @private * @param {number|Object} id The timer id or timeout object of the timer to clear. */var clearTimeout=ctxClearTimeout||function(id){return root.clearTimeout(id);};/** * Creates a clone of `buffer`. * * @private * @param {Buffer} buffer The buffer to clone. * @param {boolean} [isDeep] Specify a deep clone. * @returns {Buffer} Returns the cloned buffer. */function cloneBuffer(buffer,isDeep){if(isDeep){return buffer.slice();}var length=buffer.length,result=allocUnsafe?allocUnsafe(length):new buffer.constructor(length);buffer.copy(result);return result;}/** * Creates a clone of `arrayBuffer`. * * @private * @param {ArrayBuffer} arrayBuffer The array buffer to clone. * @returns {ArrayBuffer} Returns the cloned array buffer. */function cloneArrayBuffer(arrayBuffer){var result=new arrayBuffer.constructor(arrayBuffer.byteLength);new Uint8Array(result).set(new Uint8Array(arrayBuffer));return result;}/** * Creates a clone of `dataView`. * * @private * @param {Object} dataView The data view to clone. * @param {boolean} [isDeep] Specify a deep clone. * @returns {Object} Returns the cloned data view. */function cloneDataView(dataView,isDeep){var buffer=isDeep?cloneArrayBuffer(dataView.buffer):dataView.buffer;return new dataView.constructor(buffer,dataView.byteOffset,dataView.byteLength);}/** * Creates a clone of `map`. * * @private * @param {Object} map The map to clone. * @param {Function} cloneFunc The function to clone values. * @param {boolean} [isDeep] Specify a deep clone. * @returns {Object} Returns the cloned map. */function cloneMap(map,isDeep,cloneFunc){var array=isDeep?cloneFunc(mapToArray(map),CLONE_DEEP_FLAG):mapToArray(map);return arrayReduce(array,addMapEntry,new map.constructor());}/** * Creates a clone of `regexp`. * * @private * @param {Object} regexp The regexp to clone. * @returns {Object} Returns the cloned regexp. */function cloneRegExp(regexp){var result=new regexp.constructor(regexp.source,reFlags.exec(regexp));result.lastIndex=regexp.lastIndex;return result;}/** * Creates a clone of `set`. * * @private * @param {Object} set The set to clone. * @param {Function} cloneFunc The function to clone values. * @param {boolean} [isDeep] Specify a deep clone. * @returns {Object} Returns the cloned set. */function cloneSet(set,isDeep,cloneFunc){var array=isDeep?cloneFunc(setToArray(set),CLONE_DEEP_FLAG):setToArray(set);return arrayReduce(array,addSetEntry,new set.constructor());}/** * Creates a clone of the `symbol` object. * * @private * @param {Object} symbol The symbol object to clone. * @returns {Object} Returns the cloned symbol object. */function cloneSymbol(symbol){return symbolValueOf?Object(symbolValueOf.call(symbol)):{};}/** * Creates a clone of `typedArray`. * * @private * @param {Object} typedArray The typed array to clone. * @param {boolean} [isDeep] Specify a deep clone. * @returns {Object} Returns the cloned typed array. */function cloneTypedArray(typedArray,isDeep){var buffer=isDeep?cloneArrayBuffer(typedArray.buffer):typedArray.buffer;return new typedArray.constructor(buffer,typedArray.byteOffset,typedArray.length);}/** * Compares values to sort them in ascending order. * * @private * @param {*} value The value to compare. * @param {*} other The other value to compare. * @returns {number} Returns the sort order indicator for `value`. */function compareAscending(value,other){if(value!==other){var valIsDefined=value!==undefined,valIsNull=value===null,valIsReflexive=value===value,valIsSymbol=isSymbol(value);var othIsDefined=other!==undefined,othIsNull=other===null,othIsReflexive=other===other,othIsSymbol=isSymbol(other);if(!othIsNull&&!othIsSymbol&&!valIsSymbol&&value>other||valIsSymbol&&othIsDefined&&othIsReflexive&&!othIsNull&&!othIsSymbol||valIsNull&&othIsDefined&&othIsReflexive||!valIsDefined&&othIsReflexive||!valIsReflexive){return 1;}if(!valIsNull&&!valIsSymbol&&!othIsSymbol&&value=ordersLength){return result;}var order=orders[index];return result*(order=='desc'?-1:1);}}// Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications // that causes it, under certain circumstances, to provide the same value for // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247 // for more details. // // This also ensures a stable sort in V8 and other engines. // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details. return object.index-other.index;}/** * Creates an array that is the composition of partially applied arguments, * placeholders, and provided arguments into a single array of arguments. * * @private * @param {Array} args The provided arguments. * @param {Array} partials The arguments to prepend to those provided. * @param {Array} holders The `partials` placeholder indexes. * @params {boolean} [isCurried] Specify composing for a curried function. * @returns {Array} Returns the new array of composed arguments. */function composeArgs(args,partials,holders,isCurried){var argsIndex=-1,argsLength=args.length,holdersLength=holders.length,leftIndex=-1,leftLength=partials.length,rangeLength=nativeMax(argsLength-holdersLength,0),result=Array(leftLength+rangeLength),isUncurried=!isCurried;while(++leftIndex1?sources[length-1]:undefined,guard=length>2?sources[2]:undefined;customizer=assigner.length>3&&typeof customizer=='function'?(length--,customizer):undefined;if(guard&&isIterateeCall(sources[0],sources[1],guard)){customizer=length<3?undefined:customizer;length=1;}object=Object(object);while(++index-1?iterable[iteratee?collection[index]:index]:undefined;};}/** * Creates a `_.flow` or `_.flowRight` function. * * @private * @param {boolean} [fromRight] Specify iterating from right to left. * @returns {Function} Returns the new flow function. */function createFlow(fromRight){return flatRest(function(funcs){var length=funcs.length,index=length,prereq=LodashWrapper.prototype.thru;if(fromRight){funcs.reverse();}while(index--){var func=funcs[index];if(typeof func!='function'){throw new TypeError(FUNC_ERROR_TEXT);}if(prereq&&!wrapper&&getFuncName(func)=='wrapper'){var wrapper=new LodashWrapper([],true);}}index=wrapper?index:length;while(++index1){args.reverse();}if(isAry&&aryarrLength)){return false;}// Assume cyclic values are equal. var stacked=stack.get(array);if(stacked&&stack.get(other)){return stacked==other;}var index=-1,result=true,seen=bitmask&COMPARE_UNORDERED_FLAG?new SetCache():undefined;stack.set(array,other);stack.set(other,array);// Ignore non-index properties. while(++index1?'& ':'')+details[lastIndex];details=details.join(length>2?', ':' ');return source.replace(reWrapComment,'{\n/* [wrapped with '+details+'] */\n');}/** * Checks if `value` is a flattenable `arguments` object or array. * * @private * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is flattenable, else `false`. */function isFlattenable(value){return isArray(value)||isArguments(value)||!!(spreadableSymbol&&value&&value[spreadableSymbol]);}/** * Checks if `value` is a valid array-like index. * * @private * @param {*} value The value to check. * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index. * @returns {boolean} Returns `true` if `value` is a valid index, else `false`. */function isIndex(value,length){length=length==null?MAX_SAFE_INTEGER:length;return!!length&&(typeof value=='number'||reIsUint.test(value))&&value>-1&&value%1==0&&value0){if(++count>=HOT_COUNT){return arguments[0];}}else{count=0;}return func.apply(undefined,arguments);};}/** * A specialized version of `_.shuffle` which mutates and sets the size of `array`. * * @private * @param {Array} array The array to shuffle. * @param {number} [size=array.length] The size of `array`. * @returns {Array} Returns `array`. */function shuffleSelf(array,size){var index=-1,length=array.length,lastIndex=length-1;size=size===undefined?length:size;while(++index [['a', 'b'], ['c', 'd']] * * _.chunk(['a', 'b', 'c', 'd'], 3); * // => [['a', 'b', 'c'], ['d']] */function chunk(array,size,guard){if(guard?isIterateeCall(array,size,guard):size===undefined){size=1;}else{size=nativeMax(toInteger(size),0);}var length=array==null?0:array.length;if(!length||size<1){return[];}var index=0,resIndex=0,result=Array(nativeCeil(length/size));while(index [1, 2, 3] */function compact(array){var index=-1,length=array==null?0:array.length,resIndex=0,result=[];while(++index [1, 2, 3, [4]] * * console.log(array); * // => [1] */function concat(){var length=arguments.length;if(!length){return[];}var args=Array(length-1),array=arguments[0],index=length;while(index--){args[index-1]=arguments[index];}return arrayPush(isArray(array)?copyArray(array):[array],baseFlatten(args,1));}/** * Creates an array of `array` values not included in the other given arrays * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero) * for equality comparisons. The order and references of result values are * determined by the first array. * * **Note:** Unlike `_.pullAll`, this method returns a new array. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {Array} array The array to inspect. * @param {...Array} [values] The values to exclude. * @returns {Array} Returns the new array of filtered values. * @see _.without, _.xor * @example * * _.difference([2, 1], [2, 3]); * // => [1] */var difference=baseRest(function(array,values){return isArrayLikeObject(array)?baseDifference(array,baseFlatten(values,1,isArrayLikeObject,true)):[];});/** * This method is like `_.difference` except that it accepts `iteratee` which * is invoked for each element of `array` and `values` to generate the criterion * by which they're compared. The order and references of result values are * determined by the first array. The iteratee is invoked with one argument: * (value). * * **Note:** Unlike `_.pullAllBy`, this method returns a new array. * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to inspect. * @param {...Array} [values] The values to exclude. * @param {Function} [iteratee=_.identity] The iteratee invoked per element. * @returns {Array} Returns the new array of filtered values. * @example * * _.differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor); * // => [1.2] * * // The `_.property` iteratee shorthand. * _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x'); * // => [{ 'x': 2 }] */var differenceBy=baseRest(function(array,values){var iteratee=last(values);if(isArrayLikeObject(iteratee)){iteratee=undefined;}return isArrayLikeObject(array)?baseDifference(array,baseFlatten(values,1,isArrayLikeObject,true),getIteratee(iteratee,2)):[];});/** * This method is like `_.difference` except that it accepts `comparator` * which is invoked to compare elements of `array` to `values`. The order and * references of result values are determined by the first array. The comparator * is invoked with two arguments: (arrVal, othVal). * * **Note:** Unlike `_.pullAllWith`, this method returns a new array. * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to inspect. * @param {...Array} [values] The values to exclude. * @param {Function} [comparator] The comparator invoked per element. * @returns {Array} Returns the new array of filtered values. * @example * * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]; * * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual); * // => [{ 'x': 2, 'y': 1 }] */var differenceWith=baseRest(function(array,values){var comparator=last(values);if(isArrayLikeObject(comparator)){comparator=undefined;}return isArrayLikeObject(array)?baseDifference(array,baseFlatten(values,1,isArrayLikeObject,true),undefined,comparator):[];});/** * Creates a slice of `array` with `n` elements dropped from the beginning. * * @static * @memberOf _ * @since 0.5.0 * @category Array * @param {Array} array The array to query. * @param {number} [n=1] The number of elements to drop. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {Array} Returns the slice of `array`. * @example * * _.drop([1, 2, 3]); * // => [2, 3] * * _.drop([1, 2, 3], 2); * // => [3] * * _.drop([1, 2, 3], 5); * // => [] * * _.drop([1, 2, 3], 0); * // => [1, 2, 3] */function drop(array,n,guard){var length=array==null?0:array.length;if(!length){return[];}n=guard||n===undefined?1:toInteger(n);return baseSlice(array,n<0?0:n,length);}/** * Creates a slice of `array` with `n` elements dropped from the end. * * @static * @memberOf _ * @since 3.0.0 * @category Array * @param {Array} array The array to query. * @param {number} [n=1] The number of elements to drop. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {Array} Returns the slice of `array`. * @example * * _.dropRight([1, 2, 3]); * // => [1, 2] * * _.dropRight([1, 2, 3], 2); * // => [1] * * _.dropRight([1, 2, 3], 5); * // => [] * * _.dropRight([1, 2, 3], 0); * // => [1, 2, 3] */function dropRight(array,n,guard){var length=array==null?0:array.length;if(!length){return[];}n=guard||n===undefined?1:toInteger(n);n=length-n;return baseSlice(array,0,n<0?0:n);}/** * Creates a slice of `array` excluding elements dropped from the end. * Elements are dropped until `predicate` returns falsey. The predicate is * invoked with three arguments: (value, index, array). * * @static * @memberOf _ * @since 3.0.0 * @category Array * @param {Array} array The array to query. * @param {Function} [predicate=_.identity] The function invoked per iteration. * @returns {Array} Returns the slice of `array`. * @example * * var users = [ * { 'user': 'barney', 'active': true }, * { 'user': 'fred', 'active': false }, * { 'user': 'pebbles', 'active': false } * ]; * * _.dropRightWhile(users, function(o) { return !o.active; }); * // => objects for ['barney'] * * // The `_.matches` iteratee shorthand. * _.dropRightWhile(users, { 'user': 'pebbles', 'active': false }); * // => objects for ['barney', 'fred'] * * // The `_.matchesProperty` iteratee shorthand. * _.dropRightWhile(users, ['active', false]); * // => objects for ['barney'] * * // The `_.property` iteratee shorthand. * _.dropRightWhile(users, 'active'); * // => objects for ['barney', 'fred', 'pebbles'] */function dropRightWhile(array,predicate){return array&&array.length?baseWhile(array,getIteratee(predicate,3),true,true):[];}/** * Creates a slice of `array` excluding elements dropped from the beginning. * Elements are dropped until `predicate` returns falsey. The predicate is * invoked with three arguments: (value, index, array). * * @static * @memberOf _ * @since 3.0.0 * @category Array * @param {Array} array The array to query. * @param {Function} [predicate=_.identity] The function invoked per iteration. * @returns {Array} Returns the slice of `array`. * @example * * var users = [ * { 'user': 'barney', 'active': false }, * { 'user': 'fred', 'active': false }, * { 'user': 'pebbles', 'active': true } * ]; * * _.dropWhile(users, function(o) { return !o.active; }); * // => objects for ['pebbles'] * * // The `_.matches` iteratee shorthand. * _.dropWhile(users, { 'user': 'barney', 'active': false }); * // => objects for ['fred', 'pebbles'] * * // The `_.matchesProperty` iteratee shorthand. * _.dropWhile(users, ['active', false]); * // => objects for ['pebbles'] * * // The `_.property` iteratee shorthand. * _.dropWhile(users, 'active'); * // => objects for ['barney', 'fred', 'pebbles'] */function dropWhile(array,predicate){return array&&array.length?baseWhile(array,getIteratee(predicate,3),true):[];}/** * Fills elements of `array` with `value` from `start` up to, but not * including, `end`. * * **Note:** This method mutates `array`. * * @static * @memberOf _ * @since 3.2.0 * @category Array * @param {Array} array The array to fill. * @param {*} value The value to fill `array` with. * @param {number} [start=0] The start position. * @param {number} [end=array.length] The end position. * @returns {Array} Returns `array`. * @example * * var array = [1, 2, 3]; * * _.fill(array, 'a'); * console.log(array); * // => ['a', 'a', 'a'] * * _.fill(Array(3), 2); * // => [2, 2, 2] * * _.fill([4, 6, 8, 10], '*', 1, 3); * // => [4, '*', '*', 10] */function fill(array,value,start,end){var length=array==null?0:array.length;if(!length){return[];}if(start&&typeof start!='number'&&isIterateeCall(array,value,start)){start=0;end=length;}return baseFill(array,value,start,end);}/** * This method is like `_.find` except that it returns the index of the first * element `predicate` returns truthy for instead of the element itself. * * @static * @memberOf _ * @since 1.1.0 * @category Array * @param {Array} array The array to inspect. * @param {Function} [predicate=_.identity] The function invoked per iteration. * @param {number} [fromIndex=0] The index to search from. * @returns {number} Returns the index of the found element, else `-1`. * @example * * var users = [ * { 'user': 'barney', 'active': false }, * { 'user': 'fred', 'active': false }, * { 'user': 'pebbles', 'active': true } * ]; * * _.findIndex(users, function(o) { return o.user == 'barney'; }); * // => 0 * * // The `_.matches` iteratee shorthand. * _.findIndex(users, { 'user': 'fred', 'active': false }); * // => 1 * * // The `_.matchesProperty` iteratee shorthand. * _.findIndex(users, ['active', false]); * // => 0 * * // The `_.property` iteratee shorthand. * _.findIndex(users, 'active'); * // => 2 */function findIndex(array,predicate,fromIndex){var length=array==null?0:array.length;if(!length){return-1;}var index=fromIndex==null?0:toInteger(fromIndex);if(index<0){index=nativeMax(length+index,0);}return baseFindIndex(array,getIteratee(predicate,3),index);}/** * This method is like `_.findIndex` except that it iterates over elements * of `collection` from right to left. * * @static * @memberOf _ * @since 2.0.0 * @category Array * @param {Array} array The array to inspect. * @param {Function} [predicate=_.identity] The function invoked per iteration. * @param {number} [fromIndex=array.length-1] The index to search from. * @returns {number} Returns the index of the found element, else `-1`. * @example * * var users = [ * { 'user': 'barney', 'active': true }, * { 'user': 'fred', 'active': false }, * { 'user': 'pebbles', 'active': false } * ]; * * _.findLastIndex(users, function(o) { return o.user == 'pebbles'; }); * // => 2 * * // The `_.matches` iteratee shorthand. * _.findLastIndex(users, { 'user': 'barney', 'active': true }); * // => 0 * * // The `_.matchesProperty` iteratee shorthand. * _.findLastIndex(users, ['active', false]); * // => 2 * * // The `_.property` iteratee shorthand. * _.findLastIndex(users, 'active'); * // => 0 */function findLastIndex(array,predicate,fromIndex){var length=array==null?0:array.length;if(!length){return-1;}var index=length-1;if(fromIndex!==undefined){index=toInteger(fromIndex);index=fromIndex<0?nativeMax(length+index,0):nativeMin(index,length-1);}return baseFindIndex(array,getIteratee(predicate,3),index,true);}/** * Flattens `array` a single level deep. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {Array} array The array to flatten. * @returns {Array} Returns the new flattened array. * @example * * _.flatten([1, [2, [3, [4]], 5]]); * // => [1, 2, [3, [4]], 5] */function flatten(array){var length=array==null?0:array.length;return length?baseFlatten(array,1):[];}/** * Recursively flattens `array`. * * @static * @memberOf _ * @since 3.0.0 * @category Array * @param {Array} array The array to flatten. * @returns {Array} Returns the new flattened array. * @example * * _.flattenDeep([1, [2, [3, [4]], 5]]); * // => [1, 2, 3, 4, 5] */function flattenDeep(array){var length=array==null?0:array.length;return length?baseFlatten(array,INFINITY):[];}/** * Recursively flatten `array` up to `depth` times. * * @static * @memberOf _ * @since 4.4.0 * @category Array * @param {Array} array The array to flatten. * @param {number} [depth=1] The maximum recursion depth. * @returns {Array} Returns the new flattened array. * @example * * var array = [1, [2, [3, [4]], 5]]; * * _.flattenDepth(array, 1); * // => [1, 2, [3, [4]], 5] * * _.flattenDepth(array, 2); * // => [1, 2, 3, [4], 5] */function flattenDepth(array,depth){var length=array==null?0:array.length;if(!length){return[];}depth=depth===undefined?1:toInteger(depth);return baseFlatten(array,depth);}/** * The inverse of `_.toPairs`; this method returns an object composed * from key-value `pairs`. * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} pairs The key-value pairs. * @returns {Object} Returns the new object. * @example * * _.fromPairs([['a', 1], ['b', 2]]); * // => { 'a': 1, 'b': 2 } */function fromPairs(pairs){var index=-1,length=pairs==null?0:pairs.length,result={};while(++index 1 * * _.head([]); * // => undefined */function head(array){return array&&array.length?array[0]:undefined;}/** * Gets the index at which the first occurrence of `value` is found in `array` * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero) * for equality comparisons. If `fromIndex` is negative, it's used as the * offset from the end of `array`. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {Array} array The array to inspect. * @param {*} value The value to search for. * @param {number} [fromIndex=0] The index to search from. * @returns {number} Returns the index of the matched value, else `-1`. * @example * * _.indexOf([1, 2, 1, 2], 2); * // => 1 * * // Search from the `fromIndex`. * _.indexOf([1, 2, 1, 2], 2, 2); * // => 3 */function indexOf(array,value,fromIndex){var length=array==null?0:array.length;if(!length){return-1;}var index=fromIndex==null?0:toInteger(fromIndex);if(index<0){index=nativeMax(length+index,0);}return baseIndexOf(array,value,index);}/** * Gets all but the last element of `array`. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {Array} array The array to query. * @returns {Array} Returns the slice of `array`. * @example * * _.initial([1, 2, 3]); * // => [1, 2] */function initial(array){var length=array==null?0:array.length;return length?baseSlice(array,0,-1):[];}/** * Creates an array of unique values that are included in all given arrays * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero) * for equality comparisons. The order and references of result values are * determined by the first array. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {...Array} [arrays] The arrays to inspect. * @returns {Array} Returns the new array of intersecting values. * @example * * _.intersection([2, 1], [2, 3]); * // => [2] */var intersection=baseRest(function(arrays){var mapped=arrayMap(arrays,castArrayLikeObject);return mapped.length&&mapped[0]===arrays[0]?baseIntersection(mapped):[];});/** * This method is like `_.intersection` except that it accepts `iteratee` * which is invoked for each element of each `arrays` to generate the criterion * by which they're compared. The order and references of result values are * determined by the first array. The iteratee is invoked with one argument: * (value). * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {...Array} [arrays] The arrays to inspect. * @param {Function} [iteratee=_.identity] The iteratee invoked per element. * @returns {Array} Returns the new array of intersecting values. * @example * * _.intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor); * // => [2.1] * * // The `_.property` iteratee shorthand. * _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x'); * // => [{ 'x': 1 }] */var intersectionBy=baseRest(function(arrays){var iteratee=last(arrays),mapped=arrayMap(arrays,castArrayLikeObject);if(iteratee===last(mapped)){iteratee=undefined;}else{mapped.pop();}return mapped.length&&mapped[0]===arrays[0]?baseIntersection(mapped,getIteratee(iteratee,2)):[];});/** * This method is like `_.intersection` except that it accepts `comparator` * which is invoked to compare elements of `arrays`. The order and references * of result values are determined by the first array. The comparator is * invoked with two arguments: (arrVal, othVal). * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {...Array} [arrays] The arrays to inspect. * @param {Function} [comparator] The comparator invoked per element. * @returns {Array} Returns the new array of intersecting values. * @example * * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]; * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }]; * * _.intersectionWith(objects, others, _.isEqual); * // => [{ 'x': 1, 'y': 2 }] */var intersectionWith=baseRest(function(arrays){var comparator=last(arrays),mapped=arrayMap(arrays,castArrayLikeObject);comparator=typeof comparator=='function'?comparator:undefined;if(comparator){mapped.pop();}return mapped.length&&mapped[0]===arrays[0]?baseIntersection(mapped,undefined,comparator):[];});/** * Converts all elements in `array` into a string separated by `separator`. * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to convert. * @param {string} [separator=','] The element separator. * @returns {string} Returns the joined string. * @example * * _.join(['a', 'b', 'c'], '~'); * // => 'a~b~c' */function join(array,separator){return array==null?'':nativeJoin.call(array,separator);}/** * Gets the last element of `array`. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {Array} array The array to query. * @returns {*} Returns the last element of `array`. * @example * * _.last([1, 2, 3]); * // => 3 */function last(array){var length=array==null?0:array.length;return length?array[length-1]:undefined;}/** * This method is like `_.indexOf` except that it iterates over elements of * `array` from right to left. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {Array} array The array to inspect. * @param {*} value The value to search for. * @param {number} [fromIndex=array.length-1] The index to search from. * @returns {number} Returns the index of the matched value, else `-1`. * @example * * _.lastIndexOf([1, 2, 1, 2], 2); * // => 3 * * // Search from the `fromIndex`. * _.lastIndexOf([1, 2, 1, 2], 2, 2); * // => 1 */function lastIndexOf(array,value,fromIndex){var length=array==null?0:array.length;if(!length){return-1;}var index=length;if(fromIndex!==undefined){index=toInteger(fromIndex);index=index<0?nativeMax(length+index,0):nativeMin(index,length-1);}return value===value?strictLastIndexOf(array,value,index):baseFindIndex(array,baseIsNaN,index,true);}/** * Gets the element at index `n` of `array`. If `n` is negative, the nth * element from the end is returned. * * @static * @memberOf _ * @since 4.11.0 * @category Array * @param {Array} array The array to query. * @param {number} [n=0] The index of the element to return. * @returns {*} Returns the nth element of `array`. * @example * * var array = ['a', 'b', 'c', 'd']; * * _.nth(array, 1); * // => 'b' * * _.nth(array, -2); * // => 'c'; */function nth(array,n){return array&&array.length?baseNth(array,toInteger(n)):undefined;}/** * Removes all given values from `array` using * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero) * for equality comparisons. * * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove` * to remove elements from an array by predicate. * * @static * @memberOf _ * @since 2.0.0 * @category Array * @param {Array} array The array to modify. * @param {...*} [values] The values to remove. * @returns {Array} Returns `array`. * @example * * var array = ['a', 'b', 'c', 'a', 'b', 'c']; * * _.pull(array, 'a', 'c'); * console.log(array); * // => ['b', 'b'] */var pull=baseRest(pullAll);/** * This method is like `_.pull` except that it accepts an array of values to remove. * * **Note:** Unlike `_.difference`, this method mutates `array`. * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to modify. * @param {Array} values The values to remove. * @returns {Array} Returns `array`. * @example * * var array = ['a', 'b', 'c', 'a', 'b', 'c']; * * _.pullAll(array, ['a', 'c']); * console.log(array); * // => ['b', 'b'] */function pullAll(array,values){return array&&array.length&&values&&values.length?basePullAll(array,values):array;}/** * This method is like `_.pullAll` except that it accepts `iteratee` which is * invoked for each element of `array` and `values` to generate the criterion * by which they're compared. The iteratee is invoked with one argument: (value). * * **Note:** Unlike `_.differenceBy`, this method mutates `array`. * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to modify. * @param {Array} values The values to remove. * @param {Function} [iteratee=_.identity] The iteratee invoked per element. * @returns {Array} Returns `array`. * @example * * var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }]; * * _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x'); * console.log(array); * // => [{ 'x': 2 }] */function pullAllBy(array,values,iteratee){return array&&array.length&&values&&values.length?basePullAll(array,values,getIteratee(iteratee,2)):array;}/** * This method is like `_.pullAll` except that it accepts `comparator` which * is invoked to compare elements of `array` to `values`. The comparator is * invoked with two arguments: (arrVal, othVal). * * **Note:** Unlike `_.differenceWith`, this method mutates `array`. * * @static * @memberOf _ * @since 4.6.0 * @category Array * @param {Array} array The array to modify. * @param {Array} values The values to remove. * @param {Function} [comparator] The comparator invoked per element. * @returns {Array} Returns `array`. * @example * * var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }]; * * _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual); * console.log(array); * // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }] */function pullAllWith(array,values,comparator){return array&&array.length&&values&&values.length?basePullAll(array,values,undefined,comparator):array;}/** * Removes elements from `array` corresponding to `indexes` and returns an * array of removed elements. * * **Note:** Unlike `_.at`, this method mutates `array`. * * @static * @memberOf _ * @since 3.0.0 * @category Array * @param {Array} array The array to modify. * @param {...(number|number[])} [indexes] The indexes of elements to remove. * @returns {Array} Returns the new array of removed elements. * @example * * var array = ['a', 'b', 'c', 'd']; * var pulled = _.pullAt(array, [1, 3]); * * console.log(array); * // => ['a', 'c'] * * console.log(pulled); * // => ['b', 'd'] */var pullAt=flatRest(function(array,indexes){var length=array==null?0:array.length,result=baseAt(array,indexes);basePullAt(array,arrayMap(indexes,function(index){return isIndex(index,length)?+index:index;}).sort(compareAscending));return result;});/** * Removes all elements from `array` that `predicate` returns truthy for * and returns an array of the removed elements. The predicate is invoked * with three arguments: (value, index, array). * * **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull` * to pull elements from an array by value. * * @static * @memberOf _ * @since 2.0.0 * @category Array * @param {Array} array The array to modify. * @param {Function} [predicate=_.identity] The function invoked per iteration. * @returns {Array} Returns the new array of removed elements. * @example * * var array = [1, 2, 3, 4]; * var evens = _.remove(array, function(n) { * return n % 2 == 0; * }); * * console.log(array); * // => [1, 3] * * console.log(evens); * // => [2, 4] */function remove(array,predicate){var result=[];if(!(array&&array.length)){return result;}var index=-1,indexes=[],length=array.length;predicate=getIteratee(predicate,3);while(++index [3, 2, 1] * * console.log(array); * // => [3, 2, 1] */function reverse(array){return array==null?array:nativeReverse.call(array);}/** * Creates a slice of `array` from `start` up to, but not including, `end`. * * **Note:** This method is used instead of * [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are * returned. * * @static * @memberOf _ * @since 3.0.0 * @category Array * @param {Array} array The array to slice. * @param {number} [start=0] The start position. * @param {number} [end=array.length] The end position. * @returns {Array} Returns the slice of `array`. */function slice(array,start,end){var length=array==null?0:array.length;if(!length){return[];}if(end&&typeof end!='number'&&isIterateeCall(array,start,end)){start=0;end=length;}else{start=start==null?0:toInteger(start);end=end===undefined?length:toInteger(end);}return baseSlice(array,start,end);}/** * Uses a binary search to determine the lowest index at which `value` * should be inserted into `array` in order to maintain its sort order. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {Array} array The sorted array to inspect. * @param {*} value The value to evaluate. * @returns {number} Returns the index at which `value` should be inserted * into `array`. * @example * * _.sortedIndex([30, 50], 40); * // => 1 */function sortedIndex(array,value){return baseSortedIndex(array,value);}/** * This method is like `_.sortedIndex` except that it accepts `iteratee` * which is invoked for `value` and each element of `array` to compute their * sort ranking. The iteratee is invoked with one argument: (value). * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The sorted array to inspect. * @param {*} value The value to evaluate. * @param {Function} [iteratee=_.identity] The iteratee invoked per element. * @returns {number} Returns the index at which `value` should be inserted * into `array`. * @example * * var objects = [{ 'x': 4 }, { 'x': 5 }]; * * _.sortedIndexBy(objects, { 'x': 4 }, function(o) { return o.x; }); * // => 0 * * // The `_.property` iteratee shorthand. * _.sortedIndexBy(objects, { 'x': 4 }, 'x'); * // => 0 */function sortedIndexBy(array,value,iteratee){return baseSortedIndexBy(array,value,getIteratee(iteratee,2));}/** * This method is like `_.indexOf` except that it performs a binary * search on a sorted `array`. * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to inspect. * @param {*} value The value to search for. * @returns {number} Returns the index of the matched value, else `-1`. * @example * * _.sortedIndexOf([4, 5, 5, 5, 6], 5); * // => 1 */function sortedIndexOf(array,value){var length=array==null?0:array.length;if(length){var index=baseSortedIndex(array,value);if(index 4 */function sortedLastIndex(array,value){return baseSortedIndex(array,value,true);}/** * This method is like `_.sortedLastIndex` except that it accepts `iteratee` * which is invoked for `value` and each element of `array` to compute their * sort ranking. The iteratee is invoked with one argument: (value). * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The sorted array to inspect. * @param {*} value The value to evaluate. * @param {Function} [iteratee=_.identity] The iteratee invoked per element. * @returns {number} Returns the index at which `value` should be inserted * into `array`. * @example * * var objects = [{ 'x': 4 }, { 'x': 5 }]; * * _.sortedLastIndexBy(objects, { 'x': 4 }, function(o) { return o.x; }); * // => 1 * * // The `_.property` iteratee shorthand. * _.sortedLastIndexBy(objects, { 'x': 4 }, 'x'); * // => 1 */function sortedLastIndexBy(array,value,iteratee){return baseSortedIndexBy(array,value,getIteratee(iteratee,2),true);}/** * This method is like `_.lastIndexOf` except that it performs a binary * search on a sorted `array`. * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to inspect. * @param {*} value The value to search for. * @returns {number} Returns the index of the matched value, else `-1`. * @example * * _.sortedLastIndexOf([4, 5, 5, 5, 6], 5); * // => 3 */function sortedLastIndexOf(array,value){var length=array==null?0:array.length;if(length){var index=baseSortedIndex(array,value,true)-1;if(eq(array[index],value)){return index;}}return-1;}/** * This method is like `_.uniq` except that it's designed and optimized * for sorted arrays. * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to inspect. * @returns {Array} Returns the new duplicate free array. * @example * * _.sortedUniq([1, 1, 2]); * // => [1, 2] */function sortedUniq(array){return array&&array.length?baseSortedUniq(array):[];}/** * This method is like `_.uniqBy` except that it's designed and optimized * for sorted arrays. * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to inspect. * @param {Function} [iteratee] The iteratee invoked per element. * @returns {Array} Returns the new duplicate free array. * @example * * _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor); * // => [1.1, 2.3] */function sortedUniqBy(array,iteratee){return array&&array.length?baseSortedUniq(array,getIteratee(iteratee,2)):[];}/** * Gets all but the first element of `array`. * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to query. * @returns {Array} Returns the slice of `array`. * @example * * _.tail([1, 2, 3]); * // => [2, 3] */function tail(array){var length=array==null?0:array.length;return length?baseSlice(array,1,length):[];}/** * Creates a slice of `array` with `n` elements taken from the beginning. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {Array} array The array to query. * @param {number} [n=1] The number of elements to take. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {Array} Returns the slice of `array`. * @example * * _.take([1, 2, 3]); * // => [1] * * _.take([1, 2, 3], 2); * // => [1, 2] * * _.take([1, 2, 3], 5); * // => [1, 2, 3] * * _.take([1, 2, 3], 0); * // => [] */function take(array,n,guard){if(!(array&&array.length)){return[];}n=guard||n===undefined?1:toInteger(n);return baseSlice(array,0,n<0?0:n);}/** * Creates a slice of `array` with `n` elements taken from the end. * * @static * @memberOf _ * @since 3.0.0 * @category Array * @param {Array} array The array to query. * @param {number} [n=1] The number of elements to take. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {Array} Returns the slice of `array`. * @example * * _.takeRight([1, 2, 3]); * // => [3] * * _.takeRight([1, 2, 3], 2); * // => [2, 3] * * _.takeRight([1, 2, 3], 5); * // => [1, 2, 3] * * _.takeRight([1, 2, 3], 0); * // => [] */function takeRight(array,n,guard){var length=array==null?0:array.length;if(!length){return[];}n=guard||n===undefined?1:toInteger(n);n=length-n;return baseSlice(array,n<0?0:n,length);}/** * Creates a slice of `array` with elements taken from the end. Elements are * taken until `predicate` returns falsey. The predicate is invoked with * three arguments: (value, index, array). * * @static * @memberOf _ * @since 3.0.0 * @category Array * @param {Array} array The array to query. * @param {Function} [predicate=_.identity] The function invoked per iteration. * @returns {Array} Returns the slice of `array`. * @example * * var users = [ * { 'user': 'barney', 'active': true }, * { 'user': 'fred', 'active': false }, * { 'user': 'pebbles', 'active': false } * ]; * * _.takeRightWhile(users, function(o) { return !o.active; }); * // => objects for ['fred', 'pebbles'] * * // The `_.matches` iteratee shorthand. * _.takeRightWhile(users, { 'user': 'pebbles', 'active': false }); * // => objects for ['pebbles'] * * // The `_.matchesProperty` iteratee shorthand. * _.takeRightWhile(users, ['active', false]); * // => objects for ['fred', 'pebbles'] * * // The `_.property` iteratee shorthand. * _.takeRightWhile(users, 'active'); * // => [] */function takeRightWhile(array,predicate){return array&&array.length?baseWhile(array,getIteratee(predicate,3),false,true):[];}/** * Creates a slice of `array` with elements taken from the beginning. Elements * are taken until `predicate` returns falsey. The predicate is invoked with * three arguments: (value, index, array). * * @static * @memberOf _ * @since 3.0.0 * @category Array * @param {Array} array The array to query. * @param {Function} [predicate=_.identity] The function invoked per iteration. * @returns {Array} Returns the slice of `array`. * @example * * var users = [ * { 'user': 'barney', 'active': false }, * { 'user': 'fred', 'active': false }, * { 'user': 'pebbles', 'active': true } * ]; * * _.takeWhile(users, function(o) { return !o.active; }); * // => objects for ['barney', 'fred'] * * // The `_.matches` iteratee shorthand. * _.takeWhile(users, { 'user': 'barney', 'active': false }); * // => objects for ['barney'] * * // The `_.matchesProperty` iteratee shorthand. * _.takeWhile(users, ['active', false]); * // => objects for ['barney', 'fred'] * * // The `_.property` iteratee shorthand. * _.takeWhile(users, 'active'); * // => [] */function takeWhile(array,predicate){return array&&array.length?baseWhile(array,getIteratee(predicate,3)):[];}/** * Creates an array of unique values, in order, from all given arrays using * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero) * for equality comparisons. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {...Array} [arrays] The arrays to inspect. * @returns {Array} Returns the new array of combined values. * @example * * _.union([2], [1, 2]); * // => [2, 1] */var union=baseRest(function(arrays){return baseUniq(baseFlatten(arrays,1,isArrayLikeObject,true));});/** * This method is like `_.union` except that it accepts `iteratee` which is * invoked for each element of each `arrays` to generate the criterion by * which uniqueness is computed. Result values are chosen from the first * array in which the value occurs. The iteratee is invoked with one argument: * (value). * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {...Array} [arrays] The arrays to inspect. * @param {Function} [iteratee=_.identity] The iteratee invoked per element. * @returns {Array} Returns the new array of combined values. * @example * * _.unionBy([2.1], [1.2, 2.3], Math.floor); * // => [2.1, 1.2] * * // The `_.property` iteratee shorthand. * _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x'); * // => [{ 'x': 1 }, { 'x': 2 }] */var unionBy=baseRest(function(arrays){var iteratee=last(arrays);if(isArrayLikeObject(iteratee)){iteratee=undefined;}return baseUniq(baseFlatten(arrays,1,isArrayLikeObject,true),getIteratee(iteratee,2));});/** * This method is like `_.union` except that it accepts `comparator` which * is invoked to compare elements of `arrays`. Result values are chosen from * the first array in which the value occurs. The comparator is invoked * with two arguments: (arrVal, othVal). * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {...Array} [arrays] The arrays to inspect. * @param {Function} [comparator] The comparator invoked per element. * @returns {Array} Returns the new array of combined values. * @example * * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]; * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }]; * * _.unionWith(objects, others, _.isEqual); * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }] */var unionWith=baseRest(function(arrays){var comparator=last(arrays);comparator=typeof comparator=='function'?comparator:undefined;return baseUniq(baseFlatten(arrays,1,isArrayLikeObject,true),undefined,comparator);});/** * Creates a duplicate-free version of an array, using * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero) * for equality comparisons, in which only the first occurrence of each element * is kept. The order of result values is determined by the order they occur * in the array. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {Array} array The array to inspect. * @returns {Array} Returns the new duplicate free array. * @example * * _.uniq([2, 1, 2]); * // => [2, 1] */function uniq(array){return array&&array.length?baseUniq(array):[];}/** * This method is like `_.uniq` except that it accepts `iteratee` which is * invoked for each element in `array` to generate the criterion by which * uniqueness is computed. The order of result values is determined by the * order they occur in the array. The iteratee is invoked with one argument: * (value). * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to inspect. * @param {Function} [iteratee=_.identity] The iteratee invoked per element. * @returns {Array} Returns the new duplicate free array. * @example * * _.uniqBy([2.1, 1.2, 2.3], Math.floor); * // => [2.1, 1.2] * * // The `_.property` iteratee shorthand. * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x'); * // => [{ 'x': 1 }, { 'x': 2 }] */function uniqBy(array,iteratee){return array&&array.length?baseUniq(array,getIteratee(iteratee,2)):[];}/** * This method is like `_.uniq` except that it accepts `comparator` which * is invoked to compare elements of `array`. The order of result values is * determined by the order they occur in the array.The comparator is invoked * with two arguments: (arrVal, othVal). * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {Array} array The array to inspect. * @param {Function} [comparator] The comparator invoked per element. * @returns {Array} Returns the new duplicate free array. * @example * * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 2 }]; * * _.uniqWith(objects, _.isEqual); * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }] */function uniqWith(array,comparator){comparator=typeof comparator=='function'?comparator:undefined;return array&&array.length?baseUniq(array,undefined,comparator):[];}/** * This method is like `_.zip` except that it accepts an array of grouped * elements and creates an array regrouping the elements to their pre-zip * configuration. * * @static * @memberOf _ * @since 1.2.0 * @category Array * @param {Array} array The array of grouped elements to process. * @returns {Array} Returns the new array of regrouped elements. * @example * * var zipped = _.zip(['a', 'b'], [1, 2], [true, false]); * // => [['a', 1, true], ['b', 2, false]] * * _.unzip(zipped); * // => [['a', 'b'], [1, 2], [true, false]] */function unzip(array){if(!(array&&array.length)){return[];}var length=0;array=arrayFilter(array,function(group){if(isArrayLikeObject(group)){length=nativeMax(group.length,length);return true;}});return baseTimes(length,function(index){return arrayMap(array,baseProperty(index));});}/** * This method is like `_.unzip` except that it accepts `iteratee` to specify * how regrouped values should be combined. The iteratee is invoked with the * elements of each group: (...group). * * @static * @memberOf _ * @since 3.8.0 * @category Array * @param {Array} array The array of grouped elements to process. * @param {Function} [iteratee=_.identity] The function to combine * regrouped values. * @returns {Array} Returns the new array of regrouped elements. * @example * * var zipped = _.zip([1, 2], [10, 20], [100, 200]); * // => [[1, 10, 100], [2, 20, 200]] * * _.unzipWith(zipped, _.add); * // => [3, 30, 300] */function unzipWith(array,iteratee){if(!(array&&array.length)){return[];}var result=unzip(array);if(iteratee==null){return result;}return arrayMap(result,function(group){return apply(iteratee,undefined,group);});}/** * Creates an array excluding all given values using * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero) * for equality comparisons. * * **Note:** Unlike `_.pull`, this method returns a new array. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {Array} array The array to inspect. * @param {...*} [values] The values to exclude. * @returns {Array} Returns the new array of filtered values. * @see _.difference, _.xor * @example * * _.without([2, 1, 2, 3], 1, 2); * // => [3] */var without=baseRest(function(array,values){return isArrayLikeObject(array)?baseDifference(array,values):[];});/** * Creates an array of unique values that is the * [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference) * of the given arrays. The order of result values is determined by the order * they occur in the arrays. * * @static * @memberOf _ * @since 2.4.0 * @category Array * @param {...Array} [arrays] The arrays to inspect. * @returns {Array} Returns the new array of filtered values. * @see _.difference, _.without * @example * * _.xor([2, 1], [2, 3]); * // => [1, 3] */var xor=baseRest(function(arrays){return baseXor(arrayFilter(arrays,isArrayLikeObject));});/** * This method is like `_.xor` except that it accepts `iteratee` which is * invoked for each element of each `arrays` to generate the criterion by * which by which they're compared. The order of result values is determined * by the order they occur in the arrays. The iteratee is invoked with one * argument: (value). * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {...Array} [arrays] The arrays to inspect. * @param {Function} [iteratee=_.identity] The iteratee invoked per element. * @returns {Array} Returns the new array of filtered values. * @example * * _.xorBy([2.1, 1.2], [2.3, 3.4], Math.floor); * // => [1.2, 3.4] * * // The `_.property` iteratee shorthand. * _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x'); * // => [{ 'x': 2 }] */var xorBy=baseRest(function(arrays){var iteratee=last(arrays);if(isArrayLikeObject(iteratee)){iteratee=undefined;}return baseXor(arrayFilter(arrays,isArrayLikeObject),getIteratee(iteratee,2));});/** * This method is like `_.xor` except that it accepts `comparator` which is * invoked to compare elements of `arrays`. The order of result values is * determined by the order they occur in the arrays. The comparator is invoked * with two arguments: (arrVal, othVal). * * @static * @memberOf _ * @since 4.0.0 * @category Array * @param {...Array} [arrays] The arrays to inspect. * @param {Function} [comparator] The comparator invoked per element. * @returns {Array} Returns the new array of filtered values. * @example * * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]; * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }]; * * _.xorWith(objects, others, _.isEqual); * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }] */var xorWith=baseRest(function(arrays){var comparator=last(arrays);comparator=typeof comparator=='function'?comparator:undefined;return baseXor(arrayFilter(arrays,isArrayLikeObject),undefined,comparator);});/** * Creates an array of grouped elements, the first of which contains the * first elements of the given arrays, the second of which contains the * second elements of the given arrays, and so on. * * @static * @memberOf _ * @since 0.1.0 * @category Array * @param {...Array} [arrays] The arrays to process. * @returns {Array} Returns the new array of grouped elements. * @example * * _.zip(['a', 'b'], [1, 2], [true, false]); * // => [['a', 1, true], ['b', 2, false]] */var zip=baseRest(unzip);/** * This method is like `_.fromPairs` except that it accepts two arrays, * one of property identifiers and one of corresponding values. * * @static * @memberOf _ * @since 0.4.0 * @category Array * @param {Array} [props=[]] The property identifiers. * @param {Array} [values=[]] The property values. * @returns {Object} Returns the new object. * @example * * _.zipObject(['a', 'b'], [1, 2]); * // => { 'a': 1, 'b': 2 } */function zipObject(props,values){return baseZipObject(props||[],values||[],assignValue);}/** * This method is like `_.zipObject` except that it supports property paths. * * @static * @memberOf _ * @since 4.1.0 * @category Array * @param {Array} [props=[]] The property identifiers. * @param {Array} [values=[]] The property values. * @returns {Object} Returns the new object. * @example * * _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]); * // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } } */function zipObjectDeep(props,values){return baseZipObject(props||[],values||[],baseSet);}/** * This method is like `_.zip` except that it accepts `iteratee` to specify * how grouped values should be combined. The iteratee is invoked with the * elements of each group: (...group). * * @static * @memberOf _ * @since 3.8.0 * @category Array * @param {...Array} [arrays] The arrays to process. * @param {Function} [iteratee=_.identity] The function to combine * grouped values. * @returns {Array} Returns the new array of grouped elements. * @example * * _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) { * return a + b + c; * }); * // => [111, 222] */var zipWith=baseRest(function(arrays){var length=arrays.length,iteratee=length>1?arrays[length-1]:undefined;iteratee=typeof iteratee=='function'?(arrays.pop(),iteratee):undefined;return unzipWith(arrays,iteratee);});/*------------------------------------------------------------------------*//** * Creates a `lodash` wrapper instance that wraps `value` with explicit method * chain sequences enabled. The result of such sequences must be unwrapped * with `_#value`. * * @static * @memberOf _ * @since 1.3.0 * @category Seq * @param {*} value The value to wrap. * @returns {Object} Returns the new `lodash` wrapper instance. * @example * * var users = [ * { 'user': 'barney', 'age': 36 }, * { 'user': 'fred', 'age': 40 }, * { 'user': 'pebbles', 'age': 1 } * ]; * * var youngest = _ * .chain(users) * .sortBy('age') * .map(function(o) { * return o.user + ' is ' + o.age; * }) * .head() * .value(); * // => 'pebbles is 1' */function chain(value){var result=lodash(value);result.__chain__=true;return result;}/** * This method invokes `interceptor` and returns `value`. The interceptor * is invoked with one argument; (value). The purpose of this method is to * "tap into" a method chain sequence in order to modify intermediate results. * * @static * @memberOf _ * @since 0.1.0 * @category Seq * @param {*} value The value to provide to `interceptor`. * @param {Function} interceptor The function to invoke. * @returns {*} Returns `value`. * @example * * _([1, 2, 3]) * .tap(function(array) { * // Mutate input array. * array.pop(); * }) * .reverse() * .value(); * // => [2, 1] */function tap(value,interceptor){interceptor(value);return value;}/** * This method is like `_.tap` except that it returns the result of `interceptor`. * The purpose of this method is to "pass thru" values replacing intermediate * results in a method chain sequence. * * @static * @memberOf _ * @since 3.0.0 * @category Seq * @param {*} value The value to provide to `interceptor`. * @param {Function} interceptor The function to invoke. * @returns {*} Returns the result of `interceptor`. * @example * * _(' abc ') * .chain() * .trim() * .thru(function(value) { * return [value]; * }) * .value(); * // => ['abc'] */function thru(value,interceptor){return interceptor(value);}/** * This method is the wrapper version of `_.at`. * * @name at * @memberOf _ * @since 1.0.0 * @category Seq * @param {...(string|string[])} [paths] The property paths to pick. * @returns {Object} Returns the new `lodash` wrapper instance. * @example * * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] }; * * _(object).at(['a[0].b.c', 'a[1]']).value(); * // => [3, 4] */var wrapperAt=flatRest(function(paths){var length=paths.length,start=length?paths[0]:0,value=this.__wrapped__,interceptor=function interceptor(object){return baseAt(object,paths);};if(length>1||this.__actions__.length||!(value instanceof LazyWrapper)||!isIndex(start)){return this.thru(interceptor);}value=value.slice(start,+start+(length?1:0));value.__actions__.push({'func':thru,'args':[interceptor],'thisArg':undefined});return new LodashWrapper(value,this.__chain__).thru(function(array){if(length&&!array.length){array.push(undefined);}return array;});});/** * Creates a `lodash` wrapper instance with explicit method chain sequences enabled. * * @name chain * @memberOf _ * @since 0.1.0 * @category Seq * @returns {Object} Returns the new `lodash` wrapper instance. * @example * * var users = [ * { 'user': 'barney', 'age': 36 }, * { 'user': 'fred', 'age': 40 } * ]; * * // A sequence without explicit chaining. * _(users).head(); * // => { 'user': 'barney', 'age': 36 } * * // A sequence with explicit chaining. * _(users) * .chain() * .head() * .pick('user') * .value(); * // => { 'user': 'barney' } */function wrapperChain(){return chain(this);}/** * Executes the chain sequence and returns the wrapped result. * * @name commit * @memberOf _ * @since 3.2.0 * @category Seq * @returns {Object} Returns the new `lodash` wrapper instance. * @example * * var array = [1, 2]; * var wrapped = _(array).push(3); * * console.log(array); * // => [1, 2] * * wrapped = wrapped.commit(); * console.log(array); * // => [1, 2, 3] * * wrapped.last(); * // => 3 * * console.log(array); * // => [1, 2, 3] */function wrapperCommit(){return new LodashWrapper(this.value(),this.__chain__);}/** * Gets the next value on a wrapped object following the * [iterator protocol](https://mdn.io/iteration_protocols#iterator). * * @name next * @memberOf _ * @since 4.0.0 * @category Seq * @returns {Object} Returns the next iterator value. * @example * * var wrapped = _([1, 2]); * * wrapped.next(); * // => { 'done': false, 'value': 1 } * * wrapped.next(); * // => { 'done': false, 'value': 2 } * * wrapped.next(); * // => { 'done': true, 'value': undefined } */function wrapperNext(){if(this.__values__===undefined){this.__values__=toArray(this.value());}var done=this.__index__>=this.__values__.length,value=done?undefined:this.__values__[this.__index__++];return{'done':done,'value':value};}/** * Enables the wrapper to be iterable. * * @name Symbol.iterator * @memberOf _ * @since 4.0.0 * @category Seq * @returns {Object} Returns the wrapper object. * @example * * var wrapped = _([1, 2]); * * wrapped[Symbol.iterator]() === wrapped; * // => true * * Array.from(wrapped); * // => [1, 2] */function wrapperToIterator(){return this;}/** * Creates a clone of the chain sequence planting `value` as the wrapped value. * * @name plant * @memberOf _ * @since 3.2.0 * @category Seq * @param {*} value The value to plant. * @returns {Object} Returns the new `lodash` wrapper instance. * @example * * function square(n) { * return n * n; * } * * var wrapped = _([1, 2]).map(square); * var other = wrapped.plant([3, 4]); * * other.value(); * // => [9, 16] * * wrapped.value(); * // => [1, 4] */function wrapperPlant(value){var result,parent=this;while(parent instanceof baseLodash){var clone=wrapperClone(parent);clone.__index__=0;clone.__values__=undefined;if(result){previous.__wrapped__=clone;}else{result=clone;}var previous=clone;parent=parent.__wrapped__;}previous.__wrapped__=value;return result;}/** * This method is the wrapper version of `_.reverse`. * * **Note:** This method mutates the wrapped array. * * @name reverse * @memberOf _ * @since 0.1.0 * @category Seq * @returns {Object} Returns the new `lodash` wrapper instance. * @example * * var array = [1, 2, 3]; * * _(array).reverse().value() * // => [3, 2, 1] * * console.log(array); * // => [3, 2, 1] */function wrapperReverse(){var value=this.__wrapped__;if(value instanceof LazyWrapper){var wrapped=value;if(this.__actions__.length){wrapped=new LazyWrapper(this);}wrapped=wrapped.reverse();wrapped.__actions__.push({'func':thru,'args':[reverse],'thisArg':undefined});return new LodashWrapper(wrapped,this.__chain__);}return this.thru(reverse);}/** * Executes the chain sequence to resolve the unwrapped value. * * @name value * @memberOf _ * @since 0.1.0 * @alias toJSON, valueOf * @category Seq * @returns {*} Returns the resolved unwrapped value. * @example * * _([1, 2, 3]).value(); * // => [1, 2, 3] */function wrapperValue(){return baseWrapperValue(this.__wrapped__,this.__actions__);}/*------------------------------------------------------------------------*//** * Creates an object composed of keys generated from the results of running * each element of `collection` thru `iteratee`. The corresponding value of * each key is the number of times the key was returned by `iteratee`. The * iteratee is invoked with one argument: (value). * * @static * @memberOf _ * @since 0.5.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Function} [iteratee=_.identity] The iteratee to transform keys. * @returns {Object} Returns the composed aggregate object. * @example * * _.countBy([6.1, 4.2, 6.3], Math.floor); * // => { '4': 1, '6': 2 } * * // The `_.property` iteratee shorthand. * _.countBy(['one', 'two', 'three'], 'length'); * // => { '3': 2, '5': 1 } */var countBy=createAggregator(function(result,value,key){if(hasOwnProperty.call(result,key)){++result[key];}else{baseAssignValue(result,key,1);}});/** * Checks if `predicate` returns truthy for **all** elements of `collection`. * Iteration is stopped once `predicate` returns falsey. The predicate is * invoked with three arguments: (value, index|key, collection). * * **Note:** This method returns `true` for * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of * elements of empty collections. * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Function} [predicate=_.identity] The function invoked per iteration. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {boolean} Returns `true` if all elements pass the predicate check, * else `false`. * @example * * _.every([true, 1, null, 'yes'], Boolean); * // => false * * var users = [ * { 'user': 'barney', 'age': 36, 'active': false }, * { 'user': 'fred', 'age': 40, 'active': false } * ]; * * // The `_.matches` iteratee shorthand. * _.every(users, { 'user': 'barney', 'active': false }); * // => false * * // The `_.matchesProperty` iteratee shorthand. * _.every(users, ['active', false]); * // => true * * // The `_.property` iteratee shorthand. * _.every(users, 'active'); * // => false */function every(collection,predicate,guard){var func=isArray(collection)?arrayEvery:baseEvery;if(guard&&isIterateeCall(collection,predicate,guard)){predicate=undefined;}return func(collection,getIteratee(predicate,3));}/** * Iterates over elements of `collection`, returning an array of all elements * `predicate` returns truthy for. The predicate is invoked with three * arguments: (value, index|key, collection). * * **Note:** Unlike `_.remove`, this method returns a new array. * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Function} [predicate=_.identity] The function invoked per iteration. * @returns {Array} Returns the new filtered array. * @see _.reject * @example * * var users = [ * { 'user': 'barney', 'age': 36, 'active': true }, * { 'user': 'fred', 'age': 40, 'active': false } * ]; * * _.filter(users, function(o) { return !o.active; }); * // => objects for ['fred'] * * // The `_.matches` iteratee shorthand. * _.filter(users, { 'age': 36, 'active': true }); * // => objects for ['barney'] * * // The `_.matchesProperty` iteratee shorthand. * _.filter(users, ['active', false]); * // => objects for ['fred'] * * // The `_.property` iteratee shorthand. * _.filter(users, 'active'); * // => objects for ['barney'] */function filter(collection,predicate){var func=isArray(collection)?arrayFilter:baseFilter;return func(collection,getIteratee(predicate,3));}/** * Iterates over elements of `collection`, returning the first element * `predicate` returns truthy for. The predicate is invoked with three * arguments: (value, index|key, collection). * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object} collection The collection to inspect. * @param {Function} [predicate=_.identity] The function invoked per iteration. * @param {number} [fromIndex=0] The index to search from. * @returns {*} Returns the matched element, else `undefined`. * @example * * var users = [ * { 'user': 'barney', 'age': 36, 'active': true }, * { 'user': 'fred', 'age': 40, 'active': false }, * { 'user': 'pebbles', 'age': 1, 'active': true } * ]; * * _.find(users, function(o) { return o.age < 40; }); * // => object for 'barney' * * // The `_.matches` iteratee shorthand. * _.find(users, { 'age': 1, 'active': true }); * // => object for 'pebbles' * * // The `_.matchesProperty` iteratee shorthand. * _.find(users, ['active', false]); * // => object for 'fred' * * // The `_.property` iteratee shorthand. * _.find(users, 'active'); * // => object for 'barney' */var find=createFind(findIndex);/** * This method is like `_.find` except that it iterates over elements of * `collection` from right to left. * * @static * @memberOf _ * @since 2.0.0 * @category Collection * @param {Array|Object} collection The collection to inspect. * @param {Function} [predicate=_.identity] The function invoked per iteration. * @param {number} [fromIndex=collection.length-1] The index to search from. * @returns {*} Returns the matched element, else `undefined`. * @example * * _.findLast([1, 2, 3, 4], function(n) { * return n % 2 == 1; * }); * // => 3 */var findLast=createFind(findLastIndex);/** * Creates a flattened array of values by running each element in `collection` * thru `iteratee` and flattening the mapped results. The iteratee is invoked * with three arguments: (value, index|key, collection). * * @static * @memberOf _ * @since 4.0.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @returns {Array} Returns the new flattened array. * @example * * function duplicate(n) { * return [n, n]; * } * * _.flatMap([1, 2], duplicate); * // => [1, 1, 2, 2] */function flatMap(collection,iteratee){return baseFlatten(map(collection,iteratee),1);}/** * This method is like `_.flatMap` except that it recursively flattens the * mapped results. * * @static * @memberOf _ * @since 4.7.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @returns {Array} Returns the new flattened array. * @example * * function duplicate(n) { * return [[[n, n]]]; * } * * _.flatMapDeep([1, 2], duplicate); * // => [1, 1, 2, 2] */function flatMapDeep(collection,iteratee){return baseFlatten(map(collection,iteratee),INFINITY);}/** * This method is like `_.flatMap` except that it recursively flattens the * mapped results up to `depth` times. * * @static * @memberOf _ * @since 4.7.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @param {number} [depth=1] The maximum recursion depth. * @returns {Array} Returns the new flattened array. * @example * * function duplicate(n) { * return [[[n, n]]]; * } * * _.flatMapDepth([1, 2], duplicate, 2); * // => [[1, 1], [2, 2]] */function flatMapDepth(collection,iteratee,depth){depth=depth===undefined?1:toInteger(depth);return baseFlatten(map(collection,iteratee),depth);}/** * Iterates over elements of `collection` and invokes `iteratee` for each element. * The iteratee is invoked with three arguments: (value, index|key, collection). * Iteratee functions may exit iteration early by explicitly returning `false`. * * **Note:** As with other "Collections" methods, objects with a "length" * property are iterated like arrays. To avoid this behavior use `_.forIn` * or `_.forOwn` for object iteration. * * @static * @memberOf _ * @since 0.1.0 * @alias each * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @returns {Array|Object} Returns `collection`. * @see _.forEachRight * @example * * _.forEach([1, 2], function(value) { * console.log(value); * }); * // => Logs `1` then `2`. * * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) { * console.log(key); * }); * // => Logs 'a' then 'b' (iteration order is not guaranteed). */function forEach(collection,iteratee){var func=isArray(collection)?arrayEach:baseEach;return func(collection,getIteratee(iteratee,3));}/** * This method is like `_.forEach` except that it iterates over elements of * `collection` from right to left. * * @static * @memberOf _ * @since 2.0.0 * @alias eachRight * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @returns {Array|Object} Returns `collection`. * @see _.forEach * @example * * _.forEachRight([1, 2], function(value) { * console.log(value); * }); * // => Logs `2` then `1`. */function forEachRight(collection,iteratee){var func=isArray(collection)?arrayEachRight:baseEachRight;return func(collection,getIteratee(iteratee,3));}/** * Creates an object composed of keys generated from the results of running * each element of `collection` thru `iteratee`. The order of grouped values * is determined by the order they occur in `collection`. The corresponding * value of each key is an array of elements responsible for generating the * key. The iteratee is invoked with one argument: (value). * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Function} [iteratee=_.identity] The iteratee to transform keys. * @returns {Object} Returns the composed aggregate object. * @example * * _.groupBy([6.1, 4.2, 6.3], Math.floor); * // => { '4': [4.2], '6': [6.1, 6.3] } * * // The `_.property` iteratee shorthand. * _.groupBy(['one', 'two', 'three'], 'length'); * // => { '3': ['one', 'two'], '5': ['three'] } */var groupBy=createAggregator(function(result,value,key){if(hasOwnProperty.call(result,key)){result[key].push(value);}else{baseAssignValue(result,key,[value]);}});/** * Checks if `value` is in `collection`. If `collection` is a string, it's * checked for a substring of `value`, otherwise * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero) * is used for equality comparisons. If `fromIndex` is negative, it's used as * the offset from the end of `collection`. * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object|string} collection The collection to inspect. * @param {*} value The value to search for. * @param {number} [fromIndex=0] The index to search from. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`. * @returns {boolean} Returns `true` if `value` is found, else `false`. * @example * * _.includes([1, 2, 3], 1); * // => true * * _.includes([1, 2, 3], 1, 2); * // => false * * _.includes({ 'a': 1, 'b': 2 }, 1); * // => true * * _.includes('abcd', 'bc'); * // => true */function includes(collection,value,fromIndex,guard){collection=isArrayLike(collection)?collection:values(collection);fromIndex=fromIndex&&!guard?toInteger(fromIndex):0;var length=collection.length;if(fromIndex<0){fromIndex=nativeMax(length+fromIndex,0);}return isString(collection)?fromIndex<=length&&collection.indexOf(value,fromIndex)>-1:!!length&&baseIndexOf(collection,value,fromIndex)>-1;}/** * Invokes the method at `path` of each element in `collection`, returning * an array of the results of each invoked method. Any additional arguments * are provided to each invoked method. If `path` is a function, it's invoked * for, and `this` bound to, each element in `collection`. * * @static * @memberOf _ * @since 4.0.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Array|Function|string} path The path of the method to invoke or * the function invoked per iteration. * @param {...*} [args] The arguments to invoke each method with. * @returns {Array} Returns the array of results. * @example * * _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort'); * // => [[1, 5, 7], [1, 2, 3]] * * _.invokeMap([123, 456], String.prototype.split, ''); * // => [['1', '2', '3'], ['4', '5', '6']] */var invokeMap=baseRest(function(collection,path,args){var index=-1,isFunc=typeof path=='function',result=isArrayLike(collection)?Array(collection.length):[];baseEach(collection,function(value){result[++index]=isFunc?apply(path,value,args):baseInvoke(value,path,args);});return result;});/** * Creates an object composed of keys generated from the results of running * each element of `collection` thru `iteratee`. The corresponding value of * each key is the last element responsible for generating the key. The * iteratee is invoked with one argument: (value). * * @static * @memberOf _ * @since 4.0.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Function} [iteratee=_.identity] The iteratee to transform keys. * @returns {Object} Returns the composed aggregate object. * @example * * var array = [ * { 'dir': 'left', 'code': 97 }, * { 'dir': 'right', 'code': 100 } * ]; * * _.keyBy(array, function(o) { * return String.fromCharCode(o.code); * }); * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } } * * _.keyBy(array, 'dir'); * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } } */var keyBy=createAggregator(function(result,value,key){baseAssignValue(result,key,value);});/** * Creates an array of values by running each element in `collection` thru * `iteratee`. The iteratee is invoked with three arguments: * (value, index|key, collection). * * Many lodash methods are guarded to work as iteratees for methods like * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`. * * The guarded methods are: * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`, * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`, * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`, * `template`, `trim`, `trimEnd`, `trimStart`, and `words` * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @returns {Array} Returns the new mapped array. * @example * * function square(n) { * return n * n; * } * * _.map([4, 8], square); * // => [16, 64] * * _.map({ 'a': 4, 'b': 8 }, square); * // => [16, 64] (iteration order is not guaranteed) * * var users = [ * { 'user': 'barney' }, * { 'user': 'fred' } * ]; * * // The `_.property` iteratee shorthand. * _.map(users, 'user'); * // => ['barney', 'fred'] */function map(collection,iteratee){var func=isArray(collection)?arrayMap:baseMap;return func(collection,getIteratee(iteratee,3));}/** * This method is like `_.sortBy` except that it allows specifying the sort * orders of the iteratees to sort by. If `orders` is unspecified, all values * are sorted in ascending order. Otherwise, specify an order of "desc" for * descending or "asc" for ascending sort order of corresponding values. * * @static * @memberOf _ * @since 4.0.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]] * The iteratees to sort by. * @param {string[]} [orders] The sort orders of `iteratees`. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`. * @returns {Array} Returns the new sorted array. * @example * * var users = [ * { 'user': 'fred', 'age': 48 }, * { 'user': 'barney', 'age': 34 }, * { 'user': 'fred', 'age': 40 }, * { 'user': 'barney', 'age': 36 } * ]; * * // Sort by `user` in ascending order and by `age` in descending order. * _.orderBy(users, ['user', 'age'], ['asc', 'desc']); * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]] */function orderBy(collection,iteratees,orders,guard){if(collection==null){return[];}if(!isArray(iteratees)){iteratees=iteratees==null?[]:[iteratees];}orders=guard?undefined:orders;if(!isArray(orders)){orders=orders==null?[]:[orders];}return baseOrderBy(collection,iteratees,orders);}/** * Creates an array of elements split into two groups, the first of which * contains elements `predicate` returns truthy for, the second of which * contains elements `predicate` returns falsey for. The predicate is * invoked with one argument: (value). * * @static * @memberOf _ * @since 3.0.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Function} [predicate=_.identity] The function invoked per iteration. * @returns {Array} Returns the array of grouped elements. * @example * * var users = [ * { 'user': 'barney', 'age': 36, 'active': false }, * { 'user': 'fred', 'age': 40, 'active': true }, * { 'user': 'pebbles', 'age': 1, 'active': false } * ]; * * _.partition(users, function(o) { return o.active; }); * // => objects for [['fred'], ['barney', 'pebbles']] * * // The `_.matches` iteratee shorthand. * _.partition(users, { 'age': 1, 'active': false }); * // => objects for [['pebbles'], ['barney', 'fred']] * * // The `_.matchesProperty` iteratee shorthand. * _.partition(users, ['active', false]); * // => objects for [['barney', 'pebbles'], ['fred']] * * // The `_.property` iteratee shorthand. * _.partition(users, 'active'); * // => objects for [['fred'], ['barney', 'pebbles']] */var partition=createAggregator(function(result,value,key){result[key?0:1].push(value);},function(){return[[],[]];});/** * Reduces `collection` to a value which is the accumulated result of running * each element in `collection` thru `iteratee`, where each successive * invocation is supplied the return value of the previous. If `accumulator` * is not given, the first element of `collection` is used as the initial * value. The iteratee is invoked with four arguments: * (accumulator, value, index|key, collection). * * Many lodash methods are guarded to work as iteratees for methods like * `_.reduce`, `_.reduceRight`, and `_.transform`. * * The guarded methods are: * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`, * and `sortBy` * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @param {*} [accumulator] The initial value. * @returns {*} Returns the accumulated value. * @see _.reduceRight * @example * * _.reduce([1, 2], function(sum, n) { * return sum + n; * }, 0); * // => 3 * * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) { * (result[value] || (result[value] = [])).push(key); * return result; * }, {}); * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed) */function reduce(collection,iteratee,accumulator){var func=isArray(collection)?arrayReduce:baseReduce,initAccum=arguments.length<3;return func(collection,getIteratee(iteratee,4),accumulator,initAccum,baseEach);}/** * This method is like `_.reduce` except that it iterates over elements of * `collection` from right to left. * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @param {*} [accumulator] The initial value. * @returns {*} Returns the accumulated value. * @see _.reduce * @example * * var array = [[0, 1], [2, 3], [4, 5]]; * * _.reduceRight(array, function(flattened, other) { * return flattened.concat(other); * }, []); * // => [4, 5, 2, 3, 0, 1] */function reduceRight(collection,iteratee,accumulator){var func=isArray(collection)?arrayReduceRight:baseReduce,initAccum=arguments.length<3;return func(collection,getIteratee(iteratee,4),accumulator,initAccum,baseEachRight);}/** * The opposite of `_.filter`; this method returns the elements of `collection` * that `predicate` does **not** return truthy for. * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Function} [predicate=_.identity] The function invoked per iteration. * @returns {Array} Returns the new filtered array. * @see _.filter * @example * * var users = [ * { 'user': 'barney', 'age': 36, 'active': false }, * { 'user': 'fred', 'age': 40, 'active': true } * ]; * * _.reject(users, function(o) { return !o.active; }); * // => objects for ['fred'] * * // The `_.matches` iteratee shorthand. * _.reject(users, { 'age': 40, 'active': true }); * // => objects for ['barney'] * * // The `_.matchesProperty` iteratee shorthand. * _.reject(users, ['active', false]); * // => objects for ['fred'] * * // The `_.property` iteratee shorthand. * _.reject(users, 'active'); * // => objects for ['barney'] */function reject(collection,predicate){var func=isArray(collection)?arrayFilter:baseFilter;return func(collection,negate(getIteratee(predicate,3)));}/** * Gets a random element from `collection`. * * @static * @memberOf _ * @since 2.0.0 * @category Collection * @param {Array|Object} collection The collection to sample. * @returns {*} Returns the random element. * @example * * _.sample([1, 2, 3, 4]); * // => 2 */function sample(collection){var func=isArray(collection)?arraySample:baseSample;return func(collection);}/** * Gets `n` random elements at unique keys from `collection` up to the * size of `collection`. * * @static * @memberOf _ * @since 4.0.0 * @category Collection * @param {Array|Object} collection The collection to sample. * @param {number} [n=1] The number of elements to sample. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {Array} Returns the random elements. * @example * * _.sampleSize([1, 2, 3], 2); * // => [3, 1] * * _.sampleSize([1, 2, 3], 4); * // => [2, 3, 1] */function sampleSize(collection,n,guard){if(guard?isIterateeCall(collection,n,guard):n===undefined){n=1;}else{n=toInteger(n);}var func=isArray(collection)?arraySampleSize:baseSampleSize;return func(collection,n);}/** * Creates an array of shuffled values, using a version of the * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle). * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object} collection The collection to shuffle. * @returns {Array} Returns the new shuffled array. * @example * * _.shuffle([1, 2, 3, 4]); * // => [4, 1, 3, 2] */function shuffle(collection){var func=isArray(collection)?arrayShuffle:baseShuffle;return func(collection);}/** * Gets the size of `collection` by returning its length for array-like * values or the number of own enumerable string keyed properties for objects. * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object|string} collection The collection to inspect. * @returns {number} Returns the collection size. * @example * * _.size([1, 2, 3]); * // => 3 * * _.size({ 'a': 1, 'b': 2 }); * // => 2 * * _.size('pebbles'); * // => 7 */function size(collection){if(collection==null){return 0;}if(isArrayLike(collection)){return isString(collection)?stringSize(collection):collection.length;}var tag=getTag(collection);if(tag==mapTag||tag==setTag){return collection.size;}return baseKeys(collection).length;}/** * Checks if `predicate` returns truthy for **any** element of `collection`. * Iteration is stopped once `predicate` returns truthy. The predicate is * invoked with three arguments: (value, index|key, collection). * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {Function} [predicate=_.identity] The function invoked per iteration. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {boolean} Returns `true` if any element passes the predicate check, * else `false`. * @example * * _.some([null, 0, 'yes', false], Boolean); * // => true * * var users = [ * { 'user': 'barney', 'active': true }, * { 'user': 'fred', 'active': false } * ]; * * // The `_.matches` iteratee shorthand. * _.some(users, { 'user': 'barney', 'active': false }); * // => false * * // The `_.matchesProperty` iteratee shorthand. * _.some(users, ['active', false]); * // => true * * // The `_.property` iteratee shorthand. * _.some(users, 'active'); * // => true */function some(collection,predicate,guard){var func=isArray(collection)?arraySome:baseSome;if(guard&&isIterateeCall(collection,predicate,guard)){predicate=undefined;}return func(collection,getIteratee(predicate,3));}/** * Creates an array of elements, sorted in ascending order by the results of * running each element in a collection thru each iteratee. This method * performs a stable sort, that is, it preserves the original sort order of * equal elements. The iteratees are invoked with one argument: (value). * * @static * @memberOf _ * @since 0.1.0 * @category Collection * @param {Array|Object} collection The collection to iterate over. * @param {...(Function|Function[])} [iteratees=[_.identity]] * The iteratees to sort by. * @returns {Array} Returns the new sorted array. * @example * * var users = [ * { 'user': 'fred', 'age': 48 }, * { 'user': 'barney', 'age': 36 }, * { 'user': 'fred', 'age': 40 }, * { 'user': 'barney', 'age': 34 } * ]; * * _.sortBy(users, [function(o) { return o.user; }]); * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]] * * _.sortBy(users, ['user', 'age']); * // => objects for [['barney', 34], ['barney', 36], ['fred', 40], ['fred', 48]] */var sortBy=baseRest(function(collection,iteratees){if(collection==null){return[];}var length=iteratees.length;if(length>1&&isIterateeCall(collection,iteratees[0],iteratees[1])){iteratees=[];}else if(length>2&&isIterateeCall(iteratees[0],iteratees[1],iteratees[2])){iteratees=[iteratees[0]];}return baseOrderBy(collection,baseFlatten(iteratees,1),[]);});/*------------------------------------------------------------------------*//** * Gets the timestamp of the number of milliseconds that have elapsed since * the Unix epoch (1 January 1970 00:00:00 UTC). * * @static * @memberOf _ * @since 2.4.0 * @category Date * @returns {number} Returns the timestamp. * @example * * _.defer(function(stamp) { * console.log(_.now() - stamp); * }, _.now()); * // => Logs the number of milliseconds it took for the deferred invocation. */var now=ctxNow||function(){return root.Date.now();};/*------------------------------------------------------------------------*//** * The opposite of `_.before`; this method creates a function that invokes * `func` once it's called `n` or more times. * * @static * @memberOf _ * @since 0.1.0 * @category Function * @param {number} n The number of calls before `func` is invoked. * @param {Function} func The function to restrict. * @returns {Function} Returns the new restricted function. * @example * * var saves = ['profile', 'settings']; * * var done = _.after(saves.length, function() { * console.log('done saving!'); * }); * * _.forEach(saves, function(type) { * asyncSave({ 'type': type, 'complete': done }); * }); * // => Logs 'done saving!' after the two async saves have completed. */function after(n,func){if(typeof func!='function'){throw new TypeError(FUNC_ERROR_TEXT);}n=toInteger(n);return function(){if(--n<1){return func.apply(this,arguments);}};}/** * Creates a function that invokes `func`, with up to `n` arguments, * ignoring any additional arguments. * * @static * @memberOf _ * @since 3.0.0 * @category Function * @param {Function} func The function to cap arguments for. * @param {number} [n=func.length] The arity cap. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {Function} Returns the new capped function. * @example * * _.map(['6', '8', '10'], _.ary(parseInt, 1)); * // => [6, 8, 10] */function ary(func,n,guard){n=guard?undefined:n;n=func&&n==null?func.length:n;return createWrap(func,WRAP_ARY_FLAG,undefined,undefined,undefined,undefined,n);}/** * Creates a function that invokes `func`, with the `this` binding and arguments * of the created function, while it's called less than `n` times. Subsequent * calls to the created function return the result of the last `func` invocation. * * @static * @memberOf _ * @since 3.0.0 * @category Function * @param {number} n The number of calls at which `func` is no longer invoked. * @param {Function} func The function to restrict. * @returns {Function} Returns the new restricted function. * @example * * jQuery(element).on('click', _.before(5, addContactToList)); * // => Allows adding up to 4 contacts to the list. */function before(n,func){var result;if(typeof func!='function'){throw new TypeError(FUNC_ERROR_TEXT);}n=toInteger(n);return function(){if(--n>0){result=func.apply(this,arguments);}if(n<=1){func=undefined;}return result;};}/** * Creates a function that invokes `func` with the `this` binding of `thisArg` * and `partials` prepended to the arguments it receives. * * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds, * may be used as a placeholder for partially applied arguments. * * **Note:** Unlike native `Function#bind`, this method doesn't set the "length" * property of bound functions. * * @static * @memberOf _ * @since 0.1.0 * @category Function * @param {Function} func The function to bind. * @param {*} thisArg The `this` binding of `func`. * @param {...*} [partials] The arguments to be partially applied. * @returns {Function} Returns the new bound function. * @example * * function greet(greeting, punctuation) { * return greeting + ' ' + this.user + punctuation; * } * * var object = { 'user': 'fred' }; * * var bound = _.bind(greet, object, 'hi'); * bound('!'); * // => 'hi fred!' * * // Bound with placeholders. * var bound = _.bind(greet, object, _, '!'); * bound('hi'); * // => 'hi fred!' */var bind=baseRest(function(func,thisArg,partials){var bitmask=WRAP_BIND_FLAG;if(partials.length){var holders=replaceHolders(partials,getHolder(bind));bitmask|=WRAP_PARTIAL_FLAG;}return createWrap(func,bitmask,thisArg,partials,holders);});/** * Creates a function that invokes the method at `object[key]` with `partials` * prepended to the arguments it receives. * * This method differs from `_.bind` by allowing bound functions to reference * methods that may be redefined or don't yet exist. See * [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern) * for more details. * * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic * builds, may be used as a placeholder for partially applied arguments. * * @static * @memberOf _ * @since 0.10.0 * @category Function * @param {Object} object The object to invoke the method on. * @param {string} key The key of the method. * @param {...*} [partials] The arguments to be partially applied. * @returns {Function} Returns the new bound function. * @example * * var object = { * 'user': 'fred', * 'greet': function(greeting, punctuation) { * return greeting + ' ' + this.user + punctuation; * } * }; * * var bound = _.bindKey(object, 'greet', 'hi'); * bound('!'); * // => 'hi fred!' * * object.greet = function(greeting, punctuation) { * return greeting + 'ya ' + this.user + punctuation; * }; * * bound('!'); * // => 'hiya fred!' * * // Bound with placeholders. * var bound = _.bindKey(object, 'greet', _, '!'); * bound('hi'); * // => 'hiya fred!' */var bindKey=baseRest(function(object,key,partials){var bitmask=WRAP_BIND_FLAG|WRAP_BIND_KEY_FLAG;if(partials.length){var holders=replaceHolders(partials,getHolder(bindKey));bitmask|=WRAP_PARTIAL_FLAG;}return createWrap(key,bitmask,object,partials,holders);});/** * Creates a function that accepts arguments of `func` and either invokes * `func` returning its result, if at least `arity` number of arguments have * been provided, or returns a function that accepts the remaining `func` * arguments, and so on. The arity of `func` may be specified if `func.length` * is not sufficient. * * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds, * may be used as a placeholder for provided arguments. * * **Note:** This method doesn't set the "length" property of curried functions. * * @static * @memberOf _ * @since 2.0.0 * @category Function * @param {Function} func The function to curry. * @param {number} [arity=func.length] The arity of `func`. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {Function} Returns the new curried function. * @example * * var abc = function(a, b, c) { * return [a, b, c]; * }; * * var curried = _.curry(abc); * * curried(1)(2)(3); * // => [1, 2, 3] * * curried(1, 2)(3); * // => [1, 2, 3] * * curried(1, 2, 3); * // => [1, 2, 3] * * // Curried with placeholders. * curried(1)(_, 3)(2); * // => [1, 2, 3] */function curry(func,arity,guard){arity=guard?undefined:arity;var result=createWrap(func,WRAP_CURRY_FLAG,undefined,undefined,undefined,undefined,undefined,arity);result.placeholder=curry.placeholder;return result;}/** * This method is like `_.curry` except that arguments are applied to `func` * in the manner of `_.partialRight` instead of `_.partial`. * * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic * builds, may be used as a placeholder for provided arguments. * * **Note:** This method doesn't set the "length" property of curried functions. * * @static * @memberOf _ * @since 3.0.0 * @category Function * @param {Function} func The function to curry. * @param {number} [arity=func.length] The arity of `func`. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {Function} Returns the new curried function. * @example * * var abc = function(a, b, c) { * return [a, b, c]; * }; * * var curried = _.curryRight(abc); * * curried(3)(2)(1); * // => [1, 2, 3] * * curried(2, 3)(1); * // => [1, 2, 3] * * curried(1, 2, 3); * // => [1, 2, 3] * * // Curried with placeholders. * curried(3)(1, _)(2); * // => [1, 2, 3] */function curryRight(func,arity,guard){arity=guard?undefined:arity;var result=createWrap(func,WRAP_CURRY_RIGHT_FLAG,undefined,undefined,undefined,undefined,undefined,arity);result.placeholder=curryRight.placeholder;return result;}/** * Creates a debounced function that delays invoking `func` until after `wait` * milliseconds have elapsed since the last time the debounced function was * invoked. The debounced function comes with a `cancel` method to cancel * delayed `func` invocations and a `flush` method to immediately invoke them. * Provide `options` to indicate whether `func` should be invoked on the * leading and/or trailing edge of the `wait` timeout. The `func` is invoked * with the last arguments provided to the debounced function. Subsequent * calls to the debounced function return the result of the last `func` * invocation. * * **Note:** If `leading` and `trailing` options are `true`, `func` is * invoked on the trailing edge of the timeout only if the debounced function * is invoked more than once during the `wait` timeout. * * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred * until to the next tick, similar to `setTimeout` with a timeout of `0`. * * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/) * for details over the differences between `_.debounce` and `_.throttle`. * * @static * @memberOf _ * @since 0.1.0 * @category Function * @param {Function} func The function to debounce. * @param {number} [wait=0] The number of milliseconds to delay. * @param {Object} [options={}] The options object. * @param {boolean} [options.leading=false] * Specify invoking on the leading edge of the timeout. * @param {number} [options.maxWait] * The maximum time `func` is allowed to be delayed before it's invoked. * @param {boolean} [options.trailing=true] * Specify invoking on the trailing edge of the timeout. * @returns {Function} Returns the new debounced function. * @example * * // Avoid costly calculations while the window size is in flux. * jQuery(window).on('resize', _.debounce(calculateLayout, 150)); * * // Invoke `sendMail` when clicked, debouncing subsequent calls. * jQuery(element).on('click', _.debounce(sendMail, 300, { * 'leading': true, * 'trailing': false * })); * * // Ensure `batchLog` is invoked once after 1 second of debounced calls. * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 }); * var source = new EventSource('/stream'); * jQuery(source).on('message', debounced); * * // Cancel the trailing debounced invocation. * jQuery(window).on('popstate', debounced.cancel); */function debounce(func,wait,options){var lastArgs,lastThis,maxWait,result,timerId,lastCallTime,lastInvokeTime=0,leading=false,maxing=false,trailing=true;if(typeof func!='function'){throw new TypeError(FUNC_ERROR_TEXT);}wait=toNumber(wait)||0;if(isObject(options)){leading=!!options.leading;maxing='maxWait'in options;maxWait=maxing?nativeMax(toNumber(options.maxWait)||0,wait):maxWait;trailing='trailing'in options?!!options.trailing:trailing;}function invokeFunc(time){var args=lastArgs,thisArg=lastThis;lastArgs=lastThis=undefined;lastInvokeTime=time;result=func.apply(thisArg,args);return result;}function leadingEdge(time){// Reset any `maxWait` timer. lastInvokeTime=time;// Start the timer for the trailing edge. timerId=setTimeout(timerExpired,wait);// Invoke the leading edge. return leading?invokeFunc(time):result;}function remainingWait(time){var timeSinceLastCall=time-lastCallTime,timeSinceLastInvoke=time-lastInvokeTime,result=wait-timeSinceLastCall;return maxing?nativeMin(result,maxWait-timeSinceLastInvoke):result;}function shouldInvoke(time){var timeSinceLastCall=time-lastCallTime,timeSinceLastInvoke=time-lastInvokeTime;// Either this is the first call, activity has stopped and we're at the // trailing edge, the system time has gone backwards and we're treating // it as the trailing edge, or we've hit the `maxWait` limit. return lastCallTime===undefined||timeSinceLastCall>=wait||timeSinceLastCall<0||maxing&&timeSinceLastInvoke>=maxWait;}function timerExpired(){var time=now();if(shouldInvoke(time)){return trailingEdge(time);}// Restart the timer. timerId=setTimeout(timerExpired,remainingWait(time));}function trailingEdge(time){timerId=undefined;// Only invoke if we have `lastArgs` which means `func` has been // debounced at least once. if(trailing&&lastArgs){return invokeFunc(time);}lastArgs=lastThis=undefined;return result;}function cancel(){if(timerId!==undefined){clearTimeout(timerId);}lastInvokeTime=0;lastArgs=lastCallTime=lastThis=timerId=undefined;}function flush(){return timerId===undefined?result:trailingEdge(now());}function debounced(){var time=now(),isInvoking=shouldInvoke(time);lastArgs=arguments;lastThis=this;lastCallTime=time;if(isInvoking){if(timerId===undefined){return leadingEdge(lastCallTime);}if(maxing){// Handle invocations in a tight loop. timerId=setTimeout(timerExpired,wait);return invokeFunc(lastCallTime);}}if(timerId===undefined){timerId=setTimeout(timerExpired,wait);}return result;}debounced.cancel=cancel;debounced.flush=flush;return debounced;}/** * Defers invoking the `func` until the current call stack has cleared. Any * additional arguments are provided to `func` when it's invoked. * * @static * @memberOf _ * @since 0.1.0 * @category Function * @param {Function} func The function to defer. * @param {...*} [args] The arguments to invoke `func` with. * @returns {number} Returns the timer id. * @example * * _.defer(function(text) { * console.log(text); * }, 'deferred'); * // => Logs 'deferred' after one millisecond. */var defer=baseRest(function(func,args){return baseDelay(func,1,args);});/** * Invokes `func` after `wait` milliseconds. Any additional arguments are * provided to `func` when it's invoked. * * @static * @memberOf _ * @since 0.1.0 * @category Function * @param {Function} func The function to delay. * @param {number} wait The number of milliseconds to delay invocation. * @param {...*} [args] The arguments to invoke `func` with. * @returns {number} Returns the timer id. * @example * * _.delay(function(text) { * console.log(text); * }, 1000, 'later'); * // => Logs 'later' after one second. */var delay=baseRest(function(func,wait,args){return baseDelay(func,toNumber(wait)||0,args);});/** * Creates a function that invokes `func` with arguments reversed. * * @static * @memberOf _ * @since 4.0.0 * @category Function * @param {Function} func The function to flip arguments for. * @returns {Function} Returns the new flipped function. * @example * * var flipped = _.flip(function() { * return _.toArray(arguments); * }); * * flipped('a', 'b', 'c', 'd'); * // => ['d', 'c', 'b', 'a'] */function flip(func){return createWrap(func,WRAP_FLIP_FLAG);}/** * Creates a function that memoizes the result of `func`. If `resolver` is * provided, it determines the cache key for storing the result based on the * arguments provided to the memoized function. By default, the first argument * provided to the memoized function is used as the map cache key. The `func` * is invoked with the `this` binding of the memoized function. * * **Note:** The cache is exposed as the `cache` property on the memoized * function. Its creation may be customized by replacing the `_.memoize.Cache` * constructor with one whose instances implement the * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object) * method interface of `clear`, `delete`, `get`, `has`, and `set`. * * @static * @memberOf _ * @since 0.1.0 * @category Function * @param {Function} func The function to have its output memoized. * @param {Function} [resolver] The function to resolve the cache key. * @returns {Function} Returns the new memoized function. * @example * * var object = { 'a': 1, 'b': 2 }; * var other = { 'c': 3, 'd': 4 }; * * var values = _.memoize(_.values); * values(object); * // => [1, 2] * * values(other); * // => [3, 4] * * object.a = 2; * values(object); * // => [1, 2] * * // Modify the result cache. * values.cache.set(object, ['a', 'b']); * values(object); * // => ['a', 'b'] * * // Replace `_.memoize.Cache`. * _.memoize.Cache = WeakMap; */function memoize(func,resolver){if(typeof func!='function'||resolver!=null&&typeof resolver!='function'){throw new TypeError(FUNC_ERROR_TEXT);}var memoized=function memoized(){var args=arguments,key=resolver?resolver.apply(this,args):args[0],cache=memoized.cache;if(cache.has(key)){return cache.get(key);}var result=func.apply(this,args);memoized.cache=cache.set(key,result)||cache;return result;};memoized.cache=new(memoize.Cache||MapCache)();return memoized;}// Expose `MapCache`. memoize.Cache=MapCache;/** * Creates a function that negates the result of the predicate `func`. The * `func` predicate is invoked with the `this` binding and arguments of the * created function. * * @static * @memberOf _ * @since 3.0.0 * @category Function * @param {Function} predicate The predicate to negate. * @returns {Function} Returns the new negated function. * @example * * function isEven(n) { * return n % 2 == 0; * } * * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven)); * // => [1, 3, 5] */function negate(predicate){if(typeof predicate!='function'){throw new TypeError(FUNC_ERROR_TEXT);}return function(){var args=arguments;switch(args.length){case 0:return!predicate.call(this);case 1:return!predicate.call(this,args[0]);case 2:return!predicate.call(this,args[0],args[1]);case 3:return!predicate.call(this,args[0],args[1],args[2]);}return!predicate.apply(this,args);};}/** * Creates a function that is restricted to invoking `func` once. Repeat calls * to the function return the value of the first invocation. The `func` is * invoked with the `this` binding and arguments of the created function. * * @static * @memberOf _ * @since 0.1.0 * @category Function * @param {Function} func The function to restrict. * @returns {Function} Returns the new restricted function. * @example * * var initialize = _.once(createApplication); * initialize(); * initialize(); * // => `createApplication` is invoked once */function once(func){return before(2,func);}/** * Creates a function that invokes `func` with its arguments transformed. * * @static * @since 4.0.0 * @memberOf _ * @category Function * @param {Function} func The function to wrap. * @param {...(Function|Function[])} [transforms=[_.identity]] * The argument transforms. * @returns {Function} Returns the new function. * @example * * function doubled(n) { * return n * 2; * } * * function square(n) { * return n * n; * } * * var func = _.overArgs(function(x, y) { * return [x, y]; * }, [square, doubled]); * * func(9, 3); * // => [81, 6] * * func(10, 5); * // => [100, 10] */var overArgs=castRest(function(func,transforms){transforms=transforms.length==1&&isArray(transforms[0])?arrayMap(transforms[0],baseUnary(getIteratee())):arrayMap(baseFlatten(transforms,1),baseUnary(getIteratee()));var funcsLength=transforms.length;return baseRest(function(args){var index=-1,length=nativeMin(args.length,funcsLength);while(++index 'hello fred' * * // Partially applied with placeholders. * var greetFred = _.partial(greet, _, 'fred'); * greetFred('hi'); * // => 'hi fred' */var partial=baseRest(function(func,partials){var holders=replaceHolders(partials,getHolder(partial));return createWrap(func,WRAP_PARTIAL_FLAG,undefined,partials,holders);});/** * This method is like `_.partial` except that partially applied arguments * are appended to the arguments it receives. * * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic * builds, may be used as a placeholder for partially applied arguments. * * **Note:** This method doesn't set the "length" property of partially * applied functions. * * @static * @memberOf _ * @since 1.0.0 * @category Function * @param {Function} func The function to partially apply arguments to. * @param {...*} [partials] The arguments to be partially applied. * @returns {Function} Returns the new partially applied function. * @example * * function greet(greeting, name) { * return greeting + ' ' + name; * } * * var greetFred = _.partialRight(greet, 'fred'); * greetFred('hi'); * // => 'hi fred' * * // Partially applied with placeholders. * var sayHelloTo = _.partialRight(greet, 'hello', _); * sayHelloTo('fred'); * // => 'hello fred' */var partialRight=baseRest(function(func,partials){var holders=replaceHolders(partials,getHolder(partialRight));return createWrap(func,WRAP_PARTIAL_RIGHT_FLAG,undefined,partials,holders);});/** * Creates a function that invokes `func` with arguments arranged according * to the specified `indexes` where the argument value at the first index is * provided as the first argument, the argument value at the second index is * provided as the second argument, and so on. * * @static * @memberOf _ * @since 3.0.0 * @category Function * @param {Function} func The function to rearrange arguments for. * @param {...(number|number[])} indexes The arranged argument indexes. * @returns {Function} Returns the new function. * @example * * var rearged = _.rearg(function(a, b, c) { * return [a, b, c]; * }, [2, 0, 1]); * * rearged('b', 'c', 'a') * // => ['a', 'b', 'c'] */var rearg=flatRest(function(func,indexes){return createWrap(func,WRAP_REARG_FLAG,undefined,undefined,undefined,indexes);});/** * Creates a function that invokes `func` with the `this` binding of the * created function and arguments from `start` and beyond provided as * an array. * * **Note:** This method is based on the * [rest parameter](https://mdn.io/rest_parameters). * * @static * @memberOf _ * @since 4.0.0 * @category Function * @param {Function} func The function to apply a rest parameter to. * @param {number} [start=func.length-1] The start position of the rest parameter. * @returns {Function} Returns the new function. * @example * * var say = _.rest(function(what, names) { * return what + ' ' + _.initial(names).join(', ') + * (_.size(names) > 1 ? ', & ' : '') + _.last(names); * }); * * say('hello', 'fred', 'barney', 'pebbles'); * // => 'hello fred, barney, & pebbles' */function rest(func,start){if(typeof func!='function'){throw new TypeError(FUNC_ERROR_TEXT);}start=start===undefined?start:toInteger(start);return baseRest(func,start);}/** * Creates a function that invokes `func` with the `this` binding of the * create function and an array of arguments much like * [`Function#apply`](http://www.ecma-international.org/ecma-262/7.0/#sec-function.prototype.apply). * * **Note:** This method is based on the * [spread operator](https://mdn.io/spread_operator). * * @static * @memberOf _ * @since 3.2.0 * @category Function * @param {Function} func The function to spread arguments over. * @param {number} [start=0] The start position of the spread. * @returns {Function} Returns the new function. * @example * * var say = _.spread(function(who, what) { * return who + ' says ' + what; * }); * * say(['fred', 'hello']); * // => 'fred says hello' * * var numbers = Promise.all([ * Promise.resolve(40), * Promise.resolve(36) * ]); * * numbers.then(_.spread(function(x, y) { * return x + y; * })); * // => a Promise of 76 */function spread(func,start){if(typeof func!='function'){throw new TypeError(FUNC_ERROR_TEXT);}start=start==null?0:nativeMax(toInteger(start),0);return baseRest(function(args){var array=args[start],otherArgs=castSlice(args,0,start);if(array){arrayPush(otherArgs,array);}return apply(func,this,otherArgs);});}/** * Creates a throttled function that only invokes `func` at most once per * every `wait` milliseconds. The throttled function comes with a `cancel` * method to cancel delayed `func` invocations and a `flush` method to * immediately invoke them. Provide `options` to indicate whether `func` * should be invoked on the leading and/or trailing edge of the `wait` * timeout. The `func` is invoked with the last arguments provided to the * throttled function. Subsequent calls to the throttled function return the * result of the last `func` invocation. * * **Note:** If `leading` and `trailing` options are `true`, `func` is * invoked on the trailing edge of the timeout only if the throttled function * is invoked more than once during the `wait` timeout. * * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred * until to the next tick, similar to `setTimeout` with a timeout of `0`. * * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/) * for details over the differences between `_.throttle` and `_.debounce`. * * @static * @memberOf _ * @since 0.1.0 * @category Function * @param {Function} func The function to throttle. * @param {number} [wait=0] The number of milliseconds to throttle invocations to. * @param {Object} [options={}] The options object. * @param {boolean} [options.leading=true] * Specify invoking on the leading edge of the timeout. * @param {boolean} [options.trailing=true] * Specify invoking on the trailing edge of the timeout. * @returns {Function} Returns the new throttled function. * @example * * // Avoid excessively updating the position while scrolling. * jQuery(window).on('scroll', _.throttle(updatePosition, 100)); * * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes. * var throttled = _.throttle(renewToken, 300000, { 'trailing': false }); * jQuery(element).on('click', throttled); * * // Cancel the trailing throttled invocation. * jQuery(window).on('popstate', throttled.cancel); */function throttle(func,wait,options){var leading=true,trailing=true;if(typeof func!='function'){throw new TypeError(FUNC_ERROR_TEXT);}if(isObject(options)){leading='leading'in options?!!options.leading:leading;trailing='trailing'in options?!!options.trailing:trailing;}return debounce(func,wait,{'leading':leading,'maxWait':wait,'trailing':trailing});}/** * Creates a function that accepts up to one argument, ignoring any * additional arguments. * * @static * @memberOf _ * @since 4.0.0 * @category Function * @param {Function} func The function to cap arguments for. * @returns {Function} Returns the new capped function. * @example * * _.map(['6', '8', '10'], _.unary(parseInt)); * // => [6, 8, 10] */function unary(func){return ary(func,1);}/** * Creates a function that provides `value` to `wrapper` as its first * argument. Any additional arguments provided to the function are appended * to those provided to the `wrapper`. The wrapper is invoked with the `this` * binding of the created function. * * @static * @memberOf _ * @since 0.1.0 * @category Function * @param {*} value The value to wrap. * @param {Function} [wrapper=identity] The wrapper function. * @returns {Function} Returns the new function. * @example * * var p = _.wrap(_.escape, function(func, text) { * return '

' + func(text) + '

'; * }); * * p('fred, barney, & pebbles'); * // => '

fred, barney, & pebbles

' */function wrap(value,wrapper){return partial(castFunction(wrapper),value);}/*------------------------------------------------------------------------*//** * Casts `value` as an array if it's not one. * * @static * @memberOf _ * @since 4.4.0 * @category Lang * @param {*} value The value to inspect. * @returns {Array} Returns the cast array. * @example * * _.castArray(1); * // => [1] * * _.castArray({ 'a': 1 }); * // => [{ 'a': 1 }] * * _.castArray('abc'); * // => ['abc'] * * _.castArray(null); * // => [null] * * _.castArray(undefined); * // => [undefined] * * _.castArray(); * // => [] * * var array = [1, 2, 3]; * console.log(_.castArray(array) === array); * // => true */function castArray(){if(!arguments.length){return[];}var value=arguments[0];return isArray(value)?value:[value];}/** * Creates a shallow clone of `value`. * * **Note:** This method is loosely based on the * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm) * and supports cloning arrays, array buffers, booleans, date objects, maps, * numbers, `Object` objects, regexes, sets, strings, symbols, and typed * arrays. The own enumerable properties of `arguments` objects are cloned * as plain objects. An empty object is returned for uncloneable values such * as error objects, functions, DOM nodes, and WeakMaps. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to clone. * @returns {*} Returns the cloned value. * @see _.cloneDeep * @example * * var objects = [{ 'a': 1 }, { 'b': 2 }]; * * var shallow = _.clone(objects); * console.log(shallow[0] === objects[0]); * // => true */function clone(value){return baseClone(value,CLONE_SYMBOLS_FLAG);}/** * This method is like `_.clone` except that it accepts `customizer` which * is invoked to produce the cloned value. If `customizer` returns `undefined`, * cloning is handled by the method instead. The `customizer` is invoked with * up to four arguments; (value [, index|key, object, stack]). * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to clone. * @param {Function} [customizer] The function to customize cloning. * @returns {*} Returns the cloned value. * @see _.cloneDeepWith * @example * * function customizer(value) { * if (_.isElement(value)) { * return value.cloneNode(false); * } * } * * var el = _.cloneWith(document.body, customizer); * * console.log(el === document.body); * // => false * console.log(el.nodeName); * // => 'BODY' * console.log(el.childNodes.length); * // => 0 */function cloneWith(value,customizer){customizer=typeof customizer=='function'?customizer:undefined;return baseClone(value,CLONE_SYMBOLS_FLAG,customizer);}/** * This method is like `_.clone` except that it recursively clones `value`. * * @static * @memberOf _ * @since 1.0.0 * @category Lang * @param {*} value The value to recursively clone. * @returns {*} Returns the deep cloned value. * @see _.clone * @example * * var objects = [{ 'a': 1 }, { 'b': 2 }]; * * var deep = _.cloneDeep(objects); * console.log(deep[0] === objects[0]); * // => false */function cloneDeep(value){return baseClone(value,CLONE_DEEP_FLAG|CLONE_SYMBOLS_FLAG);}/** * This method is like `_.cloneWith` except that it recursively clones `value`. * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to recursively clone. * @param {Function} [customizer] The function to customize cloning. * @returns {*} Returns the deep cloned value. * @see _.cloneWith * @example * * function customizer(value) { * if (_.isElement(value)) { * return value.cloneNode(true); * } * } * * var el = _.cloneDeepWith(document.body, customizer); * * console.log(el === document.body); * // => false * console.log(el.nodeName); * // => 'BODY' * console.log(el.childNodes.length); * // => 20 */function cloneDeepWith(value,customizer){customizer=typeof customizer=='function'?customizer:undefined;return baseClone(value,CLONE_DEEP_FLAG|CLONE_SYMBOLS_FLAG,customizer);}/** * Checks if `object` conforms to `source` by invoking the predicate * properties of `source` with the corresponding property values of `object`. * * **Note:** This method is equivalent to `_.conforms` when `source` is * partially applied. * * @static * @memberOf _ * @since 4.14.0 * @category Lang * @param {Object} object The object to inspect. * @param {Object} source The object of property predicates to conform to. * @returns {boolean} Returns `true` if `object` conforms, else `false`. * @example * * var object = { 'a': 1, 'b': 2 }; * * _.conformsTo(object, { 'b': function(n) { return n > 1; } }); * // => true * * _.conformsTo(object, { 'b': function(n) { return n > 2; } }); * // => false */function conformsTo(object,source){return source==null||baseConformsTo(object,source,keys(source));}/** * Performs a * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero) * comparison between two values to determine if they are equivalent. * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to compare. * @param {*} other The other value to compare. * @returns {boolean} Returns `true` if the values are equivalent, else `false`. * @example * * var object = { 'a': 1 }; * var other = { 'a': 1 }; * * _.eq(object, object); * // => true * * _.eq(object, other); * // => false * * _.eq('a', 'a'); * // => true * * _.eq('a', Object('a')); * // => false * * _.eq(NaN, NaN); * // => true */function eq(value,other){return value===other||value!==value&&other!==other;}/** * Checks if `value` is greater than `other`. * * @static * @memberOf _ * @since 3.9.0 * @category Lang * @param {*} value The value to compare. * @param {*} other The other value to compare. * @returns {boolean} Returns `true` if `value` is greater than `other`, * else `false`. * @see _.lt * @example * * _.gt(3, 1); * // => true * * _.gt(3, 3); * // => false * * _.gt(1, 3); * // => false */var gt=createRelationalOperation(baseGt);/** * Checks if `value` is greater than or equal to `other`. * * @static * @memberOf _ * @since 3.9.0 * @category Lang * @param {*} value The value to compare. * @param {*} other The other value to compare. * @returns {boolean} Returns `true` if `value` is greater than or equal to * `other`, else `false`. * @see _.lte * @example * * _.gte(3, 1); * // => true * * _.gte(3, 3); * // => true * * _.gte(1, 3); * // => false */var gte=createRelationalOperation(function(value,other){return value>=other;});/** * Checks if `value` is likely an `arguments` object. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is an `arguments` object, * else `false`. * @example * * _.isArguments(function() { return arguments; }()); * // => true * * _.isArguments([1, 2, 3]); * // => false */var isArguments=baseIsArguments(function(){return arguments;}())?baseIsArguments:function(value){return isObjectLike(value)&&hasOwnProperty.call(value,'callee')&&!propertyIsEnumerable.call(value,'callee');};/** * Checks if `value` is classified as an `Array` object. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is an array, else `false`. * @example * * _.isArray([1, 2, 3]); * // => true * * _.isArray(document.body.children); * // => false * * _.isArray('abc'); * // => false * * _.isArray(_.noop); * // => false */var isArray=Array.isArray;/** * Checks if `value` is classified as an `ArrayBuffer` object. * * @static * @memberOf _ * @since 4.3.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`. * @example * * _.isArrayBuffer(new ArrayBuffer(2)); * // => true * * _.isArrayBuffer(new Array(2)); * // => false */var isArrayBuffer=nodeIsArrayBuffer?baseUnary(nodeIsArrayBuffer):baseIsArrayBuffer;/** * Checks if `value` is array-like. A value is considered array-like if it's * not a function and has a `value.length` that's an integer greater than or * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`. * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is array-like, else `false`. * @example * * _.isArrayLike([1, 2, 3]); * // => true * * _.isArrayLike(document.body.children); * // => true * * _.isArrayLike('abc'); * // => true * * _.isArrayLike(_.noop); * // => false */function isArrayLike(value){return value!=null&&isLength(value.length)&&!isFunction(value);}/** * This method is like `_.isArrayLike` except that it also checks if `value` * is an object. * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is an array-like object, * else `false`. * @example * * _.isArrayLikeObject([1, 2, 3]); * // => true * * _.isArrayLikeObject(document.body.children); * // => true * * _.isArrayLikeObject('abc'); * // => false * * _.isArrayLikeObject(_.noop); * // => false */function isArrayLikeObject(value){return isObjectLike(value)&&isArrayLike(value);}/** * Checks if `value` is classified as a boolean primitive or object. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a boolean, else `false`. * @example * * _.isBoolean(false); * // => true * * _.isBoolean(null); * // => false */function isBoolean(value){return value===true||value===false||isObjectLike(value)&&baseGetTag(value)==boolTag;}/** * Checks if `value` is a buffer. * * @static * @memberOf _ * @since 4.3.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a buffer, else `false`. * @example * * _.isBuffer(new Buffer(2)); * // => true * * _.isBuffer(new Uint8Array(2)); * // => false */var isBuffer=nativeIsBuffer||stubFalse;/** * Checks if `value` is classified as a `Date` object. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a date object, else `false`. * @example * * _.isDate(new Date); * // => true * * _.isDate('Mon April 23 2012'); * // => false */var isDate=nodeIsDate?baseUnary(nodeIsDate):baseIsDate;/** * Checks if `value` is likely a DOM element. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a DOM element, else `false`. * @example * * _.isElement(document.body); * // => true * * _.isElement(''); * // => false */function isElement(value){return isObjectLike(value)&&value.nodeType===1&&!isPlainObject(value);}/** * Checks if `value` is an empty object, collection, map, or set. * * Objects are considered empty if they have no own enumerable string keyed * properties. * * Array-like values such as `arguments` objects, arrays, buffers, strings, or * jQuery-like collections are considered empty if they have a `length` of `0`. * Similarly, maps and sets are considered empty if they have a `size` of `0`. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is empty, else `false`. * @example * * _.isEmpty(null); * // => true * * _.isEmpty(true); * // => true * * _.isEmpty(1); * // => true * * _.isEmpty([1, 2, 3]); * // => false * * _.isEmpty({ 'a': 1 }); * // => false */function isEmpty(value){if(value==null){return true;}if(isArrayLike(value)&&(isArray(value)||typeof value=='string'||typeof value.splice=='function'||isBuffer(value)||isTypedArray(value)||isArguments(value))){return!value.length;}var tag=getTag(value);if(tag==mapTag||tag==setTag){return!value.size;}if(isPrototype(value)){return!baseKeys(value).length;}for(var key in value){if(hasOwnProperty.call(value,key)){return false;}}return true;}/** * Performs a deep comparison between two values to determine if they are * equivalent. * * **Note:** This method supports comparing arrays, array buffers, booleans, * date objects, error objects, maps, numbers, `Object` objects, regexes, * sets, strings, symbols, and typed arrays. `Object` objects are compared * by their own, not inherited, enumerable properties. Functions and DOM * nodes are compared by strict equality, i.e. `===`. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to compare. * @param {*} other The other value to compare. * @returns {boolean} Returns `true` if the values are equivalent, else `false`. * @example * * var object = { 'a': 1 }; * var other = { 'a': 1 }; * * _.isEqual(object, other); * // => true * * object === other; * // => false */function isEqual(value,other){return baseIsEqual(value,other);}/** * This method is like `_.isEqual` except that it accepts `customizer` which * is invoked to compare values. If `customizer` returns `undefined`, comparisons * are handled by the method instead. The `customizer` is invoked with up to * six arguments: (objValue, othValue [, index|key, object, other, stack]). * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to compare. * @param {*} other The other value to compare. * @param {Function} [customizer] The function to customize comparisons. * @returns {boolean} Returns `true` if the values are equivalent, else `false`. * @example * * function isGreeting(value) { * return /^h(?:i|ello)$/.test(value); * } * * function customizer(objValue, othValue) { * if (isGreeting(objValue) && isGreeting(othValue)) { * return true; * } * } * * var array = ['hello', 'goodbye']; * var other = ['hi', 'goodbye']; * * _.isEqualWith(array, other, customizer); * // => true */function isEqualWith(value,other,customizer){customizer=typeof customizer=='function'?customizer:undefined;var result=customizer?customizer(value,other):undefined;return result===undefined?baseIsEqual(value,other,undefined,customizer):!!result;}/** * Checks if `value` is an `Error`, `EvalError`, `RangeError`, `ReferenceError`, * `SyntaxError`, `TypeError`, or `URIError` object. * * @static * @memberOf _ * @since 3.0.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is an error object, else `false`. * @example * * _.isError(new Error); * // => true * * _.isError(Error); * // => false */function isError(value){if(!isObjectLike(value)){return false;}var tag=baseGetTag(value);return tag==errorTag||tag==domExcTag||typeof value.message=='string'&&typeof value.name=='string'&&!isPlainObject(value);}/** * Checks if `value` is a finite primitive number. * * **Note:** This method is based on * [`Number.isFinite`](https://mdn.io/Number/isFinite). * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a finite number, else `false`. * @example * * _.isFinite(3); * // => true * * _.isFinite(Number.MIN_VALUE); * // => true * * _.isFinite(Infinity); * // => false * * _.isFinite('3'); * // => false */function isFinite(value){return typeof value=='number'&&nativeIsFinite(value);}/** * Checks if `value` is classified as a `Function` object. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a function, else `false`. * @example * * _.isFunction(_); * // => true * * _.isFunction(/abc/); * // => false */function isFunction(value){if(!isObject(value)){return false;}// The use of `Object#toString` avoids issues with the `typeof` operator // in Safari 9 which returns 'object' for typed arrays and other constructors. var tag=baseGetTag(value);return tag==funcTag||tag==genTag||tag==asyncTag||tag==proxyTag;}/** * Checks if `value` is an integer. * * **Note:** This method is based on * [`Number.isInteger`](https://mdn.io/Number/isInteger). * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is an integer, else `false`. * @example * * _.isInteger(3); * // => true * * _.isInteger(Number.MIN_VALUE); * // => false * * _.isInteger(Infinity); * // => false * * _.isInteger('3'); * // => false */function isInteger(value){return typeof value=='number'&&value==toInteger(value);}/** * Checks if `value` is a valid array-like length. * * **Note:** This method is loosely based on * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength). * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a valid length, else `false`. * @example * * _.isLength(3); * // => true * * _.isLength(Number.MIN_VALUE); * // => false * * _.isLength(Infinity); * // => false * * _.isLength('3'); * // => false */function isLength(value){return typeof value=='number'&&value>-1&&value%1==0&&value<=MAX_SAFE_INTEGER;}/** * Checks if `value` is the * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types) * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`) * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is an object, else `false`. * @example * * _.isObject({}); * // => true * * _.isObject([1, 2, 3]); * // => true * * _.isObject(_.noop); * // => true * * _.isObject(null); * // => false */function isObject(value){var type=typeof value==='undefined'?'undefined':_typeof(value);return value!=null&&(type=='object'||type=='function');}/** * Checks if `value` is object-like. A value is object-like if it's not `null` * and has a `typeof` result of "object". * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is object-like, else `false`. * @example * * _.isObjectLike({}); * // => true * * _.isObjectLike([1, 2, 3]); * // => true * * _.isObjectLike(_.noop); * // => false * * _.isObjectLike(null); * // => false */function isObjectLike(value){return value!=null&&(typeof value==='undefined'?'undefined':_typeof(value))=='object';}/** * Checks if `value` is classified as a `Map` object. * * @static * @memberOf _ * @since 4.3.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a map, else `false`. * @example * * _.isMap(new Map); * // => true * * _.isMap(new WeakMap); * // => false */var isMap=nodeIsMap?baseUnary(nodeIsMap):baseIsMap;/** * Performs a partial deep comparison between `object` and `source` to * determine if `object` contains equivalent property values. * * **Note:** This method is equivalent to `_.matches` when `source` is * partially applied. * * Partial comparisons will match empty array and empty object `source` * values against any array or object value, respectively. See `_.isEqual` * for a list of supported value comparisons. * * @static * @memberOf _ * @since 3.0.0 * @category Lang * @param {Object} object The object to inspect. * @param {Object} source The object of property values to match. * @returns {boolean} Returns `true` if `object` is a match, else `false`. * @example * * var object = { 'a': 1, 'b': 2 }; * * _.isMatch(object, { 'b': 2 }); * // => true * * _.isMatch(object, { 'b': 1 }); * // => false */function isMatch(object,source){return object===source||baseIsMatch(object,source,getMatchData(source));}/** * This method is like `_.isMatch` except that it accepts `customizer` which * is invoked to compare values. If `customizer` returns `undefined`, comparisons * are handled by the method instead. The `customizer` is invoked with five * arguments: (objValue, srcValue, index|key, object, source). * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {Object} object The object to inspect. * @param {Object} source The object of property values to match. * @param {Function} [customizer] The function to customize comparisons. * @returns {boolean} Returns `true` if `object` is a match, else `false`. * @example * * function isGreeting(value) { * return /^h(?:i|ello)$/.test(value); * } * * function customizer(objValue, srcValue) { * if (isGreeting(objValue) && isGreeting(srcValue)) { * return true; * } * } * * var object = { 'greeting': 'hello' }; * var source = { 'greeting': 'hi' }; * * _.isMatchWith(object, source, customizer); * // => true */function isMatchWith(object,source,customizer){customizer=typeof customizer=='function'?customizer:undefined;return baseIsMatch(object,source,getMatchData(source),customizer);}/** * Checks if `value` is `NaN`. * * **Note:** This method is based on * [`Number.isNaN`](https://mdn.io/Number/isNaN) and is not the same as * global [`isNaN`](https://mdn.io/isNaN) which returns `true` for * `undefined` and other non-number values. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`. * @example * * _.isNaN(NaN); * // => true * * _.isNaN(new Number(NaN)); * // => true * * isNaN(undefined); * // => true * * _.isNaN(undefined); * // => false */function isNaN(value){// An `NaN` primitive is the only value that is not equal to itself. // Perform the `toStringTag` check first to avoid errors with some // ActiveX objects in IE. return isNumber(value)&&value!=+value;}/** * Checks if `value` is a pristine native function. * * **Note:** This method can't reliably detect native functions in the presence * of the core-js package because core-js circumvents this kind of detection. * Despite multiple requests, the core-js maintainer has made it clear: any * attempt to fix the detection will be obstructed. As a result, we're left * with little choice but to throw an error. Unfortunately, this also affects * packages, like [babel-polyfill](https://www.npmjs.com/package/babel-polyfill), * which rely on core-js. * * @static * @memberOf _ * @since 3.0.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a native function, * else `false`. * @example * * _.isNative(Array.prototype.push); * // => true * * _.isNative(_); * // => false */function isNative(value){if(isMaskable(value)){throw new Error(CORE_ERROR_TEXT);}return baseIsNative(value);}/** * Checks if `value` is `null`. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is `null`, else `false`. * @example * * _.isNull(null); * // => true * * _.isNull(void 0); * // => false */function isNull(value){return value===null;}/** * Checks if `value` is `null` or `undefined`. * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is nullish, else `false`. * @example * * _.isNil(null); * // => true * * _.isNil(void 0); * // => true * * _.isNil(NaN); * // => false */function isNil(value){return value==null;}/** * Checks if `value` is classified as a `Number` primitive or object. * * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are * classified as numbers, use the `_.isFinite` method. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a number, else `false`. * @example * * _.isNumber(3); * // => true * * _.isNumber(Number.MIN_VALUE); * // => true * * _.isNumber(Infinity); * // => true * * _.isNumber('3'); * // => false */function isNumber(value){return typeof value=='number'||isObjectLike(value)&&baseGetTag(value)==numberTag;}/** * Checks if `value` is a plain object, that is, an object created by the * `Object` constructor or one with a `[[Prototype]]` of `null`. * * @static * @memberOf _ * @since 0.8.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a plain object, else `false`. * @example * * function Foo() { * this.a = 1; * } * * _.isPlainObject(new Foo); * // => false * * _.isPlainObject([1, 2, 3]); * // => false * * _.isPlainObject({ 'x': 0, 'y': 0 }); * // => true * * _.isPlainObject(Object.create(null)); * // => true */function isPlainObject(value){if(!isObjectLike(value)||baseGetTag(value)!=objectTag){return false;}var proto=getPrototype(value);if(proto===null){return true;}var Ctor=hasOwnProperty.call(proto,'constructor')&&proto.constructor;return typeof Ctor=='function'&&Ctor instanceof Ctor&&funcToString.call(Ctor)==objectCtorString;}/** * Checks if `value` is classified as a `RegExp` object. * * @static * @memberOf _ * @since 0.1.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a regexp, else `false`. * @example * * _.isRegExp(/abc/); * // => true * * _.isRegExp('/abc/'); * // => false */var isRegExp=nodeIsRegExp?baseUnary(nodeIsRegExp):baseIsRegExp;/** * Checks if `value` is a safe integer. An integer is safe if it's an IEEE-754 * double precision number which isn't the result of a rounded unsafe integer. * * **Note:** This method is based on * [`Number.isSafeInteger`](https://mdn.io/Number/isSafeInteger). * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a safe integer, else `false`. * @example * * _.isSafeInteger(3); * // => true * * _.isSafeInteger(Number.MIN_VALUE); * // => false * * _.isSafeInteger(Infinity); * // => false * * _.isSafeInteger('3'); * // => false */function isSafeInteger(value){return isInteger(value)&&value>=-MAX_SAFE_INTEGER&&value<=MAX_SAFE_INTEGER;}/** * Checks if `value` is classified as a `Set` object. * * @static * @memberOf _ * @since 4.3.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a set, else `false`. * @example * * _.isSet(new Set); * // => true * * _.isSet(new WeakSet); * // => false */var isSet=nodeIsSet?baseUnary(nodeIsSet):baseIsSet;/** * Checks if `value` is classified as a `String` primitive or object. * * @static * @since 0.1.0 * @memberOf _ * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a string, else `false`. * @example * * _.isString('abc'); * // => true * * _.isString(1); * // => false */function isString(value){return typeof value=='string'||!isArray(value)&&isObjectLike(value)&&baseGetTag(value)==stringTag;}/** * Checks if `value` is classified as a `Symbol` primitive or object. * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a symbol, else `false`. * @example * * _.isSymbol(Symbol.iterator); * // => true * * _.isSymbol('abc'); * // => false */function isSymbol(value){return(typeof value==='undefined'?'undefined':_typeof(value))=='symbol'||isObjectLike(value)&&baseGetTag(value)==symbolTag;}/** * Checks if `value` is classified as a typed array. * * @static * @memberOf _ * @since 3.0.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a typed array, else `false`. * @example * * _.isTypedArray(new Uint8Array); * // => true * * _.isTypedArray([]); * // => false */var isTypedArray=nodeIsTypedArray?baseUnary(nodeIsTypedArray):baseIsTypedArray;/** * Checks if `value` is `undefined`. * * @static * @since 0.1.0 * @memberOf _ * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`. * @example * * _.isUndefined(void 0); * // => true * * _.isUndefined(null); * // => false */function isUndefined(value){return value===undefined;}/** * Checks if `value` is classified as a `WeakMap` object. * * @static * @memberOf _ * @since 4.3.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a weak map, else `false`. * @example * * _.isWeakMap(new WeakMap); * // => true * * _.isWeakMap(new Map); * // => false */function isWeakMap(value){return isObjectLike(value)&&getTag(value)==weakMapTag;}/** * Checks if `value` is classified as a `WeakSet` object. * * @static * @memberOf _ * @since 4.3.0 * @category Lang * @param {*} value The value to check. * @returns {boolean} Returns `true` if `value` is a weak set, else `false`. * @example * * _.isWeakSet(new WeakSet); * // => true * * _.isWeakSet(new Set); * // => false */function isWeakSet(value){return isObjectLike(value)&&baseGetTag(value)==weakSetTag;}/** * Checks if `value` is less than `other`. * * @static * @memberOf _ * @since 3.9.0 * @category Lang * @param {*} value The value to compare. * @param {*} other The other value to compare. * @returns {boolean} Returns `true` if `value` is less than `other`, * else `false`. * @see _.gt * @example * * _.lt(1, 3); * // => true * * _.lt(3, 3); * // => false * * _.lt(3, 1); * // => false */var lt=createRelationalOperation(baseLt);/** * Checks if `value` is less than or equal to `other`. * * @static * @memberOf _ * @since 3.9.0 * @category Lang * @param {*} value The value to compare. * @param {*} other The other value to compare. * @returns {boolean} Returns `true` if `value` is less than or equal to * `other`, else `false`. * @see _.gte * @example * * _.lte(1, 3); * // => true * * _.lte(3, 3); * // => true * * _.lte(3, 1); * // => false */var lte=createRelationalOperation(function(value,other){return value<=other;});/** * Converts `value` to an array. * * @static * @since 0.1.0 * @memberOf _ * @category Lang * @param {*} value The value to convert. * @returns {Array} Returns the converted array. * @example * * _.toArray({ 'a': 1, 'b': 2 }); * // => [1, 2] * * _.toArray('abc'); * // => ['a', 'b', 'c'] * * _.toArray(1); * // => [] * * _.toArray(null); * // => [] */function toArray(value){if(!value){return[];}if(isArrayLike(value)){return isString(value)?stringToArray(value):copyArray(value);}if(symIterator&&value[symIterator]){return iteratorToArray(value[symIterator]());}var tag=getTag(value),func=tag==mapTag?mapToArray:tag==setTag?setToArray:values;return func(value);}/** * Converts `value` to a finite number. * * @static * @memberOf _ * @since 4.12.0 * @category Lang * @param {*} value The value to convert. * @returns {number} Returns the converted number. * @example * * _.toFinite(3.2); * // => 3.2 * * _.toFinite(Number.MIN_VALUE); * // => 5e-324 * * _.toFinite(Infinity); * // => 1.7976931348623157e+308 * * _.toFinite('3.2'); * // => 3.2 */function toFinite(value){if(!value){return value===0?value:0;}value=toNumber(value);if(value===INFINITY||value===-INFINITY){var sign=value<0?-1:1;return sign*MAX_INTEGER;}return value===value?value:0;}/** * Converts `value` to an integer. * * **Note:** This method is loosely based on * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger). * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to convert. * @returns {number} Returns the converted integer. * @example * * _.toInteger(3.2); * // => 3 * * _.toInteger(Number.MIN_VALUE); * // => 0 * * _.toInteger(Infinity); * // => 1.7976931348623157e+308 * * _.toInteger('3.2'); * // => 3 */function toInteger(value){var result=toFinite(value),remainder=result%1;return result===result?remainder?result-remainder:result:0;}/** * Converts `value` to an integer suitable for use as the length of an * array-like object. * * **Note:** This method is based on * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength). * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to convert. * @returns {number} Returns the converted integer. * @example * * _.toLength(3.2); * // => 3 * * _.toLength(Number.MIN_VALUE); * // => 0 * * _.toLength(Infinity); * // => 4294967295 * * _.toLength('3.2'); * // => 3 */function toLength(value){return value?baseClamp(toInteger(value),0,MAX_ARRAY_LENGTH):0;}/** * Converts `value` to a number. * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to process. * @returns {number} Returns the number. * @example * * _.toNumber(3.2); * // => 3.2 * * _.toNumber(Number.MIN_VALUE); * // => 5e-324 * * _.toNumber(Infinity); * // => Infinity * * _.toNumber('3.2'); * // => 3.2 */function toNumber(value){if(typeof value=='number'){return value;}if(isSymbol(value)){return NAN;}if(isObject(value)){var other=typeof value.valueOf=='function'?value.valueOf():value;value=isObject(other)?other+'':other;}if(typeof value!='string'){return value===0?value:+value;}value=value.replace(reTrim,'');var isBinary=reIsBinary.test(value);return isBinary||reIsOctal.test(value)?freeParseInt(value.slice(2),isBinary?2:8):reIsBadHex.test(value)?NAN:+value;}/** * Converts `value` to a plain object flattening inherited enumerable string * keyed properties of `value` to own properties of the plain object. * * @static * @memberOf _ * @since 3.0.0 * @category Lang * @param {*} value The value to convert. * @returns {Object} Returns the converted plain object. * @example * * function Foo() { * this.b = 2; * } * * Foo.prototype.c = 3; * * _.assign({ 'a': 1 }, new Foo); * // => { 'a': 1, 'b': 2 } * * _.assign({ 'a': 1 }, _.toPlainObject(new Foo)); * // => { 'a': 1, 'b': 2, 'c': 3 } */function toPlainObject(value){return copyObject(value,keysIn(value));}/** * Converts `value` to a safe integer. A safe integer can be compared and * represented correctly. * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to convert. * @returns {number} Returns the converted integer. * @example * * _.toSafeInteger(3.2); * // => 3 * * _.toSafeInteger(Number.MIN_VALUE); * // => 0 * * _.toSafeInteger(Infinity); * // => 9007199254740991 * * _.toSafeInteger('3.2'); * // => 3 */function toSafeInteger(value){return value?baseClamp(toInteger(value),-MAX_SAFE_INTEGER,MAX_SAFE_INTEGER):value===0?value:0;}/** * Converts `value` to a string. An empty string is returned for `null` * and `undefined` values. The sign of `-0` is preserved. * * @static * @memberOf _ * @since 4.0.0 * @category Lang * @param {*} value The value to convert. * @returns {string} Returns the converted string. * @example * * _.toString(null); * // => '' * * _.toString(-0); * // => '-0' * * _.toString([1, 2, 3]); * // => '1,2,3' */function toString(value){return value==null?'':baseToString(value);}/*------------------------------------------------------------------------*//** * Assigns own enumerable string keyed properties of source objects to the * destination object. Source objects are applied from left to right. * Subsequent sources overwrite property assignments of previous sources. * * **Note:** This method mutates `object` and is loosely based on * [`Object.assign`](https://mdn.io/Object/assign). * * @static * @memberOf _ * @since 0.10.0 * @category Object * @param {Object} object The destination object. * @param {...Object} [sources] The source objects. * @returns {Object} Returns `object`. * @see _.assignIn * @example * * function Foo() { * this.a = 1; * } * * function Bar() { * this.c = 3; * } * * Foo.prototype.b = 2; * Bar.prototype.d = 4; * * _.assign({ 'a': 0 }, new Foo, new Bar); * // => { 'a': 1, 'c': 3 } */var assign=createAssigner(function(object,source){if(isPrototype(source)||isArrayLike(source)){copyObject(source,keys(source),object);return;}for(var key in source){if(hasOwnProperty.call(source,key)){assignValue(object,key,source[key]);}}});/** * This method is like `_.assign` except that it iterates over own and * inherited source properties. * * **Note:** This method mutates `object`. * * @static * @memberOf _ * @since 4.0.0 * @alias extend * @category Object * @param {Object} object The destination object. * @param {...Object} [sources] The source objects. * @returns {Object} Returns `object`. * @see _.assign * @example * * function Foo() { * this.a = 1; * } * * function Bar() { * this.c = 3; * } * * Foo.prototype.b = 2; * Bar.prototype.d = 4; * * _.assignIn({ 'a': 0 }, new Foo, new Bar); * // => { 'a': 1, 'b': 2, 'c': 3, 'd': 4 } */var assignIn=createAssigner(function(object,source){copyObject(source,keysIn(source),object);});/** * This method is like `_.assignIn` except that it accepts `customizer` * which is invoked to produce the assigned values. If `customizer` returns * `undefined`, assignment is handled by the method instead. The `customizer` * is invoked with five arguments: (objValue, srcValue, key, object, source). * * **Note:** This method mutates `object`. * * @static * @memberOf _ * @since 4.0.0 * @alias extendWith * @category Object * @param {Object} object The destination object. * @param {...Object} sources The source objects. * @param {Function} [customizer] The function to customize assigned values. * @returns {Object} Returns `object`. * @see _.assignWith * @example * * function customizer(objValue, srcValue) { * return _.isUndefined(objValue) ? srcValue : objValue; * } * * var defaults = _.partialRight(_.assignInWith, customizer); * * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 }); * // => { 'a': 1, 'b': 2 } */var assignInWith=createAssigner(function(object,source,srcIndex,customizer){copyObject(source,keysIn(source),object,customizer);});/** * This method is like `_.assign` except that it accepts `customizer` * which is invoked to produce the assigned values. If `customizer` returns * `undefined`, assignment is handled by the method instead. The `customizer` * is invoked with five arguments: (objValue, srcValue, key, object, source). * * **Note:** This method mutates `object`. * * @static * @memberOf _ * @since 4.0.0 * @category Object * @param {Object} object The destination object. * @param {...Object} sources The source objects. * @param {Function} [customizer] The function to customize assigned values. * @returns {Object} Returns `object`. * @see _.assignInWith * @example * * function customizer(objValue, srcValue) { * return _.isUndefined(objValue) ? srcValue : objValue; * } * * var defaults = _.partialRight(_.assignWith, customizer); * * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 }); * // => { 'a': 1, 'b': 2 } */var assignWith=createAssigner(function(object,source,srcIndex,customizer){copyObject(source,keys(source),object,customizer);});/** * Creates an array of values corresponding to `paths` of `object`. * * @static * @memberOf _ * @since 1.0.0 * @category Object * @param {Object} object The object to iterate over. * @param {...(string|string[])} [paths] The property paths to pick. * @returns {Array} Returns the picked values. * @example * * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] }; * * _.at(object, ['a[0].b.c', 'a[1]']); * // => [3, 4] */var at=flatRest(baseAt);/** * Creates an object that inherits from the `prototype` object. If a * `properties` object is given, its own enumerable string keyed properties * are assigned to the created object. * * @static * @memberOf _ * @since 2.3.0 * @category Object * @param {Object} prototype The object to inherit from. * @param {Object} [properties] The properties to assign to the object. * @returns {Object} Returns the new object. * @example * * function Shape() { * this.x = 0; * this.y = 0; * } * * function Circle() { * Shape.call(this); * } * * Circle.prototype = _.create(Shape.prototype, { * 'constructor': Circle * }); * * var circle = new Circle; * circle instanceof Circle; * // => true * * circle instanceof Shape; * // => true */function create(prototype,properties){var result=baseCreate(prototype);return properties==null?result:baseAssign(result,properties);}/** * Assigns own and inherited enumerable string keyed properties of source * objects to the destination object for all destination properties that * resolve to `undefined`. Source objects are applied from left to right. * Once a property is set, additional values of the same property are ignored. * * **Note:** This method mutates `object`. * * @static * @since 0.1.0 * @memberOf _ * @category Object * @param {Object} object The destination object. * @param {...Object} [sources] The source objects. * @returns {Object} Returns `object`. * @see _.defaultsDeep * @example * * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 }); * // => { 'a': 1, 'b': 2 } */var defaults=baseRest(function(args){args.push(undefined,customDefaultsAssignIn);return apply(assignInWith,undefined,args);});/** * This method is like `_.defaults` except that it recursively assigns * default properties. * * **Note:** This method mutates `object`. * * @static * @memberOf _ * @since 3.10.0 * @category Object * @param {Object} object The destination object. * @param {...Object} [sources] The source objects. * @returns {Object} Returns `object`. * @see _.defaults * @example * * _.defaultsDeep({ 'a': { 'b': 2 } }, { 'a': { 'b': 1, 'c': 3 } }); * // => { 'a': { 'b': 2, 'c': 3 } } */var defaultsDeep=baseRest(function(args){args.push(undefined,customDefaultsMerge);return apply(mergeWith,undefined,args);});/** * This method is like `_.find` except that it returns the key of the first * element `predicate` returns truthy for instead of the element itself. * * @static * @memberOf _ * @since 1.1.0 * @category Object * @param {Object} object The object to inspect. * @param {Function} [predicate=_.identity] The function invoked per iteration. * @returns {string|undefined} Returns the key of the matched element, * else `undefined`. * @example * * var users = { * 'barney': { 'age': 36, 'active': true }, * 'fred': { 'age': 40, 'active': false }, * 'pebbles': { 'age': 1, 'active': true } * }; * * _.findKey(users, function(o) { return o.age < 40; }); * // => 'barney' (iteration order is not guaranteed) * * // The `_.matches` iteratee shorthand. * _.findKey(users, { 'age': 1, 'active': true }); * // => 'pebbles' * * // The `_.matchesProperty` iteratee shorthand. * _.findKey(users, ['active', false]); * // => 'fred' * * // The `_.property` iteratee shorthand. * _.findKey(users, 'active'); * // => 'barney' */function findKey(object,predicate){return baseFindKey(object,getIteratee(predicate,3),baseForOwn);}/** * This method is like `_.findKey` except that it iterates over elements of * a collection in the opposite order. * * @static * @memberOf _ * @since 2.0.0 * @category Object * @param {Object} object The object to inspect. * @param {Function} [predicate=_.identity] The function invoked per iteration. * @returns {string|undefined} Returns the key of the matched element, * else `undefined`. * @example * * var users = { * 'barney': { 'age': 36, 'active': true }, * 'fred': { 'age': 40, 'active': false }, * 'pebbles': { 'age': 1, 'active': true } * }; * * _.findLastKey(users, function(o) { return o.age < 40; }); * // => returns 'pebbles' assuming `_.findKey` returns 'barney' * * // The `_.matches` iteratee shorthand. * _.findLastKey(users, { 'age': 36, 'active': true }); * // => 'barney' * * // The `_.matchesProperty` iteratee shorthand. * _.findLastKey(users, ['active', false]); * // => 'fred' * * // The `_.property` iteratee shorthand. * _.findLastKey(users, 'active'); * // => 'pebbles' */function findLastKey(object,predicate){return baseFindKey(object,getIteratee(predicate,3),baseForOwnRight);}/** * Iterates over own and inherited enumerable string keyed properties of an * object and invokes `iteratee` for each property. The iteratee is invoked * with three arguments: (value, key, object). Iteratee functions may exit * iteration early by explicitly returning `false`. * * @static * @memberOf _ * @since 0.3.0 * @category Object * @param {Object} object The object to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @returns {Object} Returns `object`. * @see _.forInRight * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.forIn(new Foo, function(value, key) { * console.log(key); * }); * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed). */function forIn(object,iteratee){return object==null?object:baseFor(object,getIteratee(iteratee,3),keysIn);}/** * This method is like `_.forIn` except that it iterates over properties of * `object` in the opposite order. * * @static * @memberOf _ * @since 2.0.0 * @category Object * @param {Object} object The object to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @returns {Object} Returns `object`. * @see _.forIn * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.forInRight(new Foo, function(value, key) { * console.log(key); * }); * // => Logs 'c', 'b', then 'a' assuming `_.forIn` logs 'a', 'b', then 'c'. */function forInRight(object,iteratee){return object==null?object:baseForRight(object,getIteratee(iteratee,3),keysIn);}/** * Iterates over own enumerable string keyed properties of an object and * invokes `iteratee` for each property. The iteratee is invoked with three * arguments: (value, key, object). Iteratee functions may exit iteration * early by explicitly returning `false`. * * @static * @memberOf _ * @since 0.3.0 * @category Object * @param {Object} object The object to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @returns {Object} Returns `object`. * @see _.forOwnRight * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.forOwn(new Foo, function(value, key) { * console.log(key); * }); * // => Logs 'a' then 'b' (iteration order is not guaranteed). */function forOwn(object,iteratee){return object&&baseForOwn(object,getIteratee(iteratee,3));}/** * This method is like `_.forOwn` except that it iterates over properties of * `object` in the opposite order. * * @static * @memberOf _ * @since 2.0.0 * @category Object * @param {Object} object The object to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @returns {Object} Returns `object`. * @see _.forOwn * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.forOwnRight(new Foo, function(value, key) { * console.log(key); * }); * // => Logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'. */function forOwnRight(object,iteratee){return object&&baseForOwnRight(object,getIteratee(iteratee,3));}/** * Creates an array of function property names from own enumerable properties * of `object`. * * @static * @since 0.1.0 * @memberOf _ * @category Object * @param {Object} object The object to inspect. * @returns {Array} Returns the function names. * @see _.functionsIn * @example * * function Foo() { * this.a = _.constant('a'); * this.b = _.constant('b'); * } * * Foo.prototype.c = _.constant('c'); * * _.functions(new Foo); * // => ['a', 'b'] */function functions(object){return object==null?[]:baseFunctions(object,keys(object));}/** * Creates an array of function property names from own and inherited * enumerable properties of `object`. * * @static * @memberOf _ * @since 4.0.0 * @category Object * @param {Object} object The object to inspect. * @returns {Array} Returns the function names. * @see _.functions * @example * * function Foo() { * this.a = _.constant('a'); * this.b = _.constant('b'); * } * * Foo.prototype.c = _.constant('c'); * * _.functionsIn(new Foo); * // => ['a', 'b', 'c'] */function functionsIn(object){return object==null?[]:baseFunctions(object,keysIn(object));}/** * Gets the value at `path` of `object`. If the resolved value is * `undefined`, the `defaultValue` is returned in its place. * * @static * @memberOf _ * @since 3.7.0 * @category Object * @param {Object} object The object to query. * @param {Array|string} path The path of the property to get. * @param {*} [defaultValue] The value returned for `undefined` resolved values. * @returns {*} Returns the resolved value. * @example * * var object = { 'a': [{ 'b': { 'c': 3 } }] }; * * _.get(object, 'a[0].b.c'); * // => 3 * * _.get(object, ['a', '0', 'b', 'c']); * // => 3 * * _.get(object, 'a.b.c', 'default'); * // => 'default' */function get(object,path,defaultValue){var result=object==null?undefined:baseGet(object,path);return result===undefined?defaultValue:result;}/** * Checks if `path` is a direct property of `object`. * * @static * @since 0.1.0 * @memberOf _ * @category Object * @param {Object} object The object to query. * @param {Array|string} path The path to check. * @returns {boolean} Returns `true` if `path` exists, else `false`. * @example * * var object = { 'a': { 'b': 2 } }; * var other = _.create({ 'a': _.create({ 'b': 2 }) }); * * _.has(object, 'a'); * // => true * * _.has(object, 'a.b'); * // => true * * _.has(object, ['a', 'b']); * // => true * * _.has(other, 'a'); * // => false */function has(object,path){return object!=null&&hasPath(object,path,baseHas);}/** * Checks if `path` is a direct or inherited property of `object`. * * @static * @memberOf _ * @since 4.0.0 * @category Object * @param {Object} object The object to query. * @param {Array|string} path The path to check. * @returns {boolean} Returns `true` if `path` exists, else `false`. * @example * * var object = _.create({ 'a': _.create({ 'b': 2 }) }); * * _.hasIn(object, 'a'); * // => true * * _.hasIn(object, 'a.b'); * // => true * * _.hasIn(object, ['a', 'b']); * // => true * * _.hasIn(object, 'b'); * // => false */function hasIn(object,path){return object!=null&&hasPath(object,path,baseHasIn);}/** * Creates an object composed of the inverted keys and values of `object`. * If `object` contains duplicate values, subsequent values overwrite * property assignments of previous values. * * @static * @memberOf _ * @since 0.7.0 * @category Object * @param {Object} object The object to invert. * @returns {Object} Returns the new inverted object. * @example * * var object = { 'a': 1, 'b': 2, 'c': 1 }; * * _.invert(object); * // => { '1': 'c', '2': 'b' } */var invert=createInverter(function(result,value,key){result[value]=key;},constant(identity));/** * This method is like `_.invert` except that the inverted object is generated * from the results of running each element of `object` thru `iteratee`. The * corresponding inverted value of each inverted key is an array of keys * responsible for generating the inverted value. The iteratee is invoked * with one argument: (value). * * @static * @memberOf _ * @since 4.1.0 * @category Object * @param {Object} object The object to invert. * @param {Function} [iteratee=_.identity] The iteratee invoked per element. * @returns {Object} Returns the new inverted object. * @example * * var object = { 'a': 1, 'b': 2, 'c': 1 }; * * _.invertBy(object); * // => { '1': ['a', 'c'], '2': ['b'] } * * _.invertBy(object, function(value) { * return 'group' + value; * }); * // => { 'group1': ['a', 'c'], 'group2': ['b'] } */var invertBy=createInverter(function(result,value,key){if(hasOwnProperty.call(result,value)){result[value].push(key);}else{result[value]=[key];}},getIteratee);/** * Invokes the method at `path` of `object`. * * @static * @memberOf _ * @since 4.0.0 * @category Object * @param {Object} object The object to query. * @param {Array|string} path The path of the method to invoke. * @param {...*} [args] The arguments to invoke the method with. * @returns {*} Returns the result of the invoked method. * @example * * var object = { 'a': [{ 'b': { 'c': [1, 2, 3, 4] } }] }; * * _.invoke(object, 'a[0].b.c.slice', 1, 3); * // => [2, 3] */var invoke=baseRest(baseInvoke);/** * Creates an array of the own enumerable property names of `object`. * * **Note:** Non-object values are coerced to objects. See the * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys) * for more details. * * @static * @since 0.1.0 * @memberOf _ * @category Object * @param {Object} object The object to query. * @returns {Array} Returns the array of property names. * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.keys(new Foo); * // => ['a', 'b'] (iteration order is not guaranteed) * * _.keys('hi'); * // => ['0', '1'] */function keys(object){return isArrayLike(object)?arrayLikeKeys(object):baseKeys(object);}/** * Creates an array of the own and inherited enumerable property names of `object`. * * **Note:** Non-object values are coerced to objects. * * @static * @memberOf _ * @since 3.0.0 * @category Object * @param {Object} object The object to query. * @returns {Array} Returns the array of property names. * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.keysIn(new Foo); * // => ['a', 'b', 'c'] (iteration order is not guaranteed) */function keysIn(object){return isArrayLike(object)?arrayLikeKeys(object,true):baseKeysIn(object);}/** * The opposite of `_.mapValues`; this method creates an object with the * same values as `object` and keys generated by running each own enumerable * string keyed property of `object` thru `iteratee`. The iteratee is invoked * with three arguments: (value, key, object). * * @static * @memberOf _ * @since 3.8.0 * @category Object * @param {Object} object The object to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @returns {Object} Returns the new mapped object. * @see _.mapValues * @example * * _.mapKeys({ 'a': 1, 'b': 2 }, function(value, key) { * return key + value; * }); * // => { 'a1': 1, 'b2': 2 } */function mapKeys(object,iteratee){var result={};iteratee=getIteratee(iteratee,3);baseForOwn(object,function(value,key,object){baseAssignValue(result,iteratee(value,key,object),value);});return result;}/** * Creates an object with the same keys as `object` and values generated * by running each own enumerable string keyed property of `object` thru * `iteratee`. The iteratee is invoked with three arguments: * (value, key, object). * * @static * @memberOf _ * @since 2.4.0 * @category Object * @param {Object} object The object to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @returns {Object} Returns the new mapped object. * @see _.mapKeys * @example * * var users = { * 'fred': { 'user': 'fred', 'age': 40 }, * 'pebbles': { 'user': 'pebbles', 'age': 1 } * }; * * _.mapValues(users, function(o) { return o.age; }); * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed) * * // The `_.property` iteratee shorthand. * _.mapValues(users, 'age'); * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed) */function mapValues(object,iteratee){var result={};iteratee=getIteratee(iteratee,3);baseForOwn(object,function(value,key,object){baseAssignValue(result,key,iteratee(value,key,object));});return result;}/** * This method is like `_.assign` except that it recursively merges own and * inherited enumerable string keyed properties of source objects into the * destination object. Source properties that resolve to `undefined` are * skipped if a destination value exists. Array and plain object properties * are merged recursively. Other objects and value types are overridden by * assignment. Source objects are applied from left to right. Subsequent * sources overwrite property assignments of previous sources. * * **Note:** This method mutates `object`. * * @static * @memberOf _ * @since 0.5.0 * @category Object * @param {Object} object The destination object. * @param {...Object} [sources] The source objects. * @returns {Object} Returns `object`. * @example * * var object = { * 'a': [{ 'b': 2 }, { 'd': 4 }] * }; * * var other = { * 'a': [{ 'c': 3 }, { 'e': 5 }] * }; * * _.merge(object, other); * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] } */var merge=createAssigner(function(object,source,srcIndex){baseMerge(object,source,srcIndex);});/** * This method is like `_.merge` except that it accepts `customizer` which * is invoked to produce the merged values of the destination and source * properties. If `customizer` returns `undefined`, merging is handled by the * method instead. The `customizer` is invoked with six arguments: * (objValue, srcValue, key, object, source, stack). * * **Note:** This method mutates `object`. * * @static * @memberOf _ * @since 4.0.0 * @category Object * @param {Object} object The destination object. * @param {...Object} sources The source objects. * @param {Function} customizer The function to customize assigned values. * @returns {Object} Returns `object`. * @example * * function customizer(objValue, srcValue) { * if (_.isArray(objValue)) { * return objValue.concat(srcValue); * } * } * * var object = { 'a': [1], 'b': [2] }; * var other = { 'a': [3], 'b': [4] }; * * _.mergeWith(object, other, customizer); * // => { 'a': [1, 3], 'b': [2, 4] } */var mergeWith=createAssigner(function(object,source,srcIndex,customizer){baseMerge(object,source,srcIndex,customizer);});/** * The opposite of `_.pick`; this method creates an object composed of the * own and inherited enumerable property paths of `object` that are not omitted. * * **Note:** This method is considerably slower than `_.pick`. * * @static * @since 0.1.0 * @memberOf _ * @category Object * @param {Object} object The source object. * @param {...(string|string[])} [paths] The property paths to omit. * @returns {Object} Returns the new object. * @example * * var object = { 'a': 1, 'b': '2', 'c': 3 }; * * _.omit(object, ['a', 'c']); * // => { 'b': '2' } */var omit=flatRest(function(object,paths){var result={};if(object==null){return result;}var isDeep=false;paths=arrayMap(paths,function(path){path=castPath(path,object);isDeep||(isDeep=path.length>1);return path;});copyObject(object,getAllKeysIn(object),result);if(isDeep){result=baseClone(result,CLONE_DEEP_FLAG|CLONE_FLAT_FLAG|CLONE_SYMBOLS_FLAG,customOmitClone);}var length=paths.length;while(length--){baseUnset(result,paths[length]);}return result;});/** * The opposite of `_.pickBy`; this method creates an object composed of * the own and inherited enumerable string keyed properties of `object` that * `predicate` doesn't return truthy for. The predicate is invoked with two * arguments: (value, key). * * @static * @memberOf _ * @since 4.0.0 * @category Object * @param {Object} object The source object. * @param {Function} [predicate=_.identity] The function invoked per property. * @returns {Object} Returns the new object. * @example * * var object = { 'a': 1, 'b': '2', 'c': 3 }; * * _.omitBy(object, _.isNumber); * // => { 'b': '2' } */function omitBy(object,predicate){return pickBy(object,negate(getIteratee(predicate)));}/** * Creates an object composed of the picked `object` properties. * * @static * @since 0.1.0 * @memberOf _ * @category Object * @param {Object} object The source object. * @param {...(string|string[])} [paths] The property paths to pick. * @returns {Object} Returns the new object. * @example * * var object = { 'a': 1, 'b': '2', 'c': 3 }; * * _.pick(object, ['a', 'c']); * // => { 'a': 1, 'c': 3 } */var pick=flatRest(function(object,paths){return object==null?{}:basePick(object,paths);});/** * Creates an object composed of the `object` properties `predicate` returns * truthy for. The predicate is invoked with two arguments: (value, key). * * @static * @memberOf _ * @since 4.0.0 * @category Object * @param {Object} object The source object. * @param {Function} [predicate=_.identity] The function invoked per property. * @returns {Object} Returns the new object. * @example * * var object = { 'a': 1, 'b': '2', 'c': 3 }; * * _.pickBy(object, _.isNumber); * // => { 'a': 1, 'c': 3 } */function pickBy(object,predicate){if(object==null){return{};}var props=arrayMap(getAllKeysIn(object),function(prop){return[prop];});predicate=getIteratee(predicate);return basePickBy(object,props,function(value,path){return predicate(value,path[0]);});}/** * This method is like `_.get` except that if the resolved value is a * function it's invoked with the `this` binding of its parent object and * its result is returned. * * @static * @since 0.1.0 * @memberOf _ * @category Object * @param {Object} object The object to query. * @param {Array|string} path The path of the property to resolve. * @param {*} [defaultValue] The value returned for `undefined` resolved values. * @returns {*} Returns the resolved value. * @example * * var object = { 'a': [{ 'b': { 'c1': 3, 'c2': _.constant(4) } }] }; * * _.result(object, 'a[0].b.c1'); * // => 3 * * _.result(object, 'a[0].b.c2'); * // => 4 * * _.result(object, 'a[0].b.c3', 'default'); * // => 'default' * * _.result(object, 'a[0].b.c3', _.constant('default')); * // => 'default' */function result(object,path,defaultValue){path=castPath(path,object);var index=-1,length=path.length;// Ensure the loop is entered when path is empty. if(!length){length=1;object=undefined;}while(++index 4 * * _.set(object, ['x', '0', 'y', 'z'], 5); * console.log(object.x[0].y.z); * // => 5 */function set(object,path,value){return object==null?object:baseSet(object,path,value);}/** * This method is like `_.set` except that it accepts `customizer` which is * invoked to produce the objects of `path`. If `customizer` returns `undefined` * path creation is handled by the method instead. The `customizer` is invoked * with three arguments: (nsValue, key, nsObject). * * **Note:** This method mutates `object`. * * @static * @memberOf _ * @since 4.0.0 * @category Object * @param {Object} object The object to modify. * @param {Array|string} path The path of the property to set. * @param {*} value The value to set. * @param {Function} [customizer] The function to customize assigned values. * @returns {Object} Returns `object`. * @example * * var object = {}; * * _.setWith(object, '[0][1]', 'a', Object); * // => { '0': { '1': 'a' } } */function setWith(object,path,value,customizer){customizer=typeof customizer=='function'?customizer:undefined;return object==null?object:baseSet(object,path,value,customizer);}/** * Creates an array of own enumerable string keyed-value pairs for `object` * which can be consumed by `_.fromPairs`. If `object` is a map or set, its * entries are returned. * * @static * @memberOf _ * @since 4.0.0 * @alias entries * @category Object * @param {Object} object The object to query. * @returns {Array} Returns the key-value pairs. * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.toPairs(new Foo); * // => [['a', 1], ['b', 2]] (iteration order is not guaranteed) */var toPairs=createToPairs(keys);/** * Creates an array of own and inherited enumerable string keyed-value pairs * for `object` which can be consumed by `_.fromPairs`. If `object` is a map * or set, its entries are returned. * * @static * @memberOf _ * @since 4.0.0 * @alias entriesIn * @category Object * @param {Object} object The object to query. * @returns {Array} Returns the key-value pairs. * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.toPairsIn(new Foo); * // => [['a', 1], ['b', 2], ['c', 3]] (iteration order is not guaranteed) */var toPairsIn=createToPairs(keysIn);/** * An alternative to `_.reduce`; this method transforms `object` to a new * `accumulator` object which is the result of running each of its own * enumerable string keyed properties thru `iteratee`, with each invocation * potentially mutating the `accumulator` object. If `accumulator` is not * provided, a new object with the same `[[Prototype]]` will be used. The * iteratee is invoked with four arguments: (accumulator, value, key, object). * Iteratee functions may exit iteration early by explicitly returning `false`. * * @static * @memberOf _ * @since 1.3.0 * @category Object * @param {Object} object The object to iterate over. * @param {Function} [iteratee=_.identity] The function invoked per iteration. * @param {*} [accumulator] The custom accumulator value. * @returns {*} Returns the accumulated value. * @example * * _.transform([2, 3, 4], function(result, n) { * result.push(n *= n); * return n % 2 == 0; * }, []); * // => [4, 9] * * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) { * (result[value] || (result[value] = [])).push(key); * }, {}); * // => { '1': ['a', 'c'], '2': ['b'] } */function transform(object,iteratee,accumulator){var isArr=isArray(object),isArrLike=isArr||isBuffer(object)||isTypedArray(object);iteratee=getIteratee(iteratee,4);if(accumulator==null){var Ctor=object&&object.constructor;if(isArrLike){accumulator=isArr?new Ctor():[];}else if(isObject(object)){accumulator=isFunction(Ctor)?baseCreate(getPrototype(object)):{};}else{accumulator={};}}(isArrLike?arrayEach:baseForOwn)(object,function(value,index,object){return iteratee(accumulator,value,index,object);});return accumulator;}/** * Removes the property at `path` of `object`. * * **Note:** This method mutates `object`. * * @static * @memberOf _ * @since 4.0.0 * @category Object * @param {Object} object The object to modify. * @param {Array|string} path The path of the property to unset. * @returns {boolean} Returns `true` if the property is deleted, else `false`. * @example * * var object = { 'a': [{ 'b': { 'c': 7 } }] }; * _.unset(object, 'a[0].b.c'); * // => true * * console.log(object); * // => { 'a': [{ 'b': {} }] }; * * _.unset(object, ['a', '0', 'b', 'c']); * // => true * * console.log(object); * // => { 'a': [{ 'b': {} }] }; */function unset(object,path){return object==null?true:baseUnset(object,path);}/** * This method is like `_.set` except that accepts `updater` to produce the * value to set. Use `_.updateWith` to customize `path` creation. The `updater` * is invoked with one argument: (value). * * **Note:** This method mutates `object`. * * @static * @memberOf _ * @since 4.6.0 * @category Object * @param {Object} object The object to modify. * @param {Array|string} path The path of the property to set. * @param {Function} updater The function to produce the updated value. * @returns {Object} Returns `object`. * @example * * var object = { 'a': [{ 'b': { 'c': 3 } }] }; * * _.update(object, 'a[0].b.c', function(n) { return n * n; }); * console.log(object.a[0].b.c); * // => 9 * * _.update(object, 'x[0].y.z', function(n) { return n ? n + 1 : 0; }); * console.log(object.x[0].y.z); * // => 0 */function update(object,path,updater){return object==null?object:baseUpdate(object,path,castFunction(updater));}/** * This method is like `_.update` except that it accepts `customizer` which is * invoked to produce the objects of `path`. If `customizer` returns `undefined` * path creation is handled by the method instead. The `customizer` is invoked * with three arguments: (nsValue, key, nsObject). * * **Note:** This method mutates `object`. * * @static * @memberOf _ * @since 4.6.0 * @category Object * @param {Object} object The object to modify. * @param {Array|string} path The path of the property to set. * @param {Function} updater The function to produce the updated value. * @param {Function} [customizer] The function to customize assigned values. * @returns {Object} Returns `object`. * @example * * var object = {}; * * _.updateWith(object, '[0][1]', _.constant('a'), Object); * // => { '0': { '1': 'a' } } */function updateWith(object,path,updater,customizer){customizer=typeof customizer=='function'?customizer:undefined;return object==null?object:baseUpdate(object,path,castFunction(updater),customizer);}/** * Creates an array of the own enumerable string keyed property values of `object`. * * **Note:** Non-object values are coerced to objects. * * @static * @since 0.1.0 * @memberOf _ * @category Object * @param {Object} object The object to query. * @returns {Array} Returns the array of property values. * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.values(new Foo); * // => [1, 2] (iteration order is not guaranteed) * * _.values('hi'); * // => ['h', 'i'] */function values(object){return object==null?[]:baseValues(object,keys(object));}/** * Creates an array of the own and inherited enumerable string keyed property * values of `object`. * * **Note:** Non-object values are coerced to objects. * * @static * @memberOf _ * @since 3.0.0 * @category Object * @param {Object} object The object to query. * @returns {Array} Returns the array of property values. * @example * * function Foo() { * this.a = 1; * this.b = 2; * } * * Foo.prototype.c = 3; * * _.valuesIn(new Foo); * // => [1, 2, 3] (iteration order is not guaranteed) */function valuesIn(object){return object==null?[]:baseValues(object,keysIn(object));}/*------------------------------------------------------------------------*//** * Clamps `number` within the inclusive `lower` and `upper` bounds. * * @static * @memberOf _ * @since 4.0.0 * @category Number * @param {number} number The number to clamp. * @param {number} [lower] The lower bound. * @param {number} upper The upper bound. * @returns {number} Returns the clamped number. * @example * * _.clamp(-10, -5, 5); * // => -5 * * _.clamp(10, -5, 5); * // => 5 */function clamp(number,lower,upper){if(upper===undefined){upper=lower;lower=undefined;}if(upper!==undefined){upper=toNumber(upper);upper=upper===upper?upper:0;}if(lower!==undefined){lower=toNumber(lower);lower=lower===lower?lower:0;}return baseClamp(toNumber(number),lower,upper);}/** * Checks if `n` is between `start` and up to, but not including, `end`. If * `end` is not specified, it's set to `start` with `start` then set to `0`. * If `start` is greater than `end` the params are swapped to support * negative ranges. * * @static * @memberOf _ * @since 3.3.0 * @category Number * @param {number} number The number to check. * @param {number} [start=0] The start of the range. * @param {number} end The end of the range. * @returns {boolean} Returns `true` if `number` is in the range, else `false`. * @see _.range, _.rangeRight * @example * * _.inRange(3, 2, 4); * // => true * * _.inRange(4, 8); * // => true * * _.inRange(4, 2); * // => false * * _.inRange(2, 2); * // => false * * _.inRange(1.2, 2); * // => true * * _.inRange(5.2, 4); * // => false * * _.inRange(-3, -2, -6); * // => true */function inRange(number,start,end){start=toFinite(start);if(end===undefined){end=start;start=0;}else{end=toFinite(end);}number=toNumber(number);return baseInRange(number,start,end);}/** * Produces a random number between the inclusive `lower` and `upper` bounds. * If only one argument is provided a number between `0` and the given number * is returned. If `floating` is `true`, or either `lower` or `upper` are * floats, a floating-point number is returned instead of an integer. * * **Note:** JavaScript follows the IEEE-754 standard for resolving * floating-point values which can produce unexpected results. * * @static * @memberOf _ * @since 0.7.0 * @category Number * @param {number} [lower=0] The lower bound. * @param {number} [upper=1] The upper bound. * @param {boolean} [floating] Specify returning a floating-point number. * @returns {number} Returns the random number. * @example * * _.random(0, 5); * // => an integer between 0 and 5 * * _.random(5); * // => also an integer between 0 and 5 * * _.random(5, true); * // => a floating-point number between 0 and 5 * * _.random(1.2, 5.2); * // => a floating-point number between 1.2 and 5.2 */function random(lower,upper,floating){if(floating&&typeof floating!='boolean'&&isIterateeCall(lower,upper,floating)){upper=floating=undefined;}if(floating===undefined){if(typeof upper=='boolean'){floating=upper;upper=undefined;}else if(typeof lower=='boolean'){floating=lower;lower=undefined;}}if(lower===undefined&&upper===undefined){lower=0;upper=1;}else{lower=toFinite(lower);if(upper===undefined){upper=lower;lower=0;}else{upper=toFinite(upper);}}if(lower>upper){var temp=lower;lower=upper;upper=temp;}if(floating||lower%1||upper%1){var rand=nativeRandom();return nativeMin(lower+rand*(upper-lower+freeParseFloat('1e-'+((rand+'').length-1))),upper);}return baseRandom(lower,upper);}/*------------------------------------------------------------------------*//** * Converts `string` to [camel case](https://en.wikipedia.org/wiki/CamelCase). * * @static * @memberOf _ * @since 3.0.0 * @category String * @param {string} [string=''] The string to convert. * @returns {string} Returns the camel cased string. * @example * * _.camelCase('Foo Bar'); * // => 'fooBar' * * _.camelCase('--foo-bar--'); * // => 'fooBar' * * _.camelCase('__FOO_BAR__'); * // => 'fooBar' */var camelCase=createCompounder(function(result,word,index){word=word.toLowerCase();return result+(index?capitalize(word):word);});/** * Converts the first character of `string` to upper case and the remaining * to lower case. * * @static * @memberOf _ * @since 3.0.0 * @category String * @param {string} [string=''] The string to capitalize. * @returns {string} Returns the capitalized string. * @example * * _.capitalize('FRED'); * // => 'Fred' */function capitalize(string){return upperFirst(toString(string).toLowerCase());}/** * Deburrs `string` by converting * [Latin-1 Supplement](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table) * and [Latin Extended-A](https://en.wikipedia.org/wiki/Latin_Extended-A) * letters to basic Latin letters and removing * [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks). * * @static * @memberOf _ * @since 3.0.0 * @category String * @param {string} [string=''] The string to deburr. * @returns {string} Returns the deburred string. * @example * * _.deburr('déjà vu'); * // => 'deja vu' */function deburr(string){string=toString(string);return string&&string.replace(reLatin,deburrLetter).replace(reComboMark,'');}/** * Checks if `string` ends with the given target string. * * @static * @memberOf _ * @since 3.0.0 * @category String * @param {string} [string=''] The string to inspect. * @param {string} [target] The string to search for. * @param {number} [position=string.length] The position to search up to. * @returns {boolean} Returns `true` if `string` ends with `target`, * else `false`. * @example * * _.endsWith('abc', 'c'); * // => true * * _.endsWith('abc', 'b'); * // => false * * _.endsWith('abc', 'b', 2); * // => true */function endsWith(string,target,position){string=toString(string);target=baseToString(target);var length=string.length;position=position===undefined?length:baseClamp(toInteger(position),0,length);var end=position;position-=target.length;return position>=0&&string.slice(position,end)==target;}/** * Converts the characters "&", "<", ">", '"', and "'" in `string` to their * corresponding HTML entities. * * **Note:** No other characters are escaped. To escape additional * characters use a third-party library like [_he_](https://mths.be/he). * * Though the ">" character is escaped for symmetry, characters like * ">" and "/" don't need escaping in HTML and have no special meaning * unless they're part of a tag or unquoted attribute value. See * [Mathias Bynens's article](https://mathiasbynens.be/notes/ambiguous-ampersands) * (under "semi-related fun fact") for more details. * * When working with HTML you should always * [quote attribute values](http://wonko.com/post/html-escaping) to reduce * XSS vectors. * * @static * @since 0.1.0 * @memberOf _ * @category String * @param {string} [string=''] The string to escape. * @returns {string} Returns the escaped string. * @example * * _.escape('fred, barney, & pebbles'); * // => 'fred, barney, & pebbles' */function escape(string){string=toString(string);return string&&reHasUnescapedHtml.test(string)?string.replace(reUnescapedHtml,escapeHtmlChar):string;}/** * Escapes the `RegExp` special characters "^", "$", "\", ".", "*", "+", * "?", "(", ")", "[", "]", "{", "}", and "|" in `string`. * * @static * @memberOf _ * @since 3.0.0 * @category String * @param {string} [string=''] The string to escape. * @returns {string} Returns the escaped string. * @example * * _.escapeRegExp('[lodash](https://lodash.com/)'); * // => '\[lodash\]\(https://lodash\.com/\)' */function escapeRegExp(string){string=toString(string);return string&&reHasRegExpChar.test(string)?string.replace(reRegExpChar,'\\$&'):string;}/** * Converts `string` to * [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles). * * @static * @memberOf _ * @since 3.0.0 * @category String * @param {string} [string=''] The string to convert. * @returns {string} Returns the kebab cased string. * @example * * _.kebabCase('Foo Bar'); * // => 'foo-bar' * * _.kebabCase('fooBar'); * // => 'foo-bar' * * _.kebabCase('__FOO_BAR__'); * // => 'foo-bar' */var kebabCase=createCompounder(function(result,word,index){return result+(index?'-':'')+word.toLowerCase();});/** * Converts `string`, as space separated words, to lower case. * * @static * @memberOf _ * @since 4.0.0 * @category String * @param {string} [string=''] The string to convert. * @returns {string} Returns the lower cased string. * @example * * _.lowerCase('--Foo-Bar--'); * // => 'foo bar' * * _.lowerCase('fooBar'); * // => 'foo bar' * * _.lowerCase('__FOO_BAR__'); * // => 'foo bar' */var lowerCase=createCompounder(function(result,word,index){return result+(index?' ':'')+word.toLowerCase();});/** * Converts the first character of `string` to lower case. * * @static * @memberOf _ * @since 4.0.0 * @category String * @param {string} [string=''] The string to convert. * @returns {string} Returns the converted string. * @example * * _.lowerFirst('Fred'); * // => 'fred' * * _.lowerFirst('FRED'); * // => 'fRED' */var lowerFirst=createCaseFirst('toLowerCase');/** * Pads `string` on the left and right sides if it's shorter than `length`. * Padding characters are truncated if they can't be evenly divided by `length`. * * @static * @memberOf _ * @since 3.0.0 * @category String * @param {string} [string=''] The string to pad. * @param {number} [length=0] The padding length. * @param {string} [chars=' '] The string used as padding. * @returns {string} Returns the padded string. * @example * * _.pad('abc', 8); * // => ' abc ' * * _.pad('abc', 8, '_-'); * // => '_-abc_-_' * * _.pad('abc', 3); * // => 'abc' */function pad(string,length,chars){string=toString(string);length=toInteger(length);var strLength=length?stringSize(string):0;if(!length||strLength>=length){return string;}var mid=(length-strLength)/2;return createPadding(nativeFloor(mid),chars)+string+createPadding(nativeCeil(mid),chars);}/** * Pads `string` on the right side if it's shorter than `length`. Padding * characters are truncated if they exceed `length`. * * @static * @memberOf _ * @since 4.0.0 * @category String * @param {string} [string=''] The string to pad. * @param {number} [length=0] The padding length. * @param {string} [chars=' '] The string used as padding. * @returns {string} Returns the padded string. * @example * * _.padEnd('abc', 6); * // => 'abc ' * * _.padEnd('abc', 6, '_-'); * // => 'abc_-_' * * _.padEnd('abc', 3); * // => 'abc' */function padEnd(string,length,chars){string=toString(string);length=toInteger(length);var strLength=length?stringSize(string):0;return length&&strLength ' abc' * * _.padStart('abc', 6, '_-'); * // => '_-_abc' * * _.padStart('abc', 3); * // => 'abc' */function padStart(string,length,chars){string=toString(string);length=toInteger(length);var strLength=length?stringSize(string):0;return length&&strLength 8 * * _.map(['6', '08', '10'], _.parseInt); * // => [6, 8, 10] */function parseInt(string,radix,guard){if(guard||radix==null){radix=0;}else if(radix){radix=+radix;}return nativeParseInt(toString(string).replace(reTrimStart,''),radix||0);}/** * Repeats the given string `n` times. * * @static * @memberOf _ * @since 3.0.0 * @category String * @param {string} [string=''] The string to repeat. * @param {number} [n=1] The number of times to repeat the string. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {string} Returns the repeated string. * @example * * _.repeat('*', 3); * // => '***' * * _.repeat('abc', 2); * // => 'abcabc' * * _.repeat('abc', 0); * // => '' */function repeat(string,n,guard){if(guard?isIterateeCall(string,n,guard):n===undefined){n=1;}else{n=toInteger(n);}return baseRepeat(toString(string),n);}/** * Replaces matches for `pattern` in `string` with `replacement`. * * **Note:** This method is based on * [`String#replace`](https://mdn.io/String/replace). * * @static * @memberOf _ * @since 4.0.0 * @category String * @param {string} [string=''] The string to modify. * @param {RegExp|string} pattern The pattern to replace. * @param {Function|string} replacement The match replacement. * @returns {string} Returns the modified string. * @example * * _.replace('Hi Fred', 'Fred', 'Barney'); * // => 'Hi Barney' */function replace(){var args=arguments,string=toString(args[0]);return args.length<3?string:string.replace(args[1],args[2]);}/** * Converts `string` to * [snake case](https://en.wikipedia.org/wiki/Snake_case). * * @static * @memberOf _ * @since 3.0.0 * @category String * @param {string} [string=''] The string to convert. * @returns {string} Returns the snake cased string. * @example * * _.snakeCase('Foo Bar'); * // => 'foo_bar' * * _.snakeCase('fooBar'); * // => 'foo_bar' * * _.snakeCase('--FOO-BAR--'); * // => 'foo_bar' */var snakeCase=createCompounder(function(result,word,index){return result+(index?'_':'')+word.toLowerCase();});/** * Splits `string` by `separator`. * * **Note:** This method is based on * [`String#split`](https://mdn.io/String/split). * * @static * @memberOf _ * @since 4.0.0 * @category String * @param {string} [string=''] The string to split. * @param {RegExp|string} separator The separator pattern to split by. * @param {number} [limit] The length to truncate results to. * @returns {Array} Returns the string segments. * @example * * _.split('a-b-c', '-', 2); * // => ['a', 'b'] */function split(string,separator,limit){if(limit&&typeof limit!='number'&&isIterateeCall(string,separator,limit)){separator=limit=undefined;}limit=limit===undefined?MAX_ARRAY_LENGTH:limit>>>0;if(!limit){return[];}string=toString(string);if(string&&(typeof separator=='string'||separator!=null&&!isRegExp(separator))){separator=baseToString(separator);if(!separator&&hasUnicode(string)){return castSlice(stringToArray(string),0,limit);}}return string.split(separator,limit);}/** * Converts `string` to * [start case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage). * * @static * @memberOf _ * @since 3.1.0 * @category String * @param {string} [string=''] The string to convert. * @returns {string} Returns the start cased string. * @example * * _.startCase('--foo-bar--'); * // => 'Foo Bar' * * _.startCase('fooBar'); * // => 'Foo Bar' * * _.startCase('__FOO_BAR__'); * // => 'FOO BAR' */var startCase=createCompounder(function(result,word,index){return result+(index?' ':'')+upperFirst(word);});/** * Checks if `string` starts with the given target string. * * @static * @memberOf _ * @since 3.0.0 * @category String * @param {string} [string=''] The string to inspect. * @param {string} [target] The string to search for. * @param {number} [position=0] The position to search from. * @returns {boolean} Returns `true` if `string` starts with `target`, * else `false`. * @example * * _.startsWith('abc', 'a'); * // => true * * _.startsWith('abc', 'b'); * // => false * * _.startsWith('abc', 'b', 1); * // => true */function startsWith(string,target,position){string=toString(string);position=position==null?0:baseClamp(toInteger(position),0,string.length);target=baseToString(target);return string.slice(position,position+target.length)==target;}/** * Creates a compiled template function that can interpolate data properties * in "interpolate" delimiters, HTML-escape interpolated data properties in * "escape" delimiters, and execute JavaScript in "evaluate" delimiters. Data * properties may be accessed as free variables in the template. If a setting * object is given, it takes precedence over `_.templateSettings` values. * * **Note:** In the development build `_.template` utilizes * [sourceURLs](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl) * for easier debugging. * * For more information on precompiling templates see * [lodash's custom builds documentation](https://lodash.com/custom-builds). * * For more information on Chrome extension sandboxes see * [Chrome's extensions documentation](https://developer.chrome.com/extensions/sandboxingEval). * * @static * @since 0.1.0 * @memberOf _ * @category String * @param {string} [string=''] The template string. * @param {Object} [options={}] The options object. * @param {RegExp} [options.escape=_.templateSettings.escape] * The HTML "escape" delimiter. * @param {RegExp} [options.evaluate=_.templateSettings.evaluate] * The "evaluate" delimiter. * @param {Object} [options.imports=_.templateSettings.imports] * An object to import into the template as free variables. * @param {RegExp} [options.interpolate=_.templateSettings.interpolate] * The "interpolate" delimiter. * @param {string} [options.sourceURL='lodash.templateSources[n]'] * The sourceURL of the compiled template. * @param {string} [options.variable='obj'] * The data object variable name. * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`. * @returns {Function} Returns the compiled template function. * @example * * // Use the "interpolate" delimiter to create a compiled template. * var compiled = _.template('hello <%= user %>!'); * compiled({ 'user': 'fred' }); * // => 'hello fred!' * * // Use the HTML "escape" delimiter to escape data property values. * var compiled = _.template('<%- value %>'); * compiled({ 'value': '